Scribd
Upload
117 views2 pages

Data Structure 4

The document outlines an examination paper for the S.Y. B.B.A. (CA) course on Data Structure, consisting of 5 questions with varying marks totaling 70. Candidates are required to answer all questions within a 3-hour timeframe, covering topics such as data structures, sorting techniques, and graph theory. Specific tasks include definitions, algorithm writing, and practical coding exercises related to data structures.

Uploaded by

paarthauti2005
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
117 views2 pages

Data Structure 4

The document outlines an examination paper for the S.Y. B.B.A. (CA) course on Data Structure, consisting of 5 questions with varying marks totaling 70. Candidates are required to answer all questions within a 3-hour timeframe, covering topics such as data structures, sorting techniques, and graph theory. Specific tasks include definitions, algorithm writing, and practical coding exercises related to data structures.

Uploaded by

paarthauti2005
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

Total No. of Questions : 5] SEAT No.

:
P2130 [Total No. of Pages : 2
[5803]-302
S.Y. B.B.A. (CA)
CA - 302 : DATA STRUCTURE
(2019 Pattern) (Semester - III)
Time : 3 Hours] [Max. Marks : 70
Instructions to the candidates:
1) Questions : Total number of questions are 5.
2) Total Marks Assigned : 70
3) Time assigned : 3 Hours.
4) All questions are compulsory.

Q1) Attempt any EIGHT of the following. [8×2=16]


a) What is self referential structure?
b) What are the different types of graph?
c) What are the applications of stack?
d) List out different types of tree.
e) What is searching?
f) What is pointer to pointer.
g) What is non-primitive data structure?
h) Define Data structure.
i) What is sorting? State the techniques of sorting.
j) What is almost complete binary tree.

Q2) Attempt any FOUR of the following. [4×4=16]


a) What is hight-balanced tree? Explain LL and LR rotations with an example.
b) Explain selection sort technique with an example.
c) What is stack? Explain different operations used in stack.
d) What is Graph? Explain adjacency list of graph.
e) Write an algorithm to convert given infix expression to postfix expression.

[5803]-302 1 P.T.O.
Q3) Attempt any Four of the following. [4×4=16]
a) Write a function to create and display circular singly linked list.
b) Write a function for Dynamic Implementation of stack.
c) Write a function to traverse a graph using DFS technique.
d) Write a function to remove given node from singly linked list and add it
at the given position in singly linked list.
e) Write a function to check whether a given string is palindrome or not
(use Stack)

Q4) Attempt any Four of the following. [4×4=16]


a) Sort the following data by using insertion sort.
18, 7, 22, 3, 14, 2
b) Construct Binary search tree of following data.
15, 30, 20, 5, 10, 2, 7
c) Construct an AVL tree of following data.
SRI, IND, AUS, FRA, CAN, DEN
d) What is double ended queue? Explain it with an example.
e) Write a ‘C’ Program to count the number of nodes from singly link list.

Q5) Attempt any TWO of the following [2×3=6]


a) Convert the following expression into prefix
i) p*q–rls
ii) (A+B) / (C+D*E)
b) Define the following terms.
i) Leaf node
ii) Cyclic graph
iii) Parent node
c) What is degree of vertex? Find indegree & out degree of following graph
for each vertex


[5803]-302 2

You might also like