Scribd
Upload
15 views3 pages

DSA Module Test Question

The document contains a class test for a Data Structure module, consisting of objective and long answer type questions. Group A includes 10 multiple-choice questions covering topics such as linear data structures, asymptotic notations, and user-defined data types. Group B consists of four long answer questions that require explanations of data structures, algorithms, time and space complexity, and abstract data types.

Uploaded by

Raushan Kumar
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
15 views3 pages

DSA Module Test Question

The document contains a class test for a Data Structure module, consisting of objective and long answer type questions. Group A includes 10 multiple-choice questions covering topics such as linear data structures, asymptotic notations, and user-defined data types. Group B consists of four long answer questions that require explanations of data structures, algorithms, time and space complexity, and abstract data types.

Uploaded by

Raushan Kumar
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/ 3

DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
Government Polytechnic Banka

DSA Module-1.
An Introduction to Data
Structure
Class Test Questions
Group-A
F.M – 30 Marks
Objective Type Questions.
1 X 10=10 Marks

1. Which of the following is a linear data structure?


A) Tree
B) Graph
C) Array
D) Hash Table
2. Which data structure follows Last In First Out (LIFO) principle?
A) Queue
B) Stack
C) Array
D) Tree
3. Which of the following is NOT an asymptotic notation?
a) Big-O (O)
b) Big-Theta (Θ)
c) Small-O (o)
d) Big-Delta (Δ)
4. Which asymptotic notation gives both upper and lower bounds
for an algorithm's time complexity?
a) Big-O (O)
b) Big-Omega (Ω)
c) Big-Theta (Θ)
d) Small-o (o)
5. If a function runs in O(n²) time, which of the following
statements is true?
a) It can run faster than O(n)
b) It cannot run slower than O(n³)

Page 1 of 3
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING
Government Polytechnic Banka

c) It can run slower than O(n log n)


d) None of the above

6. What is the asymptotic complexity of a constant-time


algorithm?
a) O(n)
b) O(log n)
c) O(1)
d) O(n²)
7. If an algorithm has time complexity T(n) = 3n² + 5n + 2, what is
the asymptotic notation?
a) O(n²)
b) O(n)
c) O(1)
d) O(n³)
8. Which of the following is true about Abstract Data Types?
a) ADT is language-dependent
b) ADT defines both data structure and algorithm
c) ADT defines only behaviour and operations, not internal
implementation
d) ADT must use linked lists
9. What is a User Defined Data Type?
a) A data type created by the user using primitive data types
b) A data type built into the language
c) A data type with no operations
d) A data type that requires no implementation
10. Which of the following is an example of a User Defined Data
Type in C?
a) int
b) float
c) struct
d) double

Group B
Long Answer Type Questions
4 x 5 = 20 Marks

Page 2 of 3
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING
Government Polytechnic Banka

Q. What is Data Structure ? Why we need a Data Structure explain


in Brief .
Q. Define Algorithm ? Write an algorithm to find the factorial of a
number entered by user.
Q. Define Time Complexity & Space Complexity with suitable
example.
Q. Write short notes on the following
(a) Abstract Data Type(ADT)
(b) Operations on Data Structure

Page 3 of 3

You might also like