DATA STRUCTURES | IMPORTANT QUESTIONS LIST | ANDHRA UNIVERSITY DEGREE 4 TH SEM COMPUTER IMP QUESTIONS ||

 DATA STRUCTURES 

IMPORTANT QUESTIONs LIST 

 UNIT I 

1. Write about data types in Data structures (5m) (***IMP***)

 2. Write short notes on abstract data types (ADTs). (5m) (******) 

3. Write short notes on data structures and its operations. (10m) (****VVIMP****) 

4. Write short notes on storage structures. (5m) 

5. Write short notes on file structures.(10m) 

6. Write about Primitive and Non-primitive Data Structures. (10m) (****VVIMP*****)

7. Explain about Linear and Non-linear Structures. (5m) (******)

 8. Write different types of linear lists (arrays, linked list and pointers). 

 9. Write about pointers. 

10. Explain about arrays and its ADT and operations. (10m) (****IMP*****)

11. Explain about sparse matrices. (10m) (****VVIMP*****)

 12. Write difference between arrays and linked list. 

13. Write short notes on SETs and its ADT and operations. 

14. Write about linked list ADT with operations and its applications. (5m) (*******)

 15. Write an algorithm and program for single linked list. (10m) (****VVIMP*****) 

16. Write an algorithm and program for double linked list. (10m) (****VVIMP*****) 

17. Write an algorithm and program for circular single linked list. (10m)

 UNIT II 

18. Write about stacks ADT with operations and its applications. (5m) (*******) 

19. Write an algorithm and program for stacks operation using arrays (10m) (****VVIMP*****).

 20. Write an algorithm and program for stacks operation using linked list (10m) (****). 

21. Write about queues ADT with operations and its applications. (5m) (*******) 

22. Write different types of queues. (5m)

 23. Write an algorithm and program for queues operation using arrays (10m) (****VVIMP*****).

 24. Write an algorithm and program for queues operation using linked list (10m) (****). 

25. Write an algorithm and program for circular queue operations (10m) (****VVIMP*****).

 26. Write an algorithm and program for dequeues operations (10m) (****).

 27. Write an algorithm and program for priority queue operations (10m)

 UNIT III

 28.Write about trees ADT and its basics. (definitions). (5m) 

29. Write about Binary Tree ADT and its properties. (10) 

30. Write about Binary Tree and its representations. (5m) 

31. Write about binary trees operations and its applications. (10m) (*****). 

32. Write an algorithms for binary tree traversals(preorder,inorder,postorder) (10m) (**VVIMP***). 

33. Write about binary search trees(BSTs) operations and its applications.(10m)(*** VVIMP ****). 

34. Write about binary search trees operations (BST) and its applications.(10m) (*****). 

35. Write about threaded Binary Trees with suitable examples (10m) (**VVIMP***). 

36. Write about heap trees. (10m) (**VVIMP***).

 UNIT VI

 37. Write about graphs ADT and its basics (definitions). (5m) 

38. Write about graph representations. (10m) (**VVIMP***). 

39. Write an algorithms for graph traversal (DFS & BFS) (10m) (**VVIMP***). 

40. Write about minimum spanning trees. (5m) 

41. Write about PRIM’s algorithm with suitable example (10m) (****VVIMP*****). 

42. Write about KRUSKAL’s algorithm with suitable example (10m) (****VVIMP*****). 

43. Write about graph applications.(5m) (*****). 

UNIT V 

44. Write about different types of sorting.(5m) (*****). 

45. Write an algorithm and program for selection sort (5m) (*****).

 46. Write an algorithm and program for Bubble sort (5 m) (*****). 

47. Write an algorithm and program for Insertion sort (10m) (****VVIMP*****). 

48. Write an algorithm and program for Merge sort (10m) (****VVIMP*****).

 49. Write an algorithm and program for Quick sort (10m) (****VVIMP*****). 

50. Write an algorithm and program for Heap sort (10m) (****VVIMP*****). 

51. Explain about searching in DS(5m) (*****). 

52. Write an algorithm and program for Sequential search or linear search (5m) (*****). 

53. Write an algorithm and program for binary search (5m) (*****).