Advanced level 2024 CASPA mock computer science 1
Advanced level 2024 CASPA mock computer science 1
Which of the following is not a form of memory ?
A. Instruction cache
B. Instruction register
C. Instruction opcode
D. Both (A) and (B)
2. The minimum time delay required between initiation of
two successive memory operations is called
3. Disadvantage of dynamic RAM over static RAM is
A. Higher power consumption
B. Variable speed
C. Need to refresh the capacitor charge every
once in two milliseconds
D. Lower Packing density
4. Which of the following is/are advantages of virtual
memory ?
A. Faster access to memory on an average.
B. Processes can be given protected address
spaces.
C. Programms larger than the physical memory
size can be run.
D. All of these
5. What is the correct sequence of time delays that happen
during a data transfer from a disk to memory?
A. Seek time, access time, transfer time
B. Seek time, latency time, transfer time
C. Access time ,Latency time, transfer time
D. Latency time, access time, transfer time
6. A mathematical-model with a collection of operations
defined on that model is called
A. Data Structure
B. Abstract Data Type
C. Primitive Data Type
D. Algorithm
7. Representation of data structure in memory is known
as:
A. Recursive
B. Abstract data type
C. Storage structure
D. File structure
8. Six files Fl, F2, F3, F4, F5 and F6 have 100,200,50,80,
120, 150 number of records respectively. In what order
should they be stored so as to optimize access time?
Assume each file is accessed with the same frequency.
A. F3, F4, FI, F5, F6, F2
B. F2, F6, F5, Fl, F4, F3
C. Fl, F2, F3, F4, F5, F6
D. Ordering is immaterial as all files are
accessed with the same frequency
9. The concept of order (Big O) is important because
A. it can be used to decide the best algorithm
that solves a given problem
B. it determines the maximum size of a problem
that can be solved in a given system, in a
given amount of time
C. Both(a) and (b)
D. none of the above
10. Which of the following algorithm design technique is
used in the quick sort algorithm?
A. Dynamic programming
B. Backtracking
C. Divide and conquer
D. Greedy method
11. A________search begins the search with the element
that is located in the middle of the array.
