0 ratings0% found this document useful (0 votes) 17 views5 pagesData Structures Paper
Good questions for data structures
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
S-7640
[Link]. (Semester-II1) Examination — 2020
Computer Science
Paper No.- I
Data Structure Using C-Language
Time: Three Hours] [Maximum Marks: 70
Note: Attempt five questions in all. Q. No. 1 is compulsory.
Beside question No. 1 attempt any four questions.
1. Write short notes on any two of the following: (5x2=10)
(a) What is difference between array and
list?
S-7640-B-90,
(& scanned with OKEN Scanner 3
(b) Define Stack and its implementation, Unit -1
(@. Whatis threaded binary te? 2. (a) Explain the different operations to be (3)
performed on the data structures.
(©) Find the degree of each vertex of the (b) Write an algorithm for insertion and (10)
graph given below : deletion of a Node at the beginning in
circular doubly link list.
3. (@) Write a program in C language to (8)
calculate factorial of a number. Number
being entered by user.
(©) List out advantages and disadvantages of (10)
Oe ster,
(©) Differentiate between the iteration and linked list and also write an algorithm for
recursion i
insertion and deletion of a Node in singly
linked list.
ree S-7640-B-90
© scanned with OKEN Scanner @
)
(a)
Unit - I
Convert the following expression into
postfix expression :
A+(B*C-(D/E?F)*G)*H
What is a circular queue? How do you
represent it? Write algorithms for the
insertion and deletion operations
performed on the circular queue.
Explain the following terms:
(i) Infix expression
Gi) Postfix expression
S-7640-B-90
(b)
6)
©
(10)
6 (a)
6)
What is queue? Write an algorithm for
insertion and deletion in a queue
Explain Binary expression tree.
Unit—10
Find the length of a shortest path of the
following graph and a shortest path
between A and E:
S-7640-B-90
™
8
M
© scanned with OKEN Scanner )
©
@
(b)
Define the following terms :
(@ Strictly binary tree
Gi) Completely binary tree
Differentiate between terminal nodes and
non- terminal nodes.
The following sequence given the
preorder and inorder of the Binary
Tree T:
Preorder: ABD GCEHIF
Inorder :DGBAHEICF
Explain the following terms in Graph:
S-7640-B-90
6)
«©
@)
”
& @
(b)
@
Path
(i) Cycle
(iii) Degree
Gv) Complete Graph
Define Height Balanced Tree with an (4)
example,
Unit-1V.
Write aC program to sort an array using (9)
quick sort.
Explain Binary Searching with an (6)
example.
S-7640-B-90
© scanned with OKEN Scanner 9, (a) Write a C program to sort an array using (9)
Insertion Sort.
(b) Define the following terms : (6)
(i) Hasting
(ii) Linear Searching
(iii) Bucket Sort
(& scanned with OKEN Scanner
