Data Structures, Algorithms, Programming Concepts (C/C++/Python/Java), OOP & Web Development (Part 2)

Question 1

What error condition occurs when a program attempts to perform a `push()` operation on a Stack that has already reached its maximum allocated capacity?

Accepted Answer

Stack Overflow

Answer

Stack Underflow

Answer

Segmentation Fault

Answer

Null Pointer Exception

Question 2

In C, C++, Java, and Python, what is the default zero-based index of the very first element in an array of size $N$?

Accepted Answer

0

Answer

1

Answer

-1

Answer

N

Question 3

Which core pillar of Object-Oriented Programming is defined as "bundling data (attributes) and the methods (functions) that manipulate that data into a single unit (class)", while restricting direct access to internal components?

Accepted Answer

Encapsulation (Data Hiding)

Answer

Inheritance

Answer

Polymorphism

Answer

Abstraction

Question 4

Which OOP principle involves "displaying only essential information to the outside user while hiding the complex background implementation details"?

Accepted Answer

Abstraction

Answer

Inheritance

Answer

Polymorphism

Answer

Instantiation

Question 5

Which OOP concept allows a new class (subclass / derived class) to acquire properties and behaviors (methods) from an existing class (superclass / base class), promoting code reusability?

Accepted Answer

Inheritance

Answer

Encapsulation

Answer

Polymorphism

Answer

Delegation

Question 6

What does the term "Polymorphism" literally mean in Object-Oriented Programming?

Accepted Answer

"Many forms" — the ability of different classes to respond to the same method call in different ways

Answer

Writing code in multiple programming languages

Answer

Running a program on multiple computers

Answer

Having multiple constructors with the same arguments

Question 7

What is a "Class" and what is an "Object" in Object-Oriented Programming?

Accepted Answer

A Class is a user-defined blueprint / template defining attributes and methods; an Object is a concrete instance of that class allocated in memory

Answer

A Class is an object in memory; an Object is the code file on disk

Answer

A Class is for text; an Object is for numbers

Answer

They are exact synonyms

Question 8

Which of the following is classified as a "Non-Linear" data structure?

Accepted Answer

Tree (or Graph)

Answer

Array

Answer

Stack

Answer

Queue

Question 9

Which fundamental principle governs the insertion and deletion of elements in a "Stack" data structure?

Accepted Answer

LIFO (Last In, First Out) / FILO

Answer

FIFO (First In, First Out)

Answer

Random Access

Answer

Priority Sorting

Question 10

Which principle governs data operations in a standard "Queue" data structure?

Accepted Answer

FIFO (First In, First Out)

Answer

LIFO (Last In, First Out)

Answer

Last In, Last Out

Answer

Hierarchical Branching

Question 11

How are elements of a standard one-dimensional array physically laid out in computer memory?

Accepted Answer

In contiguous, sequential physical memory addresses of identical byte sizes

Answer

Scattered randomly across different RAM chips

Answer

Stored in a circular ring on the hard drive

Answer

Stored in reverse alphabetical order

Question 12

What are the two basic components contained inside a node of a standard Singly Linked List?

Accepted Answer

A Data field (holding the payload value) and a Next pointer (storing the memory address of the next node)

Answer

Two data fields and no pointers

Answer

A CPU register and a cache tag

Answer

An array and a stack

Question 13

What value is stored in the `next` pointer of the very last node in a linear Singly Linked List?

Accepted Answer

NULL (or nullptr / None)

Answer

Address of the head node

Answer

0

Answer

-1

Question 14

In a Tree data structure, what is the topmost node that has no parent called?

Accepted Answer

Root Node

Answer

Leaf Node

Answer

Child Node

Answer

Sibling Node

Question 15

What is a node in a tree that has NO children called?

Accepted Answer

Leaf Node (Terminal / External Node)

Answer

Root Node

Answer

Internal Node

Answer

Ancestor Node