CNIT 176 EXAM 1 TEST PAPER 2026
COMPLETE QUESTIONS SOLUTIONS
VERIFIED ACCURATE GRADED A+
⩥ 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
⩥ 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
COMPLETE QUESTIONS SOLUTIONS
VERIFIED ACCURATE GRADED A+
⩥ 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
⩥ 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
