Data Structures and File Processing_ b.sc 2018 previous question papers download

Data structures and File processing_ sem-2 previous question papers download

Subject :-(Computer science)

Subject name :-(Data Structures and File Processing)

Year :-(2018,2019,2020)

Hello guys.... welcome to our platform"degreestudentz.blogspot.com". On this page, you will get"Data Structures and File Processing" previous question papers, which belong to KAKATIYA UNIVERSITY. Please try to understand my point students, this website is only to understand the pattern and model of question papers only.

The syllabus of Data Structure and file processing is given below

Syllabus of Data Structures and File Processing 

Unit-1

Basic data structure - stacks - memory management

Unit-2

Recursion- queues - linked lists

Unit-3

Trees- searching and sorting

Unit-4

Hashing - Heaps - indexing and Multiway-trees

Now with the use of the given link, you can download the Data Structures and File Processing 2018 question paper.

Data Structures and File Processing (semester-2)

Data Structures and File Processing 2018 -question-paper download

Click the link below to download the PDF file

Click here to go download a PDF file

Important Questions 

1. What are a data structure and its types?  

2. What is an Algorithm?  

3. How to write an algorithm and algorithm analysis and complexity?  

4. Explain the Stacks and their implementation completely.  

5. Explain the QUEUES applications and implementation. 

6. Explain about Stacks Using Arrays.  

7. Explain the Applications of Stacks.  

8. Give Some notations and expression conversions in Stack with examples.  

9. Explain with a program that revers a string with a Stack.  

10. What is Memory Management in Data Structures?  

11. Explain the Garbage Collection Algorithms for Equal-Sized Blocks.

12. Explain the Pseudocode.  

13. Explain the Stack abstract data type.  

14. Explain the Multiple stacks.  

15. Explain the Expression Evaluation and Conversion.  

16. What is the recursion?  

17. Explain the Managing of Equal Sized Blocks. 

18. Explain the Recursion functions, implementation comp lately.  

19. Explain a program of recursion using a Stack.  

20. Explain the Queue and its implementation.  

21. Explain about the Queues as ADTs and Queues using Arrays 

22. Explain the circular Queue.  

23. Explain about Dequeue.  

24. Explain the priority Queue.  

25. Explain the Linked List and its types.  

26. Explain the Single linked list  

27. Explain the Circular Linked List.  

28. Program to write about the Circular linked list.  

29. Explain the Sparse Matrix with an example. 

30. Explain the Recursive Variables.  

31. Explain the difference between iteration Vs recursion.  

32. Explain the Features and Applications of Queue.  

33. Explain about the Linked List ADT.  

34. Explain the Generalization of the Linked list.   

35. Give a note on Trees.  Data Structures & File Processing

36. Explain the binary tree 

37. Explain the binary search tree 

38. Explain the binary tree abstract data type 

39. Program to implement the binary tree in C ++ compile

40.  Explain the insertion of a node in binary into 

41. Explain the tree traversal 

42. Explain the searching technique.  

43. Explain about the Bubble sort with an example 

44. Explain about the Insert Sort 

45. Explain Selection Sort with an example 

46. Explain about the Merge Sort with an example

47. Explain about the quicksort.  

48. Explain about the Heap Sort with an example

49. Explain about the Polyphase Merge Sort 

50. Explain the Optimal binary search tree

51. What an AVL Tree with an Eagle?  Short Answer Questions 

52. How to represent a tree.  

53. Explain various types of trees.  

54. Explain various applications of trees.  

55. Explain the sorting in data structures 

56. Explain about the Symbol Tables in trees

 

57. Explain about the Hashing and its Functions.  

58. Explain details in collision resolution strategies.