DSU 313301 MSBTE Previous Year Papers

Welcome to practicalkida, In this blog post, we share the Data Structure Using C DSU 313301 MSBTE Previous Year Papers PDF.

As you know, MSBTE recently changed its teaching scheme. We collected some DSU I scheme question papers to help computer third-semester students.

DSU 313301 MSBTE 2023 Exam Papers

All the above papers are as per MSBTE I Scheme and only for taking reference from previous exam.

DSU 313301 Very Important Question for K Scheme

Chapter no 1: Introduction to Data Structures

• 2 Marks Questions

1. Write any four operations on the data structure.
2. Explain linear and non-linear data structures.
3. Define complexity and classify it.
4. Define Abstract data type.
5. Give a classification of data structure.

• 4 marks questions

1. Implement a C program to insert an element in an array.
2. Differentiate between linear and non-linear data structures. (any four points)
3. Explain time and space complexity with an example.
4. Write a C program for the deletion of an element from an array.
5. Define the term recursion. Write a program in C to display the factorial of an entered number using recursion.

Chapter no 2: Searching and Sorting

• 2 Marks Questions

1. Define Searching. What are its types?
2. State the following terms.
   • i) Searching
   • ii) Sorting

• 4 Marks Questions

1. Sort the following numbers in ascending order using Insertion sort: 25,15,4,103,62,9
2. Differentiate between Binary search and Linear search concerning any four parameters.
3. Find the position of element 29 using the Binary search method in an array given as 11,5,21,3,29,17,2,43
4. Write a program to implement bubble sort.
5. Describe the workings of linear search with an example.
6. Write a program to implement insertion sort.
7. Sort the following numbers in ascending order using quick sort. 50,2,6,22,3,39,49,25,18,5
8. Sort the following numbers in ascending order using Bubble sort. 29,35,3,8,11,15,56,12,1,4,85,5
9. Elaborate on the steps for performing selection sort for given array elements. 37,12,4,90,49,23,-19
10. Describe the working of binary search with an example.

Chapter No. 3: Linked List

• 2 Marks Questions

1. Define the following term.
   • Next pointer
   • Null pointer
2. What is a node in the singly linked list? Explain with an example.
3. What is dynamic memory allocation?
4. List any four applications of the linked list.
5. List types of lists.

• 4 Marks Questions

1. Write an algorithm to delete a node at the beginning of a singly linked list.
2. Write an algorithm to delete an intermediate node in a singly linked list.
3. Create a singly linked list using data fields 10,20,30,40,50 and show the procedure step-by-step
4. with the help of a diagram from start to end.
5. Write an algorithm to insert a new node at the beginning of the singly linked list.
6. Write a ‘C’ function for searching a node in singly linked list.
7. Write a ‘C’ function to count a number of nodes in the singly linked list.
8. 12) Create a single list using data fields 15,20,22,58,60. Search node 22 from the SLL and
9. show the procedure step-by-step with the help of a diagram from start to end.
10. Differentiate between Static and Dynamic memory allocation.

Chapter no 4: Stack

• 2 Marks Questions

1. Write any two operations performed on the Stack.
2. List any four applications of stack.
3. Convert the following infix expression to its postfix expression using stack. (A+B)/(C-D)
4. Evaluate the following postfix expression. 5, 7, +, 6, 2, -, *
5. Show the memory representation of the stack using an array with the help of a diagram.
6. Draw a representation of the stack using Linked List.

• 4 Marks Questions

1. Explain stack overflow and underflow conditions with examples.
2. Show the effect of PUSH and POP operation on to the stack of size 10. The stack contains 10, 20, 30, 40, 50 and 60 at top of the stack. Show diagrammatically the effect of-
   • i) PUSH 55
   • ii) PUSH 70
   • iii) POP
   • iv) POP
3. Convert the infix expression to its postfix expression using stack ((A+B)*D)^(E-F). Show diagrammatically each step of conversion.
4. Evaluate the following postfix expression. 4, 6, 24, +, *, 6, 3, /, –
5. Write a menu-driven “C” program to implement stack using an array with the following menu.
   • i) Push
   • ii) Pop
   • iii) Display
   • iv) exit

Chapter no 5: Queue

• 2 Marks Questions

1. List any four types of queues.
2. Show the memory representation of the queue using an array with the help of a diagram.
3. Define queue. State any two applications where the queue is used.
4. Enlist queue operation condition.
5. Draw a representation of the queue using Linked List.

• 4 Marks Questions

1. Show the effect of INSERT and DELETE operation onto the linear queue of size 10. The linear queue sequential contains 10,20,30,40 and 50 where 10 is at the front queue. Show diagrammatically the effect of
   • ii) INSERT 75
   • iii) INSERT 85
   • iv) DELETE
   • v) INSERT 60
   • vi) DELETE
   • vii)INSERT 90
2. Differentiate between Stack and Queue concerning any four parameters.
3. Write a neat sketch explaining the workings of the priority queue.
4. Write a program for insert and delete operations to be performed on the queue.
5. Draw and explain the construction of a circular queue.
6. Describe queue full and queue empty operation conditions on linear queue with a suitable diagram.

Chapter no 6: Tree

• 2 Marks Questions

1. State the following term.
   • i) Leaf node of a tree
   • ii) Degree of a tree
2. Define the following terms.
   • i) Sibling
   • ii) Depth of tree
3. 3) Define (CO6)
   • i) Binary tree
   • ii) Binary search tree
4. Draw the tree structure of the following expression. (a-3b)*(2x)
5. Traverse the following tree by the in-order and pre-order.

• Define the term w.r.t. tree. (CO6)
  • i) In-degree
  • ii) Out-degree
• 4 Marks Questions

1. Construct the Binary Search Tree using the following elements. (35,15,40,7,10,100,28,82,53,25,3). Show diagrammatically each step of the construction of BST.
2. From the given tree, complete the following answers.
   • i) Degree of the tree:
   • ii) Degree of node B:
   • iii) Level of node H:
   • iv) Indegree of node C:
   • v) Outdegree of node B:
   • vi) Height of the degree:

• Write an algorithm for preorder traversal of a binary tree.
• Explain the Binary Search Tree with an example.
• Draw a tree for a given expression. (a-2b+5c)^2 * (4d-6e)^5
• Traverse the following tree by the in-order, pre-order, and post-order methods.

• Differentiate between general tree and binary tree.

Conclusion

In this blog post, we provided previous year’s papers and important question papers for Data Structure Using C DSU 313301.

MSBTE Micro Project Topics