ACTUAL 2026/2027 EXAM WITH COMPLETE QUESTIONS AND
DETAILED ANSWERS
Abstract data type
Answer: a blueprint for organizing and working with data that defines what operations can be
performed on the data without specifying how they are implemented
Array
Answer: a homogenous collection of items stored in a contiguous memory block, each
identified by an index number, allowing for efficient access to elements based on their position
Composite variable
Answer: a variable that can hold multiple pieces of data, often grouped together under a single
name
Container
Answer: a data structure that holds a collection of elements, providing methods to add,
remove, and access items within it
Data structure
Answer: A way of organizing and storing data in a computer's memory designed to facilitate the
efficient retrieval, insertion, and deletion of data
,Data structures - linked list
Answer: A linear data structure where elements, called nodes, are connected using pointers
instead of being stored in contiguous memory.
In languages like c, c++, or java, linked lists are usually homogeneous because each node is
defined with a fixed data type.
In languages like python or javascript, linked lists can store mixed data types in different nodes,
making them heterogeneous.
Linked structure
Answer: Any structure composed of elements connected by links or pointers, enabling dynamic
relationships among data elements.
Data structures - lists
Answer: A collection of items arranged in a linear sequence, allowing for easy access to and the
insertion and deletion of elements.
A list can hold multiple elements, and depending on the language, the elements may be of the
same type or different types.
Data structures - queue
Answer: A data structure that follows a first-in, first-out (fifo) order where elements are added
to the back and removed from the front.
,Data structures - record
Answer: A record is a collection of related data items, usually of different types, grouped
together as a single unit.
A record can hold multiple fields or attributes, such as strings, numbers, and booleans, each
with its own data type.
Data structures - stack
Answer: A stack is a linear data structure that follows the last in, first out (lifo) principle,
meaning the last item added is the first to be removed.
Asynchronous
Answer: A type of operation that runs independently of the main program flow, allowing
additional tasks to happen without waiting for others to complete
Bytecode
Answer: A low-level, platform-independent code that is executed by a virtual machine, typically
produced by compiling source code
Case sensitive
Answer: When a programming language treats uppercase and lowercase letters as different
characters
, Object oriented programming - class
Answer: A blueprint for creating objects in object-oriented programming that defines the
properties and behaviors the objects will have.
Compiler
Answer: A tool that translates source code written in a high-level programming language into
machine code or bytecode that a computer can execute.
Object oriented programming - encapsulation
Answer: Bundling data and methods that operate on the data into a single unit (a class) and
restricting access to some of the object's components.
Object oriented programming - field
Answer: A variable associated with a class or object that represents a piece of data stored in
that object.
Object oriented programming - inheritance
Answer: The creation of a new class based on an existing class, inheriting its properties and
methods while adding new ones or modifying existing ones.
Object oriented programming - instantiate
Answer: The process of creating a specific instance of a class, resulting in an object.