A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at… Read More

Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statically linked libraries ? (A) Smaller sizes… Read More

Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed to… Read More

Assume the following C variable declarationTake a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many… Read More

The following program fragment is written in a programming language that allows variables and does not allow nested declarations of functions.Attention reader! Don’t stop learning… Read More

Given an array and a number k where k is smaller than the size of the array, we need to find the k’th smallest… Read More

What is an inversion? Given an array arr[], a pair arr[i] and arr[j] forms an inversion if arr[i] < arr[j] and i > j. For… Read More

The following resolution rule is used in logic programming. Derive clause (P ∨ Q) from clauses (P ∨ R), (Q ∨ ¬R) Which of the… Read More

Consider the following logic program P A(x) <- B(x, y), C(y) <- B(x,x) Which of the following first order sentences is equivalent to P? (A)… Read More

Let G (V, E) be a directed graph with n vertices. A path from vi to vj in G is sequence of vertices (vi, vi+1,… Read More

The following are the starting and ending times of activities A, B, C, D, E, F, G and H respectively in chronological order: “asbscsaedsceesfsbedegseefehsgehe” Here, xs… Read More

What is the weight of a minimum spanning tree of the following graph ? (A) 29 (B) 31 (C) 38 (D) 41 Answer: (B) Explanation:… Read More

Let G = (V, E) be an undirected graph with a subgraph G1 = (V1, El). Weights are assigned to edges of G as follows… Read More

The cube root of a natural number n is defined as the largest natural number m such that m3 ≤ n. The complexity of computing… Read More