List of practice Questions

Consider a logical address space of eight pages of 1024 words each, mapped into a physical memory of 32 frames. How many bits are there in the logical address and in the physical address, respectively?

Consider the following set of processes with the length of the CPU burst time given in milliseconds:

The processes are assumed to have arrived in order P1, P2, P3, P4, P5 all at time 0. What is the waiting time of process P4 for Shortest Job First (SJF), non-preemptive priority scheduling, and Round Robin (Quantum=1) scheduling algorithms respectively?

Consider the following statements and choose the correct one:
(A) Job schedulers select processes from the pool and load them into memory for execution.
(B) Short term scheduler selects among the processes that are ready to execute and allocates the CPU to one of them.
(C) Medium term scheduler increases the degree of multiprogramming.
Choose the correct answer from the options given below:

A magnetic disk pack has the following specifications: 16 surfaces, 128 tracks per surface, 256 sectors per track, and 512 bytes per sector. Calculate the capacity of the disk pack.

Cycle stealing mode of DMA operation involves:

Each instruction in an assembly language program has the following fields. What is the correct sequence of these fields?,
(A) Label field
(B) Mnemonic field
(C) Operand field
(D) Comment field
Choose the correct answer from the options given below:

Which of the following in 8085 microprocessor performs HL = HL + HL?

The contents of register BL and register AL of 8085 microprocessor are 49H and 3AH, respectively. The contents of AL, the status of carry flag (CF), and sign flag (SF) after executing the instruction SUB AL, BL are:

Choose the software interrupt from the following list:

The number of wait states required to interface 8279 to 8086 with an 8MHz clock are:

Which is not a requirement of digital signatures:

Rail fence technique is an example of:

In the DES algorithm, the round input is 32 bits, which is expanded to 48 bits via:

The best-known multiple-letter encryption cipher is:

Packet filtering firewalls are deployed on:

Computation of the discrete logarithm is the basis of the cryptographic system:

In which theorem \(a^{p−1} = 1 \) mod p where p is prime and a is a positive integer not divisible by p

Match List I with List II

LIST I	LIST II
(A) Floyd-Warshall algorithm for all pair shortest paths	(I) Divide and Conquer
(B) Prim’s algorithm	(II) Greedy Paradigm
(C) Hamiltonian Circuit	(III) Backtracking
(D) Merge Sort	(IV) Dynamic Programming paradigm

Choose the correct answer from the options given below:

A hash function f defined as f(key) = key mod 7, with linear probing, is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?

The worst-case time complexity of inserting a node in a doubly linked list is:

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst-case running time of this computation is:

Which of the following statement(s) is/are not true?
1. Optimal binary search tree construction can be performed efficiently using dynamic programming.
2. BFS cannot be used to find connected components of a graph.
3. Given the prefix and postfix walks over the binary tree, the binary tree cannot be uniquely constructed.
4. DFS can be used to find connected components of a graph.
Choose the correct answer from the options given below:

Consider the quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists, one of which contains one-fifth of the elements and the remaining elements are contained in the other sub-list. Let T(n) be the number of comparisons required to sort n elements. Then:

Let A be the problem of finding a Hamiltonian cycle in a graph G = (V, E) with |V| divisible by 3, and B be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true?

Consider the given two statements:
S1: Kruskal’s Algorithm might produce a non-minimal spanning tree.
S2: Kruskal’s Algorithm can be efficiently implemented using the disjoint set data structure.
Choose the correct answer from the options given below: