Annamalai University Model Question Paper : BSc Computer Science

Name of the Organisation : Annamalai University (annamalaiuniversity.ac.in)
Type of Announcement : B.Sc. Computer Science Model Question Paper
Home Page : http://annamalaiuniversity.ac.in

B.Sc. DEGREE EXAMINATION, 2010
(COMPUTER SCIENCE) (SECOND YEAR)
(PART-III) (PAPER-V)
611. COMPUTER ARCHITECTURE AND MICROPROCESSORS
(New Regulation) (Including Lateral Entry)
Time: 3 Hours
Maximum: 100 Marks
SECTION-A
Answer any EIGHT questions (8×5=40)
All questions carry equal marks
1. Convert the following decimal numbers to Hexadecimal number.
a) 429 b) 7421
2. Compare interpreter and complier.
3. Explain the various buses in 8085.
4. Explain the circuit and working of a demultiplexer.
5. Explain the instruction format of 8085.
6. What is Data masking? Explain.
7. Write an ALP to transfer block of data available in memory to a different location.
8. What is meant by stack? Discuss PUSH and POP operation.
9. Discuss in detail about the I/O mapped I/O scheme.
10. With an example, explain the closed loop processing control.
SECTION-B
Answer any THREE questions (3×20=60)
All questions carry equal marks
11. What are the basic laws of Boolean algebra? Explain.
12. Draw the block diagram of a 8085 P and explain the functions of each block.
13. Explain the various instruction set of 8085 giving two examples for each.
14. Write 8085 code for a delay loop. Assume your own delay. By means of a flow chart explain the working of the delay loop.
15. Discuss the hardware and software requirements of microprocessor-based system for temperature measurement and control.

M.Sc. DEGREE EXAMINATION, 2012 ( COMPUTER SCIENCE )
( FIRST SEMESTER ) ( PAPER – I )
111. DATA STRUCTURES AND ALGORITHMS December
Time : 3 Hours
Maximum : 100 Marks
PART – A (8 × 5 = 40)
Answer any EIGHT questions.
ALL questions carry EQUAL marks.
1. Define linked list with an example.
2. What is meant by a graph? Give an example.
3. Give the algorithm for Strassen’s Matrix Multiplication method.
4. How to obtain the single source shortest path using the Greedy algorithm?
5. Explain the concept of multistage graph.
6. Give an example for AND / OR graph and discuss it.
7 What is meant by back tracking?
8. Explain the concept of branch and bound technique.
9. Mention the basic concepts involved in NP-Hard graph problems.
10. What is meant by NP- complete problems?
PART – B (3 × 20 = 60)
Answer any THREE questions.
ALL questions carry EQUAL marks.
11.How stacks differ from queues? Explain with examples.
12. Describe the algorithm for binary search.
13. How to apply dynamic programming concept for the travelling sales person problem?
14. What is meant by graph colouring? How to obtain it?
15. Discuss the concept involved in NP-Hard code generation problems.

More Questions Refer the PDF link :  https://www.indianjobtalks.in/uploads/8884-Question%20Paper%20%20BSc%20Computer%20Science.doc