Scribd
Upload
38 views2 pages

DS Model Paper

This document contains a model question paper for the Data Structures using C and C++ course. It has 3 sections - Very Short Answer Questions, Short Answer Questions, and Descriptive Answer Questions. Section A contains 2 questions worth 7.5 marks each. Section B contains 1 question worth 15 marks. Section C contains 6 questions worth 22.5 marks each, and students must attempt 2 of these questions. The questions cover topics like data structures, arrays, stacks, queues, priority queues, hashing, trees, sorting, linked lists, and searching algorithms.

Uploaded by

Neelakshi Thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
38 views2 pages

DS Model Paper

This document contains a model question paper for the Data Structures using C and C++ course. It has 3 sections - Very Short Answer Questions, Short Answer Questions, and Descriptive Answer Questions. Section A contains 2 questions worth 7.5 marks each. Section B contains 1 question worth 15 marks. Section C contains 6 questions worth 22.5 marks each, and students must attempt 2 of these questions. The questions cover topics like data structures, arrays, stacks, queues, priority queues, hashing, trees, sorting, linked lists, and searching algorithms.

Uploaded by

Neelakshi Thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Neelkanth Vidyapeeth, Meerut

BCA Sem-III Model Question Paper, Odd Sem- (2022-23) 


Subject : DATA STRUCTURE USING C AND C++
(BCA-302)

Time: 1.5 Hours                                                            Maximum Marks: 75

Note: Attempt all the section as per instructions.

Section-A
(Very Short Answer Questions)

Note: Attempt any two questions. Each question carries 7.5 marks.
2x7.5=15

1. Define the following


a)DataStructure
b)2-D array
c)1-D array
2. Define Array and its types?
3. Define the following?
A)AVL tree
B)Binary Tree
4. What do you mean by sparse matrix?Explain how a sparse matrix is represented in
memory.
5. What is D-queue? Explain the deletion and insertion operation with the help of suitable
example.
Section-B
(Short Answer questions)
Note: Attempt any one questions. Each question carries 15 marks.
1 x 15=15

6. Define
a)stack
b)queue
c)priority queue
7. Describe Hashing and various hashing techniques in details.
8. Define
a)pre-order with steps
b)post-order with steps
c)In-order with steps
Section C
(Descriptive Answer Questions)
Note: Attempt any two questions out of the following six questions. Each question carries 22.5
marks. Answer must be descriptive.
2 x 22.5=45

9. Define singly linked list and doubly linked list.also explain the operations of singly and doubly
linked list.
10. Define circular linked list and also explain the insertion operation of circuler linked list.
And also write the algorithm for circular linked list for traversing.
11. Define
a)BST and solve following example by using BST
3,5,2,8,1,22,11,0,-1,-3,-22,33
b)B-Tree and solve following example by using B-tree
1,2,3,4,5,6,7,8,9,10,11,12 and if order=4
12. Define sorting.And explain its types with examples.
13. Solve following
a)5,7,1,0,-1,-11,2,3,1 (by insertion sort)
b)64,35,22,4,2,1,-9,-1,-2,-3(by merge sort)
c)Define use of header node in linked list.
d)define linear search.
14. A)Solve the following by using heap sort.
4,6,3,2,1,-1,0,-8,-99
B) Define binary search with algorithm.
c)write algorithm for linear search

You might also like