30-minute practice mock for Chapter 7 Data Structures and Algorithm, Database System and Operating System (ACtE07): 30 MCQs (18 conceptual, 12 numerical/code-output), five from each sub-topic - data structures, lists, linked lists and trees (ADTs, asymptotic notation, stacks and queues, infix/postfix conversion and evaluation, singly, doubly and circular linked lists, binary tree traversals, BST operations, height and depth, AVL rotations), sorting, searching and graphs (insertion, selection, exchange, merge, radix, shell and heap sort, sequential and binary search, hashing and collision resolution, graph representation, BFS and DFS, Warshall's algorithm, topological sorting, Prim's and Kruskal's MSTs, Dijkstra's algorithm), data models, normalization and SQL (data abstraction and independence, E-R model, keys and integrity constraints, functional dependencies and 1NF-BCNF, DDL and DML, views, assertions and triggers, relational algebra, query cost estimation and optimization), transaction processing (ACID properties, conflict serializability and precedence graphs, lock-based protocols and 2PL, deadlock handling, log-based recovery), operating systems and process management (OS types and structure, process states and threads, CPU scheduling, critical sections, semaphores, monitors, message passing and classical synchronization problems, banker's algorithm) and memory management, file systems and administration (address translation, allocation strategies, demand paging and TLBs, page replacement, file allocation and inodes, disk scheduling, permissions and user accounts). Every algorithm answer was computed by simulation, every SQL answer by running the query in SQLite, and every code-output answer by running the code.