Scribd
Upload
120 views2 pages

Updated Practice Questions For MSBTE Class Test - II

Uploaded by

studystack01
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
120 views2 pages

Updated Practice Questions For MSBTE Class Test - II

Uploaded by

studystack01
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

K. K. Wagh Polytechnic, Nashik.

HirabaiHaridasVidyanagari, Amrutdham, Panchavati, Nashik-422003


Department of Computer Technology

Date: 07/11/2024
Academic Year (2024-25)
Course Name : Data Structure Using ‘C’ - DSU Course Code: 313301
Class: SYCM- Lin, Win & Mac Sem: III Scheme: K Term: ODD
Practice Question for Class Test- II

Unit-III
1. Write an algorithm to insert a new node at the beginning and end of the singly linked list.
2. Compare Linked List and Array. (any 4 points)
3. List types of linked list and state operations performed on linked list.
4. Define the term node, address, null pointer ,and empty list for linked list.
5. Describe circular linked list with suitable diagram. Also state advantage of circular linked list
over linear linked list.
6. Write a program to traverse a Singly linked list.
7. Write a program to implement Stack using linked list.

Unit-IV
1. Distinguish between Stack and Queue
2. Write an algorithm of PUSH operations on Stack.
3. Define the terms ‘overflow’ and ‘underflow’ w.r.t. stack
4. Translate the following infix expression into its equivalent postfix expression: A+B-C*D/E+F
5. Consider the following stack of characters, where STACK is allocated N = 5 memory cells: STACK: A,
C, D, F, K , Show the status of Stack with appropriate description as the Operations are carried out in
sequence-
a. POP (STACK, ITEM) b. PUSH (STACK, R)
c. PUSH (STACK, S) d. POP (STACK, ITEM)

Unit-V
1. Distinguish between Stack and Queue (minimum four points)
2. Implement a ‘C’ program to insert element into the queue and delete the element from the
queue.
3. Describe Queue full and Queue empty operation conditions on linear queue with suitable
diagrams.
4. Draw the diagram of circular queue with front and rear pointers for Underflow and Overflow
conditions.
5. State the principle of queue and give its application.
6. Draw and explain construction of circular queue along with its need.
7. Describe Queue along with its types.
8. Write algorithm for Insertion and Deletion operations for Linear Queue.
Unit-VI
1. Draw a binary search tree for the given numbers
i. 50, 33, 44, 22, 77, 35, 60, 40.
ii. 30, 100, 90, 15, 2, 25, 36, 72, 78, 10
2. Define the terms related to binary tree Level, Depth, Leaf node, Root node, forest.
3. Construct Binary search Tree for given number J,R,D,G,T,E,M,H,P,A,F,Q.
4. Represent this binary tree using linked presentation(Fig.2)
5. Give recursive algorithms for pre-order traversal of binary tree.
6. For given binary tree write in-order, pre-order and post-order traversal.

7. i)
8.
9.
10.

8. Draw the tree structure of the following expressions

i. (a+b+c+d)3+2b+4e2+5x)3 ii. (x+2y+3z+4a+5b+6c)4+(7d+4z)2


iii. (66a2+67b*68c)7/(6p2+7q2+8r3)7 iv. (3a2+6b+5)6+(4b2+3b+2)3
v. E:(a-b)/((c*d)+e) vi. (11a2 +7b3+5c)4*(3a3+4b2+8c)3
vii. (3x3+8y2+50)6+(8x2+7y+2)3 viii. (2a+5b)3(x-7y)4 ix. (a-3b)(2x-y)3

Prof.G.B.Katkade/Mr. S.H.Sangale/Mr.S.K.Mahajan
Course Teacher

You might also like