Scribd
Upload
506 views

BCA Sem. II Data Structures

1. The document is an exam for a Data Structures course, with 10 multiple choice questions in Part A and 4 longer form questions in Part B. 2. Part B asks students to explain the differences between primitive and non-primitive data structures, define and provide an example of a one-dimensional array, illustrate linear and binary search operations with examples, and explain stack operations like push and pop with an example. 3. A mapping of the questions to the course outcomes shows they assess students' understanding of data structures, arrays, searching algorithms, and stacks.

Uploaded by

Mohd. Saquib
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
506 views

BCA Sem. II Data Structures

1. The document is an exam for a Data Structures course, with 10 multiple choice questions in Part A and 4 longer form questions in Part B. 2. Part B asks students to explain the differences between primitive and non-primitive data structures, define and provide an example of a one-dimensional array, illustrate linear and binary search operations with examples, and explain stack operations like push and pop with an example. 3. A mapping of the questions to the course outcomes shows they assess students' understanding of data structures, arrays, searching algorithms, and stacks.

Uploaded by

Mohd. Saquib
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Manav Rachana International Institute of Research and Studies

Centre for Distance and Online Education


BCA II Semester
1st Sessional Examination: April 2023
OBCA-DS-201: Data Structures

Max Time – 1.30 Hrs MM: 30


_________________________________________________________________________

Note: Part A is compulsory. Attempt any 2 questions from part B. All questions carry
equal marks.

PART-A
Q.1 Objective Type Questions [CO1,CO3] L1, L2]

1. What is Array?
a) Collection of different type of elements
b) Collection of similar type of elements
c) None of the above
d) Both A and C

2. Which of the following is non-liner data structure?


a)Stacks
b) List
c)Strings
d)Trees
3.What is the best case for linear search?
a) O(logn)
b) O(n)
c) O(1)
d) O(nlogn)
4. What is the Worst case and Best case of Binary Search?

a) O(n2)
b) O(1)
c)O(nlogn)
d)O(logn)
5. Which one of the following is the process of inserting an element in the stack?
a) Insert
b) Push
c) Add
d) None of the above

6. A linear data structure in which insertion and deletion operations can be performed from
both the ends is_______
a)Circular Queue
b)Deque
c)Queue
d)Priority Queue
7.How can we describe an array in the best possible way?
a) Arrays are immutable
b) Container that stores the elements of similar types
c) The Array is not a data structure
d) The Array shows a hierarchical structure
8. Which of the following principle does Stack use?
a) FIFO Principles
b) LIFIO Principles
c) Ordered Array
d) Linear Tree
9. If the elements ‘1’, ‘2’, ‘3’ and ‘4’ are added in a stack, so what would be the order for the
removal?
a) 4321
b) 1234
c) 2314
d)None of the above
10. If the elements ‘1’, ‘2’, ‘3’ and ‘4’ are added in a stack, so what would be the order for
the removal?
a) 4321
b) 1234
c) 2314
d) None of the above

PART B

Q.2 a) Write the difference between Primitive and Non Primitive data structure.

b) What is Array? Explain one-dimensional array with syntax and Examples.

[CO1,CO2,CO3][L1,L2][5X2 - 10 MARKS]

Q.3. Illustrate Linear Search and Binary Search operations with examples.

[CO1,CO3][L1,L2][ 10 MARKS]

Q.4. What do you mean by stack? Explain the Push and Pop operation with example.

[CO1,CO3][L1,L2][10 MARKS]
Course Coordinator Programme Coordinator

Mapping of Questions with Cos


OBCA- OBCA- OBCA- OBCA-DS-
DS-201.1 DS-201.2 DS-201.3 201.4
Q1 3 - 3 -
Q2 3 2 1 -
Q3 2 - 3 -
Q4 1 - 3 -

You might also like