Scribd
Upload
3 views2 pages

Suggestion CS 201

3

Uploaded by

bobbykumarsingh16
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Suggestion CS 201

3

Uploaded by

bobbykumarsingh16
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1. Define ADT with proper example.

2. In a two dimensional array with size 10X9, each element occupies 4 bytes of memory
space and the address of the first element [1, 1] is 1000. Find the address of the element
at the position [6, 8] for both Row-major and Column-major ordering.
3. Explain the operation principal of Quick Sort with a suitable example.
4. Calculate the time complexity of Quick Sort.
5. Describe the advantages of linked list over array?
6. Write an algorithm to insert a node at the beginning of Singly linked list.
7. Write the function in C to Sort the following mentioned array by using Selection Sort in
ascending order. [ 10,5,15,19,7,3 ]
8. Define Heap with proper diagram?
9. Construct a min-heap with the following numbers. Show each step.
100,200,30,50,40,500,250,175
10. Construct a binary tree whose nodes in inorder and postorder are given as follows:
In order: {4, 8, 2, 5, 1, 6, 3, 7}
Post order: {8, 4, 5, 2, 6, 7, 3, 1}
11. Explain the requirement of Hashing?
12. Describe the different types of collision resolution strategies in open addressing?
13. Convert the following infix expressions into its equivalent postfix expressions using
Stack.
A*(B+ D)/ E − F*(G + H / K)
14. Evaluate the postfix expression-9-((3*4)+8)/4
15. Write the algorithm of Deletion a node from the end in the Singly linked list.
16. A) Construct a binary tree whose nodes in inorder and preorder are given as follows:
In order: 10, 15, 17, 18, 20, 25, 30, 35, 38, 40, 50
Pre order: 20, 15, 10, 18, 17, 30, 25, 40, 35, 38, 50

b) After the creation, delete the below mentioned nodes from the tree
35, 15 and 30
17. How can a polynomial such as 7x4 – 4x3 + 9x2 + 2x + 6 be represented by a linked list?
18. Draw a B-tree of order 4 for the following sequence of keys.
5,3,21,9,13,22,7,10,11,14,8,16
19. Write the algorithm of Merge sort. Calculate the time complexity of merge sort.
20. Travers the below mentioned graph in DFS manner.
21. State the differences between BFS and DFS.
22. Explain the operation principal of Bubble Sort with a suitable example.
23. Define adjacency matrix and draw an undirected graph using the below mentioned
adjacency matrix.

24. Write short note

Hash functions
Tower of Hanoi
Threaded Binary Tree
Sparse Matrix
Double ended queue

You might also like