BCA FINAL EXAM STUDY GUIDE 2026
COMPLETE QUESTIONS WITH CORRECT
DETAILED ANSWERS || 100% GUARANTEED
PASS <RECENT VERSION>
1. Which data structure follows the LIFO (Last-In, First-Out) principle?
A) Queue
B) Stack
C) Linked List
D) Tree
Answer: B) Stack. LIFO means the last element added is the first one to be
removed. This is the fundamental behavior of a stack, implemented with operations
like push and pop.
2. What is the time complexity of the binary search algorithm on a sorted
array of size n?
A) O(n)
B) O(log n)
C) O(n²)
D) O(1)
Answer: B) O(log n). Binary search repeatedly divides the search interval in half,
leading to logarithmic time complexity.
3. In Object-Oriented Programming (OOP), what is the process of creating a
new class from an existing class called?
A) Polymorphism
B) Encapsulation
C) Inheritance
D) Abstraction
Answer: C) Inheritance. It allows a new class (subclass/derived class) to inherit
the properties and methods of an existing class (superclass/base class).
4. Which of the following is NOT a pillar of OOP?
A) Inheritance
,B) Polymorphism
C) Compilation
D) Encapsulation
Answer: C) Compilation. The four main pillars of OOP are Abstraction,
Encapsulation, Inheritance, and Polymorphism. Compilation is a process of
converting source code to machine code.
5. A pointer in C++ is:
A) The value of a variable
B) A variable that stores the memory address of another variable
C) The data type of a variable
D) A function call
Answer: B) A variable that stores the memory address of another
variable. Pointers are used for dynamic memory allocation, arrays, and to pass
variables by reference.
6. The process of combining data and functions into a single unit is called:
A) Polymorphism
B) Inheritance
C) Encapsulation
D) Abstraction
Answer: C) Encapsulation. It bundles the data (variables) and the methods
(functions) that operate on the data into a single unit, called a class, and restricts
direct access to some of the object's components.
7. What is the worst-case time complexity of the Bubble Sort algorithm?
A) O(n)
B) O(log n)
C) O(n log n)
D) O(n²)
Answer: D) O(n²). In the worst case (when the array is reverse sorted), Bubble
Sort requires n passes, each taking O(n) time, resulting in O(n²) complexity.
8. In a binary tree, what is a node with no children called?
A) Root Node
B) Internal Node
, C) Leaf Node
D) Sibling Node
Answer: C) Leaf Node. A leaf node is a terminal node in a tree structure.
9. Which of the following is a linear data structure?
A) Graph
B) Tree
C) Queue
D) Map
Answer: C) Queue. Linear data structures arrange elements in a sequential order.
Queues (like stacks and linked lists) are linear, while trees and graphs are non-
linear.
10. What does the 'public' access specifier in a C++ class do?
A) Hides members from outside the class
B) Allows members to be accessed from anywhere in the program
C) Allows access only within the same class
D) Allows access only from inherited classes
Answer: B) Allows members to be accessed from anywhere in the
program. Public members form the interface of the class.
Section 2: Database Management Systems (DBMS)
11. What is the primary key in a relational database table?
A) A key that can have duplicate values
B) A foreign key from another table
C) A unique identifier for each record in a table
D) A key that is never used
Answer: C) A unique identifier for each record in a table. It must contain
unique values and cannot be NULL.
12. The SQL command used to retrieve data from a database is:
A) UPDATE
B) SELECT
C) GET
COMPLETE QUESTIONS WITH CORRECT
DETAILED ANSWERS || 100% GUARANTEED
PASS <RECENT VERSION>
1. Which data structure follows the LIFO (Last-In, First-Out) principle?
A) Queue
B) Stack
C) Linked List
D) Tree
Answer: B) Stack. LIFO means the last element added is the first one to be
removed. This is the fundamental behavior of a stack, implemented with operations
like push and pop.
2. What is the time complexity of the binary search algorithm on a sorted
array of size n?
A) O(n)
B) O(log n)
C) O(n²)
D) O(1)
Answer: B) O(log n). Binary search repeatedly divides the search interval in half,
leading to logarithmic time complexity.
3. In Object-Oriented Programming (OOP), what is the process of creating a
new class from an existing class called?
A) Polymorphism
B) Encapsulation
C) Inheritance
D) Abstraction
Answer: C) Inheritance. It allows a new class (subclass/derived class) to inherit
the properties and methods of an existing class (superclass/base class).
4. Which of the following is NOT a pillar of OOP?
A) Inheritance
,B) Polymorphism
C) Compilation
D) Encapsulation
Answer: C) Compilation. The four main pillars of OOP are Abstraction,
Encapsulation, Inheritance, and Polymorphism. Compilation is a process of
converting source code to machine code.
5. A pointer in C++ is:
A) The value of a variable
B) A variable that stores the memory address of another variable
C) The data type of a variable
D) A function call
Answer: B) A variable that stores the memory address of another
variable. Pointers are used for dynamic memory allocation, arrays, and to pass
variables by reference.
6. The process of combining data and functions into a single unit is called:
A) Polymorphism
B) Inheritance
C) Encapsulation
D) Abstraction
Answer: C) Encapsulation. It bundles the data (variables) and the methods
(functions) that operate on the data into a single unit, called a class, and restricts
direct access to some of the object's components.
7. What is the worst-case time complexity of the Bubble Sort algorithm?
A) O(n)
B) O(log n)
C) O(n log n)
D) O(n²)
Answer: D) O(n²). In the worst case (when the array is reverse sorted), Bubble
Sort requires n passes, each taking O(n) time, resulting in O(n²) complexity.
8. In a binary tree, what is a node with no children called?
A) Root Node
B) Internal Node
, C) Leaf Node
D) Sibling Node
Answer: C) Leaf Node. A leaf node is a terminal node in a tree structure.
9. Which of the following is a linear data structure?
A) Graph
B) Tree
C) Queue
D) Map
Answer: C) Queue. Linear data structures arrange elements in a sequential order.
Queues (like stacks and linked lists) are linear, while trees and graphs are non-
linear.
10. What does the 'public' access specifier in a C++ class do?
A) Hides members from outside the class
B) Allows members to be accessed from anywhere in the program
C) Allows access only within the same class
D) Allows access only from inherited classes
Answer: B) Allows members to be accessed from anywhere in the
program. Public members form the interface of the class.
Section 2: Database Management Systems (DBMS)
11. What is the primary key in a relational database table?
A) A key that can have duplicate values
B) A foreign key from another table
C) A unique identifier for each record in a table
D) A key that is never used
Answer: C) A unique identifier for each record in a table. It must contain
unique values and cannot be NULL.
12. The SQL command used to retrieve data from a database is:
A) UPDATE
B) SELECT
C) GET
