Scribd
Upload
50 views2 pages

Computer 4 Sem Data Structure Using C 120842 Dec 2018

Uploaded by

shubhamgoswami879
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
50 views2 pages

Computer 4 Sem Data Structure Using C 120842 Dec 2018

Uploaded by

shubhamgoswami879
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

No. of Printed Pages : 4 120842 j) Circular queue.

RollNo...................
k) Polish Notation
4th Sem. / Comp. l) Recursion
Subject : DATA STRUCTURE USING C m) Extended Binary Tree
n) Heap
Time : 3 Hrs. M.M. : 100
SECTION-A o) Linear Search

Note: Very Short Answer type questions. Attempt p) Balanced Binary Tree
any 15 parts. (15x2=30) q) Post order
Q.1 Define the following:- r) Leaf nodes
a) Top down design
b) Data structure SECTION-B
c) Global variables Note: Short answer type questions. Attempt any
d) Constants ten parts 10x4=40

e) Graphs Q.2 i) What is stack? Give the implementation


of stack.
f) Two dimensional array
ii) What is structured programming.
g) Lower Bound of array
iii) What are primitive and non primitive
h) Index of array Data Structures.
i) Doubly linked list

(1) 120842 (2) 120842


iv) Differentiate between Linked list and xv) What is sorting? Write an algorithm for
array. insertion sort.
v) Write down the applications of Linked
list. SECTION-C
vi) Differentiate between recursion and Note: Long answer type questions. Attempt any
Iteration. three questions. 3x10=30
vii) What is the difference between single Q.3 What is selection sort? Explain its working by
dimension array and two dimension taking suitable example.
array?
Q.4 What do you mean by sequential and linked
viii) Why under flow condition comes in any representation of binary tree in memory.
data structure? Explain.
ix) What are the difference between Q.5 List various operations associated with
constant and variables? linked list.
x) Explain any two applications of stack. Q.6 Write an algorithm to delete an element in a
xi) Write sequential search algorithm. linear array.
xii) Write method for conversion from infix to Q.7 Explain how you will insert an element into
postfix notation. binary search tree.
xiii) Explain pop operation of stack. Write an
algorithm of this operation.
xiv) What is a Tree? What is height and path
of a tree. Explain with example.
(3) 120842 (2360) (4) 120842

You might also like