SECTION B (5 x 5 = 25 marks)

MODEL EXAMINATION OCT 2019 Answer all the questions:

DEPARTMENT OF COMPUTER SCIENCE 11.a) Explain about introduction of algorithms. (OR)
II BSC (CS) & II BCA b) Describe an analyzing algorithms.
DATA STRUCTURES 12.a) Explain about stack and its algorithms. (OR)
Time:3 hrs Marks: 75 b) Explain about queue and its algorithms.
13.a) Explain about circular queue and its algorithms. (OR)
SECTION A (10 x 1 = 10 marks) b) Explain about conversion of infix to postfix.
Fill in the blanks: 14.a) Explain about more on linked list algorithms. (OR)
1. Computer science can be defined as the___________. b) Describe about doubly linked list.
2. LIFO stands for_____________ 15.a) Explain about binary tree. (OR)
3. An_______ is made up operands, operators and delimiters. b) Describe about storage devices.
4. Matrices that have many of the entries were zero called as___________ SECTION C (5 x 8 = 40 marks)
5. _________is the process of collecting all unused nodes and returning Answer all the questions:
them to available space. 16. a) Describe basic terminology of Trees. (OR)
6. A_________ stands for the item of information plus the branches to b) Explain about sparse matrices.
other items. 17. a) Explain about representation of arrays. (OR)
7. The number of sub trees of a node is called a __________. b) Describe evaluation of Expressions.
8. Nodes that have degree zero are called__________. 18. a) Explain about singly linked list. (OR)
9. Children’s of the same parent are said to be_______________. b) Describe about linked stack and queue.
10. The_______ of a node are all the nodes along the path from the root to 19. a) Explain about polynomial addition. (OR)
that node. b) Describe garbage collection and compaction.
20. a) Explain about dynamic storage management. (OR)
b) Explain about file organizations.