Scribd
Upload
32 views

PreliumDSU 24-25

DSU preliminary

Uploaded by

shelkepravin8080
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
32 views

PreliumDSU 24-25

DSU preliminary

Uploaded by

shelkepravin8080
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

Samarth Rural Educational Institute

SAMARTH POLYTECHNIC BELHE


Approved by AICTE, New Delhi & Govt. of Maharashtra, Affiliated to MSBTE, Mumbai & MSBTE Institute Code-0992,
DTE Code No. D6451
Department Of Information Technology
Programe Name: Information Technology Programe Code: IF
Course Name: DSU Course Code: 313301
Marks: 50 Time:2 hour
Prelium Test AY:2024-25 Sem: III

Seat No.

Instructions : (1) All Questions are compulsory.


(2) Illustrate your answers with neat sketches wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.

Marks
1. Attempt any FIVE of the following : 10
(a) Write any two operations performed on the stack.
(b) Define the term overflow and underflow with respect to stack.
(c) Define the following term w.r.t. tree: (i) In-degree (ii) out-degree.
(d) State the following terms : (i) Leaf node of a tree (ii) Degree of a tree
(e) convert infix expression into prefix expression: (A+B)*(C/G)+F.
(f) Define : (i) General tree (ii) Binary tree

2. Attempt any FIVE of the following : 20


(a) Show the effect of PUSH and POP operation on to the stack of size 10.
The stack contains 10, 20, 22, 26, 28, and 30, with 30 being at top of the stack. Show
diagrammatically the effect of
1.PUSH 46 2.PUSH 48 3.POP 4.POP 5.POP
Sketch the final structure of Stack after performing the above said operations.Sketch
the final structure of Stack after performing the above said operations
(b) Differentiate between general tree and binary tree. (any four points)
(c) Evaluate the following postfix expression : 10, 2, *, 15, 3, /, +, 12, 3, +, + Show
diagrammatically each step of evaluation using stack.
(d) Draw a binary search tree for the given number. 50, 33, 44, 22, 77, 35, 60, 40.
(e) Construct the Binary Search Tree using following elements : {35, 15, 40, 7, 10, 100,
28, 82, 53, 25, 3}. Show diagrammatically each step of construction of BST.
(f) Draw an expression tree for the following expression: (a-2b+5e) 2 * (4d=6e) 5 .

[1 of 2] P.T.O.
3. Attempt any FIVE of the following : 20

(a) Write a program to implement a stack with push, pop and display operations.
(b) Construct a binary search tree for following elements: 30,100,90,15,2,25,36,72,78,10
show each step of construction of BST.
(c) Convert following expression into postfix form. Give stepwise procedure.

A + B ↑ C * (D / E) – F / G

(d) Evaluate the following postfix expression :


5, 6, 2, +, , 12, 4, /, – Show diagrammatically each step of evolution using
stack.
(e) Construct a binary search tree for following elements :

30, 100, 90, 15, 2, 25, 36, 72, 78, 10 show each step of construction of BST.
(f) For given binary tree write in-order, pre-order and post-order traversal.

[2 of 2] P.T.O.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy