Q121. Which algorithmic paradigm does Kruskal's Minimum Spanning Tree algorithm utilize?
⚪ Status: You Skipped this question
Correct Answer: Option A (Greedy Strategy)
A
Greedy Strategy
Correct Answer
B
Dynamic Programming
C
Divide and Conquer
D
Backtracking
Why: Kruskal's algorithm sorts all edges by weight in ascending order and greedily adds the smallest valid edge that does not form a cycle.
Data Structures & Graph AlgorithmsNot attempted
Q122. What is the worst-case time complexity of searching for an element in an unsorted Hash Table with chaining on collision?
⚪ Status: You Skipped this question
Correct Answer: Option B (O(n))
A
O(1)
B
O(n)
Correct Answer
C
O(log n)
D
O(n²)
Why: In the worst case where all n keys hash to the same bucket index, the chain degenerates into a single linear linked list of length n, taking O(n) search time.
Computer Networks & ProtocolsNot attempted
Q123. In TCP congestion control, what algorithm is triggered when a packet loss is detected via 3 Duplicate ACKs?
⚪ Status: You Skipped this question
Correct Answer: Option A (Fast Retransmit & Fast Recovery)
A
Fast Retransmit & Fast Recovery
Correct Answer
B
Slow Start
C
Nagle's Algorithm
D
Stop and Wait
Why: Receiving 3 duplicate ACKs causes TCP to immediately retransmit the missing segment without waiting for retransmission timeout (RTO) and enter Fast Recovery.
Computer Networks & ProtocolsNot attempted
Q124. Which layer of the TCP/IP model handles hop-to-hop framing and physical MAC addressing?
⚪ Status: You Skipped this question
Correct Answer: Option A (Network Interface Layer (Data Link / Physical))
A
Network Interface Layer (Data Link / Physical)
Correct Answer
B
Internet Layer
C
Transport Layer
D
Application Layer
Why: The Network Interface / Link layer packages raw network bits into Ethernet frames and resolves MAC addresses.
Operating Systems & Process SynchronizationNot attempted
Q125. Which scheduling algorithm suffers from Convoy Effect where small processes wait behind a long CPU-bound process?
⚪ Status: You Skipped this question
Correct Answer: Option A (First-Come First-Served (FCFS))
A
First-Come First-Served (FCFS)
Correct Answer
B
Round Robin
C
Shortest Job First
D
Multi-Level Queue
Why: In non-preemptive FCFS, if a long CPU-bound process arrives first, all short I/O-bound processes get blocked behind it, causing low CPU/device utilization.
Operating Systems & Process SynchronizationNot attempted
Q126. In Unix-like systems, what system call creates a duplicate child process identical to the parent?
⚪ Status: You Skipped this question
Correct Answer: Option A (fork())
A
fork()
Correct Answer
B
exec()
C
wait()
D
exit()
Why: fork() creates an exact copy of the calling process (child), returning 0 to the child and the child's PID to the parent.
Database Management SystemsNot attempted
Q127. What is a Foreign Key in Relational Database Management Systems?
⚪ Status: You Skipped this question
Correct Answer: Option A (An attribute in a table that references the Primary Key of another table to maintain referential integrity)
A
An attribute in a table that references the Primary Key of another table to maintain referential integrity
Correct Answer
B
A key stored on a remote server
C
An encrypted hash key
D
A key containing only candidate attributes
Why: Foreign Keys establish referential integrity constraints between parent and child tables by referencing primary keys.
Database Management SystemsNot attempted
Q128. Which concurrency control protocol uses shared (S) and exclusive (X) locks to ensure serializability?
⚪ Status: You Skipped this question
Correct Answer: Option A (Two-Phase Locking (2PL))
A
Two-Phase Locking (2PL)
Correct Answer
B
Timestamp Ordering
C
Validation Based Protocol
D
Multiversion Protocol
Why: 2PL consists of a Growing Phase (acquiring locks) followed by a Shrinking Phase (releasing locks), guaranteeing conflict serializability.
Computer Organization & ArchitectureNot attempted
Q129. What is the primary difference between RISC and CISC processor design philosophies?
⚪ Status: You Skipped this question
Correct Answer: Option A (RISC uses simple single-cycle instructions with load/store architecture; CISC uses complex multi-cycle instructions)
Why: RISC (Reduced Instruction Set Computer) focuses on fast execution of simple instructions using heavy pipelining. CISC uses complex instructions directly addressing memory.
Computer Organization & ArchitectureNot attempted
Q130. In Booth's multiplication algorithm for signed binary numbers, what operation is performed when multiplier bits Q_0 Q_-1 are '1 0'?
⚪ Status: You Skipped this question
Correct Answer: Option A (Subtract multiplicand M from Accumulator A (A = A - M))
A
Subtract multiplicand M from Accumulator A (A = A - M)
Correct Answer
B
Add multiplicand M to Accumulator A (A = A + M)
C
Shift right accumulator without addition
D
Set Accumulator to 0
Why: In Booth's algorithm: '10' means A = A - M followed by arithmetic right shift. '01' means A = A + M. '00' and '11' mean shift only.
Compiler Design & Lexical AnalysisNot attempted
Q131. Which data structure is maintained by the Lexical Analyzer to store all program identifier tokens, types, and scopes?
⚪ Status: You Skipped this question
Correct Answer: Option A (Symbol Table)
A
Symbol Table
Correct Answer
B
Parse Tree
C
Activation Record Stack
D
Register Bank
Why: The Symbol Table is a central repository mapping variable names, function names, types, and scope levels accessed by all compiler phases.
Software Engineering & TestingNot attempted
Q132. In Software Quality Assurance, what is White Box Testing also commonly called?
⚪ Status: You Skipped this question
Correct Answer: Option A (Structural / Glass Box Testing)
A
Structural / Glass Box Testing
Correct Answer
B
Functional Testing
C
Acceptance Testing
D
Black Box Testing
Why: White Box Testing examines internal code structure, execution logic, control paths, and conditions.
Theory of ComputationNot attempted
Q133. What is Pumping Lemma primarily used for in Formal Automata Theory?
⚪ Status: You Skipped this question
Correct Answer: Option A (To prove that a language is NOT Regular or NOT Context-Free)
A
To prove that a language is NOT Regular or NOT Context-Free
Correct Answer
B
To construct minimum states DFA
C
To convert NFA to DFA
D
To prove that a language is Recursive
Why: Pumping Lemma is a proof technique by contradiction used to demonstrate that a given language fails the repetition property, proving it non-regular.
Q134. Which Gang of Four (GoF) Design Pattern ensures that a class has only ONE instance and provides a global access point to it?
⚪ Status: You Skipped this question
Correct Answer: Option A (Singleton Pattern)
A
Singleton Pattern
Correct Answer
B
Factory Method Pattern
C
Observer Pattern
D
Adapter Pattern
Why: Singleton Creational Pattern restricts class instantiation to a single object (e.g. database connection pool, logger).
Data Structures & Graph AlgorithmsNot attempted
Q135. What is the time complexity of QuickSort in the worst-case when the array is already sorted and first element is chosen as pivot?
⚪ Status: You Skipped this question
Correct Answer: Option A (O(n²))
A
O(n²)
Correct Answer
B
O(n log n)
C
O(n)
D
O(1)
Why: If array is sorted and first element is pivot, partitions are completely unbalanced (1 and n-1 size), leading to quadratic O(n²) time.
Computer Networks & ProtocolsNot attempted
Q136. What is the standard port number used by HTTPS (Hypertext Transfer Protocol Secure) over TLS/SSL?
⚪ Status: You Skipped this question
Correct Answer: Option B (Port 443)
A
Port 80
B
Port 443
Correct Answer
C
Port 21
D
Port 25
Why: HTTP defaults to TCP Port 80, while encrypted HTTPS defaults to TCP Port 443.
Operating Systems & Process SynchronizationNot attempted
Q137. In page replacement policy, what is the principle of Least Recently Used (LRU)?
⚪ Status: You Skipped this question
Correct Answer: Option A (Replace the page that has NOT been used for the longest period of time in past)
A
Replace the page that has NOT been used for the longest period of time in past
Correct Answer
B
Replace the page that will NOT be used for longest time in future
C
Replace the page brought into memory first
D
Replace random page
Why: LRU uses past page access history to replace the page that has been idle for the longest duration.
Database Management SystemsNot attempted
Q138. Which normal form deals with multivalued dependencies (X ↠ Y)?
⚪ Status: You Skipped this question
Correct Answer: Option A (Fourth Normal Form (4NF))
A
Fourth Normal Form (4NF)
Correct Answer
B
Third Normal Form (3NF)
C
Second Normal Form (2NF)
D
Fifth Normal Form (5NF)
Why: A relation is in 4NF if it is in BCNF and contains no non-trivial Multivalued Dependencies (MVDs).
Computer Organization & ArchitectureNot attempted
Q139. What is the function of the Accumulator register in a CPU?
⚪ Status: You Skipped this question
Correct Answer: Option A (Stores intermediate arithmetic and logic unit (ALU) results)
A
Stores intermediate arithmetic and logic unit (ALU) results
Correct Answer
B
Stores page table pointers
C
Decodes binary machine instructions
D
Controls cache memory write back
Why: The Accumulator (AC) is a primary register where the ALU stores intermediate results during calculation.
Software Engineering & TestingNot attempted
Q140. In Function Point Analysis (FPA), what does the metric evaluate?
⚪ Status: You Skipped this question
Correct Answer: Option A (Functionality delivered to end user independent of source code lines)
A
Functionality delivered to end user independent of source code lines
Correct Answer
B
Total physical lines of code (LOC)
C
Number of CPU cycles per instruction
D
Disk space occupied by executable
Why: Function Point Analysis measures software size based on user inputs, outputs, queries, files, and interfaces.
Theory of ComputationNot attempted
Q141. Which grammar type in Chomsky hierarchy is also known as Phrase Structure Grammar?
⚪ Status: You Skipped this question
Correct Answer: Option A (Type-0 Grammar (Unrestricted))
A
Type-0 Grammar (Unrestricted)
Correct Answer
B
Type-1 Grammar (Context-Sensitive)
C
Type-2 Grammar (Context-Free)
D
Type-3 Grammar (Regular)
Why: Type-0 Unrestricted grammars generate Recursively Enumerable languages accepted by Turing Machines.
Compiler Design & Lexical AnalysisNot attempted
Q142. What is a Handle in Bottom-Up Parsing?
⚪ Status: You Skipped this question
Correct Answer: Option A (A substring that matches the right side of a production rule and whose reduction represents a step in rightmost derivation in reverse)
A
A substring that matches the right side of a production rule and whose reduction represents a step in rightmost derivation in reverse
Correct Answer
B
A start symbol pointer
C
An error handling routine
D
A lexical token name
Why: A handle is the specific right-hand side substring reduced during shift-reduce parsing to construct a rightmost derivation in reverse.
Computer Networks & ProtocolsNot attempted
Q143. In wireless networks, what problem does the RTS/CTS (Request to Send / Clear to Send) mechanism solve?
⚪ Status: You Skipped this question
Correct Answer: Option A (Hidden Terminal Problem)
A
Hidden Terminal Problem
Correct Answer
B
Counting to Infinity Problem
C
Subnet Masking Problem
D
DNS Poisoning Problem
Why: RTS/CTS handshake reserves the wireless medium locally, preventing collisions caused by nodes out of range of each other (Hidden Terminals).
Operating Systems & Process SynchronizationNot attempted
Q144. What is the main function of the Operating System Kernel?
⚪ Status: You Skipped this question
Correct Answer: Option A (Core central component that manages system hardware resources and acts as bridge between software and hardware)
A
Core central component that manages system hardware resources and acts as bridge between software and hardware
Correct Answer
B
User text editing interface
C
Web browsing rendering engine
D
Database query compiler
Why: Kernel is the essential software loaded at boot managing memory, CPU tasks, disk I/O, and hardware interrupts.
Database Management SystemsNot attempted
Q145. In SQL, which aggregate function returns the average value of a numeric column?
⚪ Status: You Skipped this question
Correct Answer: Option A (AVG())
A
AVG()
Correct Answer
B
MEAN()
C
SUM()
D
MEDIAN()
Why: AVG() computes the mathematical mean of non-NULL values in a numeric column.
Data Structures & Graph AlgorithmsNot attempted
Q146. In a binary search tree (BST), which traversal produces elements in strictly ascending sorted order?
⚪ Status: You Skipped this question
Correct Answer: Option A (Inorder Traversal)
A
Inorder Traversal
Correct Answer
B
Preorder Traversal
C
Postorder Traversal
D
Level Order Traversal
Why: Inorder traversal (Left, Root, Right) of a Binary Search Tree visits values in ascending numerical order.
Computer Organization & ArchitectureNot attempted
Q147. What is DMA (Direct Memory Access)?
⚪ Status: You Skipped this question
Correct Answer: Option A (Feature that allows I/O devices to transfer data directly to/from main memory without CPU intervention)
A
Feature that allows I/O devices to transfer data directly to/from main memory without CPU intervention
Correct Answer
B
Direct CPU register copy
C
Dynamic cache allocation
D
Disk defragmentation mode
Why: DMA controllers manage high-speed block transfers between I/O peripherals and RAM, freeing the CPU to execute other tasks.
Why: LL(1): 1st L = Left-to-right scan, 2nd L = Leftmost derivation, (1) = 1 lookahead input symbol.
Computer Networks & ProtocolsNot attempted
Q152. What is the network loop prevention mechanism used in Spanning Tree Protocol (STP) at Data Link Layer?
⚪ Status: You Skipped this question
Correct Answer: Option A (Blocks redundant physical switch ports to form a loop-free logical tree topology)
A
Blocks redundant physical switch ports to form a loop-free logical tree topology
Correct Answer
B
Applies IP routing tables
C
Drops packets with low TTL
D
Uses MAC address translation
Why: STP (IEEE 802.1D) detects redundant paths in Ethernet switch networks and places extra ports in Blocking mode to prevent broadcast storms.
Operating Systems & Process SynchronizationNot attempted
Q153. What is the difference between Preemptive and Non-Preemptive CPU scheduling?
⚪ Status: You Skipped this question
Correct Answer: Option A (Preemptive can interrupt running process; Non-Preemptive allows running process to finish its CPU burst)
A
Preemptive can interrupt running process; Non-Preemptive allows running process to finish its CPU burst
Correct Answer
B
Non-Preemptive uses virtual memory
C
Preemptive works only on single core
D
There is no difference
Why: Preemptive scheduling can forcibly suspend a running process when a higher-priority task arrives. Non-preemptive processes run until exit or I/O wait.
Database Management SystemsNot attempted
Q154. Which SQL command is used to remove a table structure and all its contents completely from database?
⚪ Status: You Skipped this question
Correct Answer: Option A (DROP TABLE)
A
DROP TABLE
Correct Answer
B
DELETE FROM
C
TRUNCATE TABLE
D
REMOVE TABLE
Why: DROP TABLE is a DDL command that deletes both table data and its schema definition. TRUNCATE empties rows keeping schema. DELETE deletes selected rows.
Data Structures & Graph AlgorithmsNot attempted
Q155. What data structure is naturally used to implement Breadth First Search (BFS) graph traversal?
⚪ Status: You Skipped this question
Correct Answer: Option A (Queue (FIFO))
A
Queue (FIFO)
Correct Answer
B
Stack (LIFO)
C
Heap
D
Binary Tree
Why: BFS explores nodes level-by-level using a First-In-First-Out (FIFO) queue data structure.
Computer Organization & ArchitectureNot attempted
Q156. What is Cache Write-Through policy?
⚪ Status: You Skipped this question
Correct Answer: Option A (Updates are written simultaneously to both Cache Memory and Main RAM Memory)
A
Updates are written simultaneously to both Cache Memory and Main RAM Memory
Correct Answer
B
Updates are written to Cache first and RAM later during eviction
C
Updates bypass cache memory
D
Updates write only to disk
Why: Write-Through ensures data consistency by writing every store operation directly to both Cache and RAM at the same time.