B.Tech {3rd semester}
DATA STRUCTURES USING ‘C’
time: 3Hours Maximum Marks: 100
Hello, Everyone, Welcome to our blog My Notes. Today we are sharing some important questions of Data Structure for B.tech 3rd Year Computer science Student. Enjoy the questions and try to solve them yourself.
Hope these questions help you in your exams.
Attempt all questions:
Hope these questions help you in your exams.
Attempt all questions:
(A) Explain data structure and its operations.
(b)What do you understand by complexity?
2. (A) what is different between single link list &
double link list?
(b)Write an algorithm for insertion & deletion
in the single link list.
3. What is sorting? Sort the following list of elements by using quick sort:
44,33,11,55,77,90,40,60,99,22,83,66
Define complexity of quick sort.
4. (A) what do you mean by binary search tree and explain tree traversal technique?
(b) Sort the following elements by using heap sort:
44, 30,50,22,60,55,77,55
5. (A) Explain single dimensional array and two-dimensional array, How to represent two-dimensional array in memory?
(b)Why binary search is better than linear search?
6. (A) Explain stack and its operation.
(b)Translate the following infix expression into postfix expression:
A. (B+D)/E-F. (G+H/K)
7. (A) what do you understand by AVL tree and describe balance factors?
(b)Describe Huffman’s algorithms’,
8. Write short notes on the following:
(I) control structure
(ii) String operations
(iii)DEQUEUE and Priority queue
(iv) Complete binary and priority queue Recursion
Support Us For more important Questions
Like Subscribe and Share
Must Read:-
Support Us For more important Questions
Like Subscribe and Share
Must Read:-
Welcome to My Notes.Hope you enjoy this Post. Contact Us if you having any trouble. Share with your friend
ConversionConversion EmoticonEmoticon