Compare array and linked list.
[3 marks]Compare primitive and non primitive data types. datastructures
[4 marks]Write an algorithm to perform insert and delete operations on simple queue.
[7 marks]Search the number 50 from the given data using binary search technique. Illustrate the searching process. 10, 14, 20, 39, 41, 45, 49, 50, 60
[3 marks]Apply merge sort algorithm to the following elements. 20, 10, 5, 15, 25, 30, 50, 35
[4 marks]Write a ‘C’ program for bubble sort.
[7 marks]What is stack? Why do we use multiple stacks?
[3 marks]Convert the following infix expressions to their prefix and postfix equivalents. 1. A*B+C/D 2. (A*B)+(C/D)-(D+E)
[4 marks]What is priority queue? Discuss its applications and implementation details.
[7 marks]Evaluate the following postfix expression using stack. 53+62/*35*+
[3 marks]Design an algorithm to perform insert operation in circular queue.
[4 marks]Design an algorithm to merge two linked list.
[7 marks]Define: 1. Acyclic graph 2. Leaf node 3. Complete binary tree
[3 marks]For following expressions, construct the corresponding binary tree. 1. A+B/C*D-E 2. ((A+B)-(C*D))%((E^F)/(G-H))
[4 marks]How are graphs represented inside a computer’s memory? Which method do you prefer and why?
[7 marks]Define: 1. Connected graph 2. Threaded tree 3. Degree of node
[3 marks]Differentiate between depth first search and breadth first search.
[4 marks]Design an algorithm to insert a given value in the binary search tree.
[7 marks]Explain basic file operations.
[3 marks]List out applications of hashing.
[4 marks]What is file organization? Briefly summarize different file organizations.1
[7 marks]Give a brief note on indexing.
[3 marks]Build a chained hash table of 10 memory locations. Insert the keys 131, 3, 4, 21, 61, 24, 7, 97, 8, 9 in hash table using chaining. Use h(k) = k mod m. (m=10)
[4 marks]Consider the hash table of size 10. Using quadratic probing, insert the keys 72, 27, 36, 24, 63, 81, and 101 into hash table. Take c =1 and c =3.12
[7 marks]