Define “Data Structure”. Why data structure plays an important role in success of a sowftware.
[3 marks]Differntiate “Linear Seach” and “Binary Search”.
[4 marks]Write a program to convert a string entered by user into uppercase without using any library function.
[7 marks]Define “Time” and “Space” complexity of algorithm.
[3 marks]Write applications of stack as a data structure in real world scenarios.
[4 marks]Write a menu driven Cprgram to implement PUSH(), POP() and PRINT() for the “Stack” data structure.
[7 marks]Write a menu driven Cprgram to implement ENQUEUE(), DEQUEUE () and PRINT() for the “Queue” data structure.
[7 marks]Compare stack and queue data strcutures.
[3 marks]Write a Cprogram to print fibonanci series upto ‘n’ terms.
[4 marks]Write an algorithm to convert given infix expression to postfix. Explain steps to covert an infix expression 2 * (3 + 4) - 5 into postfix.
[7 marks]Compare simple vs circular queue.
[3 marks]What do you mean by recursion? Write a recursive program to find factorial of the given number.
[4 marks]Write an algorithm to convert given prefix expression to postfix. Explain steps to covert an infix expression + * 2 + 4 5 into postfix.
[3 marks]What do you mean by “link list”. Write application of it.
[3 marks]What do you mean by dynamic memory allocation. List syntax and application of following functions : malloc(), calloc() and dealloc().
[4 marks]Write a menu based Cpogram to insert a new node in “link list” 1) at the beginning of list 2) after a given node 3) at the end of a list.
[7 marks]Define doubly link list and list advantage of it.
[3 marks]What is Pointer? List advantage of it.1
[4 marks]Write a menu based Cpogram to insert a new node in “doubly link list” 1) at the beginning of list 2) after a given node 3) at the end of a list.
[7 marks]Write in-oder traversal and post-order traversal for following tree.
[3 marks]Write an algoirhm for “merge sort”.
[4 marks]Define following in terms of Tree 1) Depth of Tree 2) Binay Search Tree 3) Complete Binary Tree
[7 marks]Define following in terms of Tree. 1) Leaf node 2) In-degree of node in a tree 3) Depth of a tree
[3 marks]What do you mean by hashing? List and explain techniques to handle “hash collision”.
[4 marks]Write an algorithm to insert a new node in binary tree.
[7 marks]