Professional Documents
Culture Documents
1.Which of the following data structures is most efficient for storing data that needs to be
accessed in random order?
(b) Array
(d) Stack
Answer: (c)
2.What is the time complexity of inserting an element into an unsorted linked list?
(a) O(1)
(b) O(log n)
(c) O(n)
(d) O(n^2)
Answer: (a)
(a) O(n)
(b) O(log n)
(d) O(n^2)
Answer: (b)
4.What is the time complexity of searching for an element in a sorted array using binary
search?
(a) O(1)
(b) O(log n)
(c) O(n)
(d) O(n^2)
Answer: (b)
(a) O(n)
(c) O(n^2)
(d) O(n^3)
Answer: (c)
(a) Bus
(b) Ring
(c) Star
(d) Mesh
Answer: (c)
7.What is the purpose of the TCP protocol?
Answer: (a)
Answer: (c)
9.Which scheduling algorithm is designed to reduce the response time for interactive
computing?
(a) First-Come-First-Serve (FCFS)
(b) Shortest Job Next (SJN)
(c) Round Robin (RR)
(d) Priority Scheduling
Answer: (c)
10.What is the main purpose of the Memory Management Unit (MMU) in an operating
system?
(a) Manage file systems
(b) Manage input/output devices
(c) Translate virtual addresses to physical addresses
(d) Schedule processes
Answer: (c)
11.In the context of file systems, what does RAID stand for?
(a) Redundant Array of Independent Disks
(b) Random Access and Integrated Drives
(c) Read And Index Data
(d) Remote Access and Interconnected Devices
Answer: (a)
Answer: (a)
13.Which memory allocation strategy involves dividing memory into fixed-size blocks?
(a) Best Fit
(b) Worst Fit
(c) First Fit
(d) Paging
Answer: (d)
14. What is a database?
Answer: (d)
15. What are the three main components of a database management system (DBMS)?
(c) Data definition language (DDL), data manipulation language (DML), and data control
language (DCL)
Answer: (b)
(a) A set of rules that defines how data can be organized and stored in a database
Answer: (d)
Answer: (c)
Answer: (b)
(b) A foreign key that references the primary key of another table
Answer: (a)
Answer: (b)
Answer: (d)
Answer: (a)
(a) A virtual table that is derived from one or more base tables
Answer: (a)
25. Which data structure follows the Last In, First Out (LIFO) principle?
a) Queue
b) Linked List
c) Stack
d) Tree
Answer: c) Stack
26. In a linked list, what is the name of the element that contains data and a reference to the
next node?
a) Leaf
b) Node
c) Root
d) Branch
Answer: b) Node
27. What type of data structure is suitable for modeling hierarchical relationships?
a) Array
b) Linked List
c) Graph
d) Heap
Answer: c) Graph
28. Which data structure uses the "First In, First Out" (FIFO) principle?
a) Stack
b) Queue
c) Heap
d) Tree
Answer: b) Queue
a) Sorting data
b) Efficient search and retrieval
c) Storing elements in a linear order
d) Representing hierarchical relationships
30. Which data structure organizes elements in a binary tree with each node having at most
two children?
a) Queue
b) Heap
c) Binary Tree
d) Linked List
Answer: c) Ensures that the parent node has a greater value than its children
a) Derivatives
b) Vectors
c) Sets
d) Integrals
Answer: c) Sets
a) Conjunction
b) Disjunction
c) Negation
d) Implication
Answer: b) Disjunction
Answer: b) If there are more pigeons than holes, at least one hole must contain more
than one pigeon
39. Which branch of discrete structures deals with the study of counting and arrangement of
objects?
a) Set theory
b) Graph theory
c) Combinatorics
d) Number theory
Answer: c) Combinatorics
40. What is the purpose of a loop in programming?
Answer: c) Stack is used for function calls and local variables, while heap is used for
dynamic memory allocation
Answer: c) The ability of a class to have multiple methods with the same name but
different implementations
a) To declare variables
b) To perform arithmetic operations
c) To make decisions based on conditions
d) To repeat a sequence of statements
Answer: c) To enable a class to have multiple methods with the same name but different
implementations
50. What is the difference between an abstract class and an interface in OOP?