Hey Guys Welcome to CSE Study247
In this page provide you Data Structure Multiple Choice Question With Answer Which is very useful of Many Exam Like semester , ISRO, DRDO, Banking , Railway etc.
Data Structure
A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.
Q.1 Which of the following is a data structure?
Array
Linked list
Stack
All
Explanation
Arrays, Linked lists, and Stacks are all fundamental ways of organizing and storing data in a computer.
Q.2 Which of the following is a static data structure?
Array
Static
Linked List
Data
Explanation
An Array is a static data structure because its size is fixed at the time of declaration and cannot be changed during runtime.
Q.3 Which of the following is a Dynamic data structure?
Array
Static
Linked List
Data
Explanation
A Linked List is a dynamic data structure as it can grow or shrink in size during execution by allocating or deallocating memory.
Q.4 Units of information is called?
Array
Static
Linked List
Data
Explanation
Data refers to the basic units of information that are processed or stored by a computer.
Q.5 Collection of various data items is called?
Record
Static
Linked List
Data
Explanation
A record is a collection of related data items, often of different types, grouped together.
Q.6 Which of the following is a linear data structure?
Tree
Graphs
Linked List
Data
Explanation
Linked List is a linear data structure because its elements form a sequence where each element is connected to the next.
Q.7 Which of the following is a non-linear data structure?
Tree
Graphs
Linked List
Both A & B
Explanation
Trees and Graphs are non-linear data structures because their elements are not organized in a sequential or linear fashion.
Q.8 Which of the following is related to a Divide and Conquer approach?
Tree
Graphs
Linked List
Binary Tree
Explanation
Binary Trees are often used in divide and conquer algorithms (like binary search or heap sort) to efficiently partition data.
Q.9 All elements store in an array in?
Linear order
Non-linear order
Both A & B
None
Explanation
Arrays store elements in contiguous memory locations in a sequential or linear order.
Q.10 Big Omega (Ω) Notation indicates the ________ required?
Maximum time
Minimum time
Both A & B
None
Explanation
Big Omega notation represents the lower bound of an algorithm, indicating the minimum time required for execution (Best Case).
Q.11 Big Omega (Ω) Notation describes the ________ of an algorithm's time complexity?
Average case
Best case
Both A & B
None
Explanation
Big Omega provides the lower bound, which corresponds to the best-case scenario for an algorithm.
Q.12 Theta (Θ) notation describes the ________ of an algorithm?
Average case
Best case
Both A & B
None
Explanation
Theta notation represents the tight bound of an algorithm, commonly used to describe the average-case complexity.
Q.13 Whose equation is this: f(n) ≥ c * g(n)?
Big-O Notation
Big-Omega
Big-Theta
None
Explanation
This is the formal definition of Big-Omega (Ω) notation, which defines the lower bound.
Q.14 Whose equation is this: f(n) ≤ c * g(n)?
Big-O Notation
Big-Omega Notation
Big-Theta Notation
None
Explanation
This is the formal definition of Big-O notation, which defines the upper bound or worst-case scenario.
Q.15 Whose equation is this: C1 * g(n) ≤ f(n) ≤ C2 * g(n)?
Big-O Notation
Big-Omega Notation
Big-Theta Notation
None
Explanation
This is the formal definition of Big-Theta (Θ) notation, which defines a tight bound for the function.
Q.16 Non-linear data structures are accessed in?
Non-sequential order
Random order
Both A & B
None
Explanation
Non-linear data structures like trees and graphs do not follow a single sequential path and can be traversed in various orders.
Q.17 An algorithm that calls itself is known as?
Sub algorithm
Recursion
Both A & B
None
Explanation
Recursion is a programming technique where a function calls itself directly or indirectly.
Q.18 Which of the following is a non-primitive data type?
Integer
Array
None
Explanation
Arrays are non-primitive data types because they are derived from primitive types and can store multiple values.
Q.19 Which of the following is a primitive data type?
Integer
Array
Float
None
Explanation
Float is a primitive (basic) data type used to store decimal numbers. (Note: Integer is also primitive, but Float is the specified answer).
Q.20 Which data structure is used for implementing recursion?
Integer
Array
Stack
None
Explanation
A Stack is used by the system to manage function calls, return addresses, and local variables during recursive execution.