CNIT 176 Final Exam 2026
Expert Verified | Ace the Test
Abstract data type - 🧠ANSWER ✔✔A data type whose properties (data and
operations) are specified independently of any particular implementation
LIFO - 🧠ANSWER ✔✔last in first out
Composite data type - 🧠ANSWER ✔✔A data type in which a name is given
to a collection of data values
,List - 🧠ANSWER ✔✔"container of items", logical operations that can be
applied are: Add item, Remove item, Get next item, or More items
Container - 🧠ANSWER ✔✔Object's whole role is to hold and manipulate
other objects
Stack - 🧠ANSWER ✔✔An abstract data type in which accesses are made
at only one end (LIFO)
Data structure - 🧠ANSWER ✔✔Implementation of composite data fields in
an abstract data type
Push - 🧠ANSWER ✔✔insert on a stack
Array- based - 🧠ANSWER ✔✔Objects in the container are kept in an array
Pop - 🧠ANSWER ✔✔delete on a stack
Linked-based - 🧠ANSWER ✔✔Objects in the container are not kept
physically together, but each items tells you where to go to get the next one
in the structure
Queue - 🧠ANSWER ✔✔An abstract data type in which items are entered at
one end and removed from the other end (FIFO)
,FIFO - 🧠ANSWER ✔✔first in first out
Multiprogramming - 🧠ANSWER ✔✔the technique of keeping multiple
programs in main memory at the same time
Frame - 🧠ANSWER ✔✔a fixed size portion of main memory that holds a
process page
Batch processing - 🧠ANSWER ✔✔The first operating system was a human
operator who organized various jobs from multiple users into batches of
jobs that needed the same resources
Page - 🧠ANSWER ✔✔a fixed size portion of a process that is stored into a
memory frame
Time sharing - 🧠ANSWER ✔✔allows multiple users to interact with a
computer at the same time
Swap - 🧠ANSWER ✔✔the act of bringing in a page from secondary
memory, which often causes another page to be written back to secondary
memory
Thrashing - 🧠ANSWER ✔✔inefficient processing caused by constant page
swaps
COPYRIGHT©JOSHCLAY 2025/2026. YEAR PUBLISHED 2026. COMPANY REGISTRATION NUMBER: 619652435. TERMS OF USE. PRIVACY
3
STATEMENT. ALL RIGHTS RESERVED
, Single Contiguous Memory Management - 🧠ANSWER ✔✔only 2 programs
in memory- operating system and application program
Process control block - 🧠ANSWER ✔✔a data structure used by the
operating system to manage information about a process
Fixed partitions - 🧠ANSWER ✔✔memory is divided into fixed number of
partitions in which programs can be loaded
Context switch - 🧠ANSWER ✔✔the exchange of register information
First come, first serve - 🧠ANSWER ✔✔processes are moved to the CPU in
the order they arrive in the running state
Shortest job next - 🧠ANSWER ✔✔process with the shortest estimated
running time in the ready state is moved into the running state first
Round robin - 🧠ANSWER ✔✔each process runs for a specified time slice
and moves from the running state to the ready state to wait its turn if not
finished
Dynamic partitions - 🧠ANSWER ✔✔partitions are created as needed to fit
the programs waiting to be loaded
Expert Verified | Ace the Test
Abstract data type - 🧠ANSWER ✔✔A data type whose properties (data and
operations) are specified independently of any particular implementation
LIFO - 🧠ANSWER ✔✔last in first out
Composite data type - 🧠ANSWER ✔✔A data type in which a name is given
to a collection of data values
,List - 🧠ANSWER ✔✔"container of items", logical operations that can be
applied are: Add item, Remove item, Get next item, or More items
Container - 🧠ANSWER ✔✔Object's whole role is to hold and manipulate
other objects
Stack - 🧠ANSWER ✔✔An abstract data type in which accesses are made
at only one end (LIFO)
Data structure - 🧠ANSWER ✔✔Implementation of composite data fields in
an abstract data type
Push - 🧠ANSWER ✔✔insert on a stack
Array- based - 🧠ANSWER ✔✔Objects in the container are kept in an array
Pop - 🧠ANSWER ✔✔delete on a stack
Linked-based - 🧠ANSWER ✔✔Objects in the container are not kept
physically together, but each items tells you where to go to get the next one
in the structure
Queue - 🧠ANSWER ✔✔An abstract data type in which items are entered at
one end and removed from the other end (FIFO)
,FIFO - 🧠ANSWER ✔✔first in first out
Multiprogramming - 🧠ANSWER ✔✔the technique of keeping multiple
programs in main memory at the same time
Frame - 🧠ANSWER ✔✔a fixed size portion of main memory that holds a
process page
Batch processing - 🧠ANSWER ✔✔The first operating system was a human
operator who organized various jobs from multiple users into batches of
jobs that needed the same resources
Page - 🧠ANSWER ✔✔a fixed size portion of a process that is stored into a
memory frame
Time sharing - 🧠ANSWER ✔✔allows multiple users to interact with a
computer at the same time
Swap - 🧠ANSWER ✔✔the act of bringing in a page from secondary
memory, which often causes another page to be written back to secondary
memory
Thrashing - 🧠ANSWER ✔✔inefficient processing caused by constant page
swaps
COPYRIGHT©JOSHCLAY 2025/2026. YEAR PUBLISHED 2026. COMPANY REGISTRATION NUMBER: 619652435. TERMS OF USE. PRIVACY
3
STATEMENT. ALL RIGHTS RESERVED
, Single Contiguous Memory Management - 🧠ANSWER ✔✔only 2 programs
in memory- operating system and application program
Process control block - 🧠ANSWER ✔✔a data structure used by the
operating system to manage information about a process
Fixed partitions - 🧠ANSWER ✔✔memory is divided into fixed number of
partitions in which programs can be loaded
Context switch - 🧠ANSWER ✔✔the exchange of register information
First come, first serve - 🧠ANSWER ✔✔processes are moved to the CPU in
the order they arrive in the running state
Shortest job next - 🧠ANSWER ✔✔process with the shortest estimated
running time in the ready state is moved into the running state first
Round robin - 🧠ANSWER ✔✔each process runs for a specified time slice
and moves from the running state to the ready state to wait its turn if not
finished
Dynamic partitions - 🧠ANSWER ✔✔partitions are created as needed to fit
the programs waiting to be loaded
