amination,

December 2021
Time: 2 Hours
Subject: Data Structures
(Missing data, if any, may be suitably Max. Marks: 70
assumed)
Note: Answer any five PART -A
1. Define Abstract Data
questions. (5 x 2 = 10,Marks)
2. What is class Type?
3: What are the applications of stack?
4. What are the types of queues?
5. Draw the structure of circular linked list?
6. Define Hash table and hash function?
7. Define Binary Search Tree with its conditions?
8. Describe the representation of a graph?
9. List out the sorting methods?
10.Define searching and with example?
PART -B
Note: Answer any four questions. (4 x 15 =60 Marks)
11.a) Explain the typesof Data Structures?
b) llustrate specialmatrices with examples?
12.a) Describe sparse matrices with an example?
b) Discuss about strings with its built in functions?
13.aj lIlustrate stack operations with an examples?
b) Elaborate advantages of Linked list over an Array?
14.a) Discuss about the applications of queues
b) Explain the operations on Queue?
15.a) Describe operations on Single Linked List with example?
b) llustrate Doubly Linked list with example?
16.a) Explain static hashing with examples?
b) llustrate overflow handlingwith suitable example?
17.a) Describe Binary Tree Traversing techniques with an example?
b) Explain B-tree in detail with an example?

18 a) Discuss about Graph representation with examples?

b) llustrate any one Graph searching methodwith an example?
19 a) llustrate Quick sort with an example?
b) Write a program on Bubble Sort?
20.a) Explain Linear search with a program?
b) lllustrate Binary Search with an example?
 FACULTY OF INFORMATICS
BCA II Semester (CBCS) (Main &Backlog) (New)
Examination, June / July 2022
Subject: Data Structures
Time: 3 Hours
Max. Marks: 70
Note: (0) Answer allquestions from PART-A, and any five
questions from
PART - B,choosing one question from each unit.
(i) Missing data, if any, may be suitably assumed.
PART -A(10 x 2= 20 Marks)
1. (a) Define Data Structure.
(b) Define ADT.
(c) List the operations of Stack 186
(d) List types of Queues
(e) What is hashing?
(f) What is DLL?
(g) Define Binary tree.
(h) List the elementary graph operations
() List the sorting techniques
(ü) What is Binary search?
PART - B(5 x 10 = 50 Marks)
Unit -
2 (a) VWhat do you mean by Array? Explain various types of array in detail.
(b) Explain the uses of data structure.
(OR)
(a) Explain the advantages and disadvantages of arrays.
(b) Define matrices. And explain its types with examples.
Unit - II
4 (a) What is tack? Explain basicoperations of stack data structures.
(b) What is aqueue? Explain its operations.
(OR)
5 Explain in detail: (a) LiFked representation of stack. (b) Array representation of
queue.

Unit - III
6 (a)Define Singly Linked List. Discuss different operations on Singly linked list.
(b) Differentiate between double linked list and circular lists.
(OR)
7 Discuss in detail about: (a) Hashing functions (b) Overflow handling.
Unit -IV
8 (a)Explain various methods of traversing of a binary tree with examples.
(b) Explain various operations on BST with an example.
(OR)
9 (a) Explain different types of Graphs.
(b) Explain Sequential and linked representation of a graph with example.
Unit - V
10 (a) Explain the algorithm for insertion sort and give a suitable example.
(b) Explain Merge sort with the help of example.
(OR)
11 (a) What is Linear Search? Explain its working and implementation.
(b) Write a program to implement linear search.
 FACULTY OF INFORMATICSCode No: E -15319/N/CBCS
B.C.A. II -Semester (CBCS)
(Backlog &One Time Chance) (New)
Time: 3 Hours
February 2023 Examination,
Subject: Data Structures
Note: I. Note: Answer all Max. Marks: 70
Part-B. questions from Part-Aand
one question from each answer any five questions from
II. Missing Choosing
data, if any, may unit.
be suitably
1. a) Define assumed.
PART -A (10x 2= 20 Marks)8
b) Define Abstraction.
Encapsulation.
c) Define isEmpty().
d) Define peek ().
e) Define singly-linked list.
f) Define node.
g) Write about Min Heap.
h) Define Linked
Representation.
i) Define Best case
Complexity.
i)What is time complexity of selection sort?

Unit - I
PART -B (5 x 10 = 50 Marks)
2. a) What is an abstract data type
explain with an example?
b)What is an array explain
representation of arrays in memory?
3. a) What are the types of abstract data
(OR)
types?
b)What is asparse matrix explain sparse
matrix withexample?
Unit - I|
4. a) How does stack data structure represent in
C++?
b) Explain about queues and its applications.
(OR)
5. a) HoW many types of queues are there in data structure?
b) Explain about operations onStack.

Unit - III
6. a) What are the two types of circular linked list?
b) Explain about hash table in detal.
(OR)
7. a) Explain hash function indata structure with example.
b) Describe about Linked lists with example.
..2..
 Code No: E -15319/NICBCS
-2
Unit -IV
8. a) Discuss about Binary Tree.
b) Explain operations on Binary Tree.
9. a)O (OR)
Discuss about
U DFS-
ith1 1
o
example.
8 U 6 - 1 1 8 0
b) Explain Applications of DFS
algorithm.
Unit -V
10. a) Discuss about Bubble sort
with
b)Write in detail about Shell sort. example.

11. a) Explain about Quick sort with (OR)

b)Explain about internal example.
sorting.
 Code No: F-12319/CBCS
FACULTY OF INFORMATICS
B.C.A. Il Semester (CBCS) (Main &Backlog) Examination, June/ July
2024
Time: 3 Hours Subject: Data Structures
Note: . Answer allquestions from Part-A and Max. Marks: 70
answer any five questions trom
Part-B. Choosing onequestion from each unit.
II. Missing data, if any, may be suitably assumed.
PART- A (20 Marks)
1. a) Write the Characteristics of a Data Structure.
b)List the advantages of an Array.
c) List the applications of stack.
d) Define Circular Queue.
e) Define Linked List.
f) Define Hashing.
g) Write the properties of a Heap tree.
h) List the types of Graphs.
i) Define Searching
i) Define Bubble sort.
PART-B (5 x10=50 Marks)
Unit-l

2. a) Explain one dimensional array with an example program.

b)Explain the representation of Sparse Matrix using Linked List.
(OR)
3 a) Wrte about types of Data Structures.
b) Define String and write a program for String implementation.
Unit-ll

4 a) Define Stack andexplain about various operations on Stack.

b)Briefly explain the concept of Priority Queue.
(OR)
a) Define Stack and write aprogram to implement Stack using Array.
b) Define Queue and describe the various operations on Queue.
Unit-Il|

6 a)Write aProgram to implement a Double Linked List.

b) Explain Hash function
(OR)
7 a) Demonstrate the various operations on Single Linked List.
b) Expla1n the Collision Resolution Strategies
Unit-IV

8 a) ExplainBinary Tree with its representations.

b) Detine Graph andexplain the various representation of Graph
(OR)
9 a) Explan about Heap ADT
b) Explain about DFS Graph Traversal
..2
 Code No: F-12319/CBCS
-2
Unit-V

10 a) Explain the concept of Quick sort with an example

b)Write a program to implement of Linear Search.
(OR)
11.a) Write a program to implement Selection sort.
b) Explain Binary Search with example.