JNTUH 2-1 Computer Science And Engineering Data Structures Important Questions

JNTUH

COMPUTER SCIENCE AND ENGINEERING

2-1  DATA STRUCTURES

IMPORTANT QUESTIONS

...................................................................................................................................................................
UNIT-1

1.what is abstract data type?
2.define performance analysis?
3.Explain asymptotic notations?
4.define linear and non linear data structures?
5.define algorithm.properties?
6.circularly linked list and operations for circularly linked lists?
7.sparse matrices in array and linked list representation?


UNIT-2

1.stack ADT,operations,array and linked list representations?
2.infix to post and post to infix conversions?
3.queue ADT,operations,array and linked list representations?
4.circular queues?
5.double ended queues?


UNIT-3

1.define tree and its properties?
2.binary tree ADT,properties of binary tree?
3.binary tree representations?
4.binary tree traversals?
5.define Graphs ADT,definition,terminology?
6.define graph representations and graph traversals?


UNIT-4

1.linear search,binary search,hashing techniques with definition,procedures,one example?
2.insertion sort,selection sort,radix sort,quick sort techniques with definition,procedures,one example?
3.compare different sorting methods?


UNIT-5

1.AVL trees-definition,insertion?
2.Define red black and splay trees?
3.comparison of search trees?
4.brief about Knuth Morris Pratt algorithm?
5.explain brief about tries?
...................................................................................................................................................................

SHARE THE INFORMATION
Like and Share our updates to all the students who are Appearing for the 2-1 Examination on 04-Mar-2016 and Stay tuned for further updates feel free to comment also Dont froget to like our Facebook page:https://www.facebook.com/Studentstack/