SENGUNTHAR ARTS AND SCIENCE COLLEGE
(Affiliated to Periyar University, Salem and Approved by AICTE, New Delhi)
An ISO 9001:2015 Certified Institution recognized under section 2(f) and 12(B) of the UGC Act 1956
Accredited by NAAC with A+
TIRUCHENGODE – 637 205, NAMAKKAL DT., TAMILNADU
MODEL EXAMINATION- APRIL 2024
Data Structure and Algorithms
Class: I B.Sc(CS) Paper Code: 23USCCC02
Time: 3 Hrs Max: 75 marks
SECTION –A
I. ANSWER ALL THE QUESTIONS [15*1=15]
1. What is a data structure?
a) A programming language b) A collection of algorithms c) A way to store and organize data
d) A type of computer hardware
2. The data structure required to check whether an expression contains a balanced parenthesis
is?
a) Queue b) Stack c) Tree d) Array
3. Which data structure is needed to convert infix notation to postfix notation?
a) Tree b) Branch c) Stack d) Queue
4. What is the value of the postfix expression 6 3 2 4 + – *?
a) 74 b) -18 c) 22 d) 40
5. The data structure required for Breadth First Traversal on a graph is?
a) Array b) Stack c) Tree d) Queue
6. What is an AVL tree?
a) a tree which is unbalanced and is a height balanced tree
b) a tree which is balanced and is a height balanced tree
c) a tree with atmost 3 children d) a tree with three children
7. What is a dequeue?
a) A queue implemented with both singly and doubly linked lists
b) A queue with insert/delete defined for front side of the queue
c) A queue with insert/delete defined for both front and rear ends of the queue
d) A queue implemented with a doubly linked list
8. The leaves of an expression tree always contain?
a) operators b) operands c) null d) expression
9. An expression tree is a kind of?
a) Binary search tree b) Fibonacci tree c) Binary tree d) Treap
10. An expression tree is created using?
a) postfix expression b) prefix expression c) infix expression d) parenthesized
11. An expression tree’s nodes can be deleted by calling?
a) malloc b) calloc c) delete d) free
12. A graph having an edge from each vertex to every other vertex is called a ___________
a) Tightly Connected b) Strongly Connected c) Weakly Connected d) Loosely Connected
13. If several elements are competing for the same bucket in the hash table, what is it called?
a) Diffusion b) Replication c) Collision d) Duplication
14. Which of the following is an infix expression?
a) (a+b)*(c+d) b) ab+c* c) +ab d) abc+*
15. In infix to postfix conversion algorithm, the operators are associated from?
a) right to left b) left to right c) Centre to left d) Centre to right
SECTION- B [2*5=10]
II. Answer the any 2 of the following:
16. Write about data structure in C.
17. Write about POP operation on stack.
18. Explain about tree traversal with an example
19. Write about representation of graph.
20. Write about hash function with an example.
SECTION- C [5*10=50]
III. Answer the following in about 200 words each:
21. a) Write about Singly linked list with an example.(OR)
b) Write about array based implementation with an example.
22. a) Write about conversion of infix to postfix expression with an example. (OR)
b) Write about linked list implementation on stack with an example.
23. a) Write detailed notes on Binary search tree with an example. (OR)
b) Explain about B+ tree with an example.
24. a) Explain about DFS. (OR)
b) Explain about Euler circuit with an example.
25. a) Explain about binary search with an example. (OR)
b) Explain about Insertion sort with an example.
CO’S PATTERNS
Questions. No
S.NO CO’S
PART-A PART-B PART-C
1. CO-1 16,17 21a,24a
2. CO-2 22a,22b
3. CO-3 19 25(a),24(b)
4. CO-4
5. CO-5 18,20 23(b),25(b)
6. CO-6 1-15 21b,23(a)
