23124

22317
3 Hours / 70 Marks Seat No.

Instructions : (1) All Questions are compulsory.

(2) Answer each next main Question on a new page.
(3) Illustrate your answers with neat sketches wherever necessary.
(4) Figures to the right indicate full marks.
(5) Assume suitable data, if necessary.
(6) Mobile Phone, Pager and any other Electronic Communication
devices are not permissible in Examination Hall.

Marks
1. Attempt any FIVE of the following : 10
(a) State any two differences between linear search and binary search.
(b) Define term pointer and null pointer.
(c) Define the terms : linear data structure and non-linear data structure.
(d) List any four applications of queue.
(e) Write any four operations that can be performed on data structure.
(f) Convert the following infix expression to its postfix form using stack :
A + B – C * D/E + F
(g) Describe given two types of graphs : Directed graph and Undirected graph.

2. Attempt any THREE of the following : 12

(a) Describe working of selection sort method with suitable example.
(b) Write algorithm to delete an intermediate node from a singly linked list.
(c) Differentiate between tree and graph w.r.t. any four parameters.
(d) Convert the given infix expression to postfix expression using stack and the
details of stack at each step of conversion.
Expression : A * B ↑ C – D / E + [F / G]
[1 of 4] P.T.O.
22317 [2 of 4]
3. Attempt any THREE of the following : 12
(a) Explain complexity of following algorithms in terms of time and space :
(i) Binary search
(ii) Bubble sort
(b) Draw an expression tree for the following expression :

(a + 3b – 7c)3 * (6d – 8e)7

(c) Describe working of bubble sort with example.
(d) Show the effect of PUSH and POP operation on the stack of size 10. The
stack contains 10, 20, 25, 15, 30 & 40 with 40 being at top of stack. Show
diagrammatically the effect of
(i) PUSH (45) (ii) PUSH (50)
(iii) POP (iv) PUSH (55)

4. Attempt any THREE of the following : 12

(a) Create singly linked list using data fields 10, 20, 30, 40, 50 and show step-by-
step procedure with the help of diagram from start to end.
(b) Describe advantages of circular link list over linear link list with example.
(c) Explain the working of Radix sort method with an example.
(d) Write an algorithm to count no. of nodes in singly linked list.
(e) Consider the graph ‘G’ in the following figure :

(i) Find all simple path from X & Z.

(ii) Find indegree and outdegree of node Y and Z.
(iii) Find adjacency matrix A for the above graph.
(iv) Give adjacency list representation of above graph.
22317 [3 of 4]
5. Attempt any TWO of the following : 12
(a) Define the term tree traversal. Construct the Binary Search Tree (BST) of
following :
85, 90, 45, 60, 25, 35, 10, 20, 75, 95 and traverse the above BST in inorder,
preorder & postorder.
(b) Explain operation on singly linked list.
(c) Implement a ‘C’ program to insert element into the queue and delete the
element from the queue.

6. Attempt any TWO of the following : 12

(a) Find out prefix equivalent of the expression :
(i) [(A + B) + C] * D
(ii) A[(B * C) + D]
(b) Sort the following number in ascending order using bubble sort. Given
numbers as follows : 475, 15, 513, 6753, 45, 118.
(c) Describe circular linked list with suitable diagram. State advantages of
circular linked list over linear linked list.
_______________

P.T.O.
22317 [4 of 4]
22232
22317
3 Hours / 70 Marks 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 four operations performed on data structure.
(b) Draw the diagram of Linear Queue to represent front and rear pointers.
(c) State the following terms :
(i) Leaf node of a tree
(ii) Degree of a tree
(d) Write any two operations performed on the stack.
(e) What are directed and undirected graphs ?
(f) Explain linear and non-linear data structures.
(g) Define Searching. What are its types ?

2. Attempt any THREE of the following : 12

(a) Sort the following elements using Radix Sort Method :
{361, 12, 527, 143, 9, 768, 3481}.
(b) Write an algorithm to delete a node at the beginning from a singly Linked
List.
(c) Explain stack overflow and underflow conditions with example.
(d) Implement a C program to insert an element in an array.

[1 of 4] P.T.O.
22317 [2 of 4]
3. Attempt any THREE of the following : 12
(a) Differentiate between tree and graph with respect to any four parameters.
(b) Write an algorithm to delete an intermediate node in a singly linked list.
(c) Sort the following numbers in ascending order using Insertion sort :
{25, 15, 4, 103, 62, 9} and write the output after each iteration.
(d) 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.

4. Attempt any THREE of the following : 12

(a) Differentiate between Binary search and Linear search with respect to any
four parameters.
(b) Create a singly Linked List using data fields 10, 20, 30, 40, 50 and show
procedure step-by-step with the help of diagram from start to end.
(c) 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, with 60 being at top of the stack.
Show diagrammatically the effect of –
(i) PUSH 55
(ii) PUSH 70
(iii) POP
(iv) POP
Sketch the final structure of stack after performing the above said operations.
(d) For the following directed graph :
(i) Give adjacency matrix representation.
(ii) Give adjacency list representation
22317 [3 of 4]
5. Attempt any TWO of the following : 12

(a) Convert the infix expression to its postfix expression using stack ((A + B) *
D) ^ (E – F). Show diagrammatically each step of conversion.

(b) Show the effect of INSERT and DELETE operations onto the linear queue of
size 10. The linear queue sequentially contains 10,20, 30, 40 and 50 where 10
is at front of the queue. Show diagrammatically the effect of –

(i) INSERT (75)

(ii) INSERT (85)

(iii) DELETE

(iv) INSERT (60)

(v) DELETE

(vi) INSERT (90)

(c)

From the given tree, complete the following answers :

(i) Degree of 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 tree : _________

P.T.O.
22317 [4 of 4]
6. Attempt any TWO of the following : 12
(a) Find the position of element 29 using Binary search method in an array given
as : {11, 5, 21, 3, 29, 17, 2, 43}.
(b) Evaluate the following postfix expression :
4 6 24 + * 6 3 / –

Show diagrammatically each step of evaluation using stack.

(c) Create a singly linked list using data fields 10, 20, 30, 40, 50. Search a node
40 from the singly linked list and show procedure step-by-step with the help
of the diagram from start to end.

_______________
21222
22317
3 Hours / 70 Marks Seat No.
15 minutes extra for each hour

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) Define linear data structure and non-linear data structure.
(b) Enlist operations on stack.
(c) Define : (i) General tree (ii) Binary tree
(d) Draw the diagram of circular queue with front and rear pointers.
(e) Describe given two types of graphs : Directed and Undirected graph.
(f) Define Abstract Data Type.
(g) State any four applications of queue.

2. Attempt any THREE of the following : 12

(a) Describe the working of Bubble sort method with an example.
(b) Write an algorithm to traverse a linked list.
(c) Explain Queue overflow and underflow conditions with examples.
(d) Explain the following terminologies with respect to graph :
(i) In degree (ii) Out degree
(iii) Successor (iv) Predecessor

[1 of 4] P.T.O.
22317 [2 of 4]
3. Attempt any THREE of the following : 12

(a) Describe time and space complexity with example of each.

(b) Evaluate the following postfix expression :

10, 2, *, 15, 3, /, +, 12, 3, +, +

Show diagrammatically each step of evaluation using stack.

(c) Find the position of element 30 using Binary search method in array

A = {10, 5, 20, 25, 8, 30, 40}

(d) For the following graph :

(i) Give adjacency matrix representation

(ii) Give adjacency list representation

4. Attempt any THREE of the following : 12

(a) Describe the working of radix sort with example.

(b) Construct a binary search tree for following elements :

22, 27, 14, 31, 40, 43, 44, 10, 20, 35

Show each step of construction of BST.

(c) Write an algorithm to insert a new node at the beginning of a Singly linked
list. Give example.

(d) Write a ‘C’ program to calculate the factorial of number using recursion.

(e) Describe circular linked list with suitable diagram. Also state advantage of
circular linked list over linear linked list.
22317 [3 of 4]
5. Attempt any TWO of the following : 12

(a) Write a program to implement a stack with push, pop and display operations.

(b) Draw tree for given expression and find pre-order and post-order traversal.

(2b + 5c)2 (4d – 6e)5

(c) Write an algorithm to search an element in linked list.

6. Attempt any TWO of the following : 12

(a) Describe the working of Selection Sort Method. Also sort given input list in
ascending order using selection sort.

Input list : 50, 24, 5, 12, 30

(b) Convert the following Infix expression to its prefix form using stack. Show
the details of stack at each step of conversion.

Expression : P * Q  R – S / T + (U/V)

(c) Create a Singly linked list using data fields 70, 50, 30, 40, 90. Search a node
40 from the singly linked list & show procedure step-by-step with the help of
diagram from start to end.

_______________

P.T.O.
22317 [4 of 4]
11920
22317
3 Hours / 70 Marks Seat No.

Instructions : (1) All Questions are compulsory.

(2) Answer each next main Question on a new page.
(3) Illustrate your answers with neat sketches wherever necessary.
(4) Figures to the right indicate full marks.
(5) Assume suitable data, if necessary.
(6) Mobile Phone, Pager and any other Electronic Communication
devices are not permissible in Examination Hall.

Marks

1. Attempt any FIVE of the following : 10

(a) Write any four operations that can be performed on data structure.

(b) Define the terms ‘overflow’ and ‘underflow’ with respect to stack.

(c) Define the following terms w.r.t. tree : (i) In-degree, (2) Out-degree

(d) Evaluate the following arithmetic expression P written in postfix notation :

P : 4, 2, ^, 3, *, 3, -, 8, 4, /, +

(e) Describe directed and undirected graph.

(f) Give classification of data structure.

(g) Define queue. State any two applications where queue is used.

2. Attempt any THREE of the following : 12

(a) Sort the given numbers in ascending order using Radix sort :

348, 14, 641, 3851, 74

[1 of 4] P.T.O.
22317 [2 of 4]
(b) Write an algorithm to insert a new node at the beginning and end of the singly
linked list.
(c) Explain the concept of circular Queue along with its need.
(d) Draw a binary search tree for the given numbers :
50, 33, 44, 22, 77, 35, 60, 40.

3. Attempt any THREE of the following : 12

(a) Explain time and space complexity with an example.
(b) Convert the following infix expression to postfix expression using stack and
show the details of stack in each step.
((A+B)*D)^(E-F)
(c) Implement a ‘C’ program to search a particular data from the given array
using Linear Search.
(d) Draw an expression tree for the following expression :
(a – 2b + 5c)2 * (4d = 6e)5

4. Attempt any THREE of the following : 12

(a) Find the position of element 21 using Binary Search method in Array ‘A’
given below :
A = {11, 5, 21, 3, 29, 17, 2, 45}
(b) Differentiate between tree and graph. (Any 4 points)
(c) Construct a singly linked list using data fields 21, 25, 96, 58, 74 and show
procedure step-by-step with the help of diagram start to end.
(d) Show the effect of PUSH and POP operations on the stack of size 10.
PUSH(10)
PUSH(20)
POP
PUSH(30)
(e) Compare Linked List and Array. (any 4 points)
22317 [3 of 4]
5. Attempt the following any TWO of the following : 12
(a) Implement a ‘C’ program to insert element into the queue and delete the
element from the queue.
(b) Consider the graph given in following figure and answer given questions.

(1) All simple path from 1 to 5

(2) In-degree of and out-degree of 4
(3) Give adjacency matrix for the given graph.
(4) Give adjacency list representation of the given graph.
(c) Write an algorithm to search a particular node in the given linked list.

6. Attempt any TWO of the following : 12

(a) Elaborate the steps for performing selection sort for given elements of array.
A = {37, 12, 4, 90, 49, 23, –19}
(b) Explain the concept of recursion using stack.
(c) Show with suitable diagrams how to delete a node from singly linked list at
the beginning, in between and at the end of the list.
_______________

P.T.O.
22317 [4 of 4]
21819
22317
3 Hours / 70 Marks 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.
(5) Mobile Phone, Pager and any other Electronic Communication
devices are not permissible in Examination Hall.

Marks

1. Attempt any FIVE of the following : 10

(a) List any four operations on data structure.

(b) Enlist queue operations condition.

(c) Define :

(i) Binary tree (ii) Binary search tree

(d) Show the memory representation of stack using array with the help of a
diagram.

(e) Define given two types of graph and give example.

(i) Direct graph (ii) Undirected graph

(f) Differentiate between linear and non-linear data structures on any two
parameters.

(g) Convert the following infix expression to its prefix form using stack

A+B–CD/E+F
[1 of 4] P.T.O.
22317 [2 of 4]
2. Attempt any THREE of the following : 12

(a) Explain the working of Binary search with an example.

(b) Write a program to traverse a linked list.

(c) Draw and explain construction of circular queue.

(d) Explain indegree and outdegree of a graph with example.

3. Attempt any THREE of the following : 12

(a) Write C program for performing following operations on array : insertion,

display.

(b) Evaluate the following postfix expression :

5, 6, 2, +, , 12, 4, /, – Show diagrammatically each step of evolution using

stack.

(c) Sort the following numbers in ascending order using quick sort. Given
numbers 50, 2, 6, 22, 3, 39, 49, 25, 18, 5.

(d) From the following graph, complete the answers :

(i) Indegree of node 21

(ii) Adjacent node of 19

(iii) Path of 31

(iv) Successor of node 67

22317 [3 of 4]
4. Attempt any THREE of the following : 12
(a) Differentiate between binary search and sequential search (linear search).
(b) Draw the tree structure of the following expressions :
(i) (2a + 5b)3  (x – 7y)4 (ii) (a – 3b)  (2x – y)3
(c) Create a singly linked list using data fields 15, 20, 22, 58, 60. Search a node
22 from the SLL and show procedure step-by-step with the help of diagram
from start to end.
(d) Evaluate the following prefix expression :
–  + 4 3 2 5 show diagrammatically each step of evaluation using stack.
(e) Write an algorithm to delete a node from the beginning of a circular linked list.

5. Attempt any TWO of the following : 12

(a) Show the effect of PUSH and POP operation on to the stack of size 10. The
stack contains 40, 30, 52, 86, 39, 45, 50 with 50 being at top of the stack.
Show diagrammatically the effect of :
(i) PUSH 59 (ii) PUSH 85
(iii) POP (iv) POP
(v) PUSH 59 (vi) POP
Sketch the final structure of stack after performing the above said operations.
(b) Traverse the following tree by the in-order, pre-order and post-order methods :

(c) Write an algorithm to count number of nodes in singly linked list.

P.T.O.
22317 [4 of 4]
6. Attempt any TWO of the following : 12

(a) Sort the following numbers in ascending order using Bubble sort. Given
numbers : 29, 35, 3, 8, 11, 15, 56, 12, 1, 4, 85, 5 & write the output after each
interaction.

(b) Evaluate the following postfix expression :

57 + 62 – 

(c) Create a singly linked list using data fields 90, 25, 46, 39, 56. Search a node
40 from the SLL and show procedure step-by-step with the help of diagram
from start to end.

_______________
11819
22317
3 Hours / 70 Marks 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) Define the term algorithm.
(b) List any 4 applications of queue.
(c) Describe following terms w.r.to tree :
(i) leaf node
(ii) level of node
(d) Differentiate between stack and queue. (any two points)
(e) Describe undirected graph with suitable example.
(f) Define the terms : linear data structure and non-linear data structure.
(g) Convert infix expression into prefix expression : (A + B)*(C / G) + F

2. Attempt any THREE of the following : 12

(a) Describe working of linear search with example.
(b) Describe the concept of linked list with the terminologies : node, next pointer,
null pointer and empty list.
(c) Describe queue full and queue empty operation conditions on linear queue
with suitable diagrams.
(d) Differentiate between general tree and binary tree. (any four points)

[1 of 4] P.T.O.
22317 [2 of 4]
3. Attempt any THREE of the following : 12

(a) Write ‘c’ program for deletion of an element from an array.

(b) Convert following expression into postfix form. Give stepwise procedure.

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

(c) Find the position of element 29 using binary search method in an array ‘A’
given below. Show each step.

A = {11, 5, 21, 3, 29, 17, 2, 43}

(d) Give adjacency list and adjacency matrix for given graph :

4. Attempt any THREE of the following : 12

(a) Describe working of bubble sort with example.

(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) Write an algorithm to count number of nodes in singly linked list.

(d) Write a program in ‘C’ to insert an element in a linear queue.

(e) Describe circular linked list with suitable diagram. Also state advantage of
circular linked list over linear linked list.
22317 [3 of 4]
5. Attempt any TWO of following : 12

(a) Write algorithm for performing push and pop operations on stack.

(b) For given binary tree write in-order, pre-order and post-order traversal.

(c) Write an algorithm to insert an element at the beginning and at end of linked
list.

6. Attempt any TWO of the following : 12

(a) Describe working of selection sort method. Also sort given input list in
ascending order using selection sort input list – 55, 25, 5, 15, 35.

(b) Define the term recursion. Write a program in C to display factorial of a

entered number using recursion.

(c) Describe procedure to delete an element from singly linked list using diagram.

_______________

P.T.O.
22317 [4 of 4]
 Scheme - I
Sample Question Paper
Program Name : Computer Engineering Program Group
Program Code : CO/CM/IF/CW
Semester : Third
22317
Course Title : Data Structures Using ‘C’
Marks : 70 Time: 3 Hrs.

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.
(5) Preferably, write the answers in sequential order.

Q.1) Attempt any FIVE of the following. 10 Marks

a. Write any four applications of data structure.
b. Sketch the diagram of circular queue.
c. State the following terms: 1. Ancestor 2.Height of Degree
d. Show the memory representation of Stack using array with the help of a diagram.
e. Define Abstract Data Type.
f. Convert the following infix expression to its postfix form using stack
A + B – C*D/E + F.
g. Describe given two types of graphs: Directed and undirected graph.

Q.2) Attempt any THREE of the following. 12 Marks

a. Explain the working of Radix Sort Method with an example.
b. Write algorithm to delete an intermediate node from a Singly Linked List.
c. Explain stack overflow and underflow conditions with example.
d. Differentiate between tree and graph w.r.t. any 4 parameters.

Q.3) Attempt any THREE of the following. 12 Marks

a. Implement C Program for performing following operations on Array : Insertion,
Display.
b. Convert the following infix expression to its prefix form using stack A + B – C*D/E +
F. Show diagrammatically each step of conversion.

1
 c. Sort the following numbers in ascending order using Insertion sort. Given Numbers :
348, 14, 614, 5381, 47 and Write the output after each iteration .
d. For the following directed graph :
i) Give adjacency matrix representation.
ii) Give adjacency list representation.

Q.4) Attempt any THREE of the following. 12 Marks

a. Differentiate between Binary Search and Sequential Search.
b. 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.
c. Create a Singly Linked List using data fields 10, 20, 30, 40, 50 and show procedure step-by-
step with the help of diagram from start to end.
d. Show the effect of INSERT and DELETE operations on to the Linear queue of size
10. The Linear queue sequentially contains 10, 20, 30, 40, and 50 where 10 is at front
of the queue. Show diagrammatically the effect of -
1. INSERT (12)
2. INSERT (34)
3. DELETE
4. INSERT (56)
e. Create a Singly Linked List using data fields 10, 20, 30, 40, 50 and show procedure step-by-
step with the help of diagram from start to end.

Q.5) Attempt any TWO of the following. 12 Marks

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

2
 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.

From the given tree complete six answers :

1. Degree of tree :
2. Degree of node 3 :
3. Level of node 5 :
4. Indegree of node 3 :
5. Outdegree of node 3 :
6. Height of tree :
c. Write an algorithm to count number of nodes in singly linked list.

Q.6) Attempt any TWO of the following. 12 Marks

a. Sort the following numbers in ascending order using Bubble sort. Given Numbers :
348, 14, 614, 5381, 47 and Write the output after each iteration
b. Evaluate the following prefix expression : - * + 4 3 2 5
Show diagrammatically each step of evaluation using stack.
c. Create a Singly Linked List using data fields 10, 20, 30, 40, 50. Search a node 40 from the
SLL and show procedure step-by-step with the help of diagram from start to end.

3
 Scheme – I

Sample Test Paper - I

Program Name : Computer Engineering Program Group
Program Code : CO/CM/IF/CW
Semester : Third
22317
Course Title : Data Structures Using ‘C’
Marks : 20 Time: 1 Hour

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.
(5) Preferably, write the answers in sequential order.

Q.1 Attempt any FOUR. 08 Marks

a) Differentiate between Linear and Non-linear data structures w.r.t. any 2 parameters.
b) Define searching and give its type.
c) List any four operations on data structure.
d) Define sorting and give its type.
e) Explain the term: time complexity.
f) List any four sorting techniques.

Q.2 Attempt any THREE. 12 Marks

a) Implement C Program for performing following operations on Array: Insertion,
Display.
b) With explanation sort the given no. in ascending order using radix sort. Given
Numbers : 348, 14, 614, 5381, 47
c) Find the position of element 29 using binary search method in an array ‘A’ given
below : A = {11, 5, 21, 3, 29, 17, 2, 43}
d) Write an algorithm for Selection sort.

4
 Scheme – I

Sample Test Paper - II

Program Name : Computer Engineering Program Group
Program Code : CO/CM/IF/CW
Semester : Third
22317
Course Title : Data Structures Using ‘C’
Marks : 20 Time: 1 Hour

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.
(5) Preferably, write the answers in sequential order.

Q.1 Attempt any FOUR. 08 Marks

a) Give any two applications of stack.
b) Draw the diagram of queue to represent front and rear pointers of queue.
c) Describe any two terms from the following : Node, Null pointer, empty list with
respect to linear linked list with diagram..
d) Describe any two terms from the following : information Field/ Data field, Address,
Next Pointer with respect to circular linked list with diagram..
e) Give any two applications of Graph.
f) Describe any two types of trees from the following : General tree, binary tree, binary
search tree.
Q.2 Attempt any THREE. 12 Marks
a) Write algorithm to insert an element into a linear queue.
b) Convert the following Infix expression to its Postfix form using stack A + B – C * D /
E + F. Show diagrammatically each step of conversion using Stack.
c) Create a Singly Linked List using data fields 10,20,30,40,50. And sketch stepwise
procedure from start to end.
d) 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.