What does DSA stand for?
A
Data Software Application B
Database System Architecture C
Data Structures and Algorithms D
Distributed System Analysis
Analysis & Theory
DSA stands for Data Structures and Algorithms.
Which of the following is NOT a linear data structure?
A
Array B
Stack C
Queue D
Tree
Analysis & Theory
Tree is a hierarchical (non-linear) data structure.
What is the main purpose of an algorithm?
A
To store data efficiently B
To describe steps to solve a problem C
To create user interfaces D
To connect to databases
Analysis & Theory
An algorithm is a sequence of steps to solve a specific problem.
Which of these is an example of a dynamic data structure?
A
Array B
Linked List C
Tuple D
String
Analysis & Theory
Linked List can grow and shrink during runtime, making it dynamic.
Which data structure uses the First In First Out (FIFO) principle?
A
Stack B
Queue C
Tree D
Graph
Analysis & Theory
Queue follows FIFO, where the first element added is the first removed.
Which notation is commonly used to describe time complexity?
A
Lambda Notation B
Theta Notation C
Big O Notation D
Sigma Notation
Analysis & Theory
Big O Notation describes the upper bound of time complexity.
Which data structure uses Last In First Out (LIFO) ordering?
A
Queue B
Stack C
Heap D
Array
Analysis & Theory
Stack removes the most recently added element first.
Which of the following is NOT a characteristic of a good algorithm?
A
Finiteness B
Definiteness C
Ambiguity D
Effectiveness
Analysis & Theory
A good algorithm must be unambiguous.
What is the primary goal of using data structures?
A
To create graphics B
To organize and manage data efficiently C
To send emails D
To perform calculations only
Analysis & Theory
Data structures help organize and manage data efficiently.
Which of these is a non-linear data structure?
A
Stack B
Array C
Linked List D
Graph
Analysis & Theory
Graph is a non-linear data structure consisting of nodes and edges.