D 11825
D 11825
THIRD SEMESTER (CUCBCSS-UG) DEGREE EXAMINATION
NOVEMBER 2021
Computer Science
BCS 3B 04-DATA STRUCTURES USING C
(2017-2018 Admissions)
Time:Three Hours Maximum: 80 Marks
Part A
Answer all questions Each question carries 1 mark.
1. If several elements are competing for the same bucket in the hash table, then it is called
As ________
(a) Diffusion (b) Collision
(c) Replication (d) Duplication.
2. Elements in an array are accessed __________
(a) Randomly. (b) Exponentially
(d) Logarithmically (e) Sequentially
3. Linked lists are best suited for __________
(a) Relatively permanent collections of data.
(b) The size of the structure and the data in the structure are constanly changing.
(c) Both (A) and (B)
(d) None of the above.
4.Which of the following are applications of linked lista?
(a) Implementing file system (b) Chaining in hash tables.
(c) Binary tree implementation. (d) All of the above.
5. If the elements "A", "B", "C" and "D" are placed in a queue and are deleted one at a time,
in what order will they be removed?
(a) ABCD. (b) DCBA.
(c) DCAB. (d)ABDC
6. Process of inserting an element in stack is called _________
(a) Insert (b) Push.
(e)Pap (d)None of the above.
7. What is a full binary tree?
(a) Each node has exactly two children
(b) Each node has exactly zero or two children.
(c) All the leaves are at the same level.
(d) Each node has exactly one or two children
8.To represent hierarchical relationship between elements, which data structure is suitable
(a) Dequeue .(b)Priority.
(c) Tree (d) Graph..
9. Complexity of linear search algorithm is __________
(a) O(n logn). (b) O (n2)
(c) O(log n). (d) O(n).
10. The data structure used in standard implementation of Breadth First Search is ________
(a) Stack (b) Queue.
(c) Linked List (d) Tree:
( 10 x 1 = 10 marks)
Part B
Answer all questions. Each question carries 3 marks.
11. What are the different categories of data structures? Explain.
12. Explain the memory representation of two-dimensional arrays with an example.
13. What are queues? Explain the applications of queue.
14. What is a tree? Explain the representation tree using linked list.
15. What are the different types of graphs?
( 5 x 3 = 15 marks)
Part C
Answer any five questions. Each question carries 5 marks.
16. What is an algorithm? Explain time and space complexity of an algorithm with illustration. 17. Explain any one pattern matcing algorithm.
18. Explain the differences between one dimensions, two dimensional and multi-dimensional
arrays.
19. Write an algorithm for searching a specific key element in a linked list.
20. Explain the implementation of stack using arrays.
21. Draw a binary tree for the expression: A * B - (C + D) " (P/Q)....
22. Differentiate between directed and undirected graph with examples.
23. Explain binary search algorithm. Also analyse the complexity of the algorithm.
( 5 x 5 = 25 marks)
Part D
Answer any three questions. Each question carries 10 marks.
24. What is a string? Explain how it is represented using C language. Also discuss the
different operations on strings.
25. Explain the procedure for adding and deleting a node at the end of two-way linked list.
26. Write an algorithm to convert a given infix expression to postfix expression? Trace the
steps involved in converting the infix expression ((A+B) ^C)-((D*C)/F) to postfix expression.
27. Explain BFS and DFS traversal algorithms on graph with illustration.
28. Draw the binary search tree whose elements are inserted in the following order:
42, 72, 65, 35, 54, 78, 96, 12, 15, 69.
( 3 x 10 = 30 marks)
നിങ്ങൾക്ക് ഉപകാരപ്പെട്ടെങ്കിൽ നിങ്ങളുടെ കൂട്ടുകാർക്ക് കൂടി ഷെയർ ചെയ്യുക
Share This
