Skip to content

Tag Archives: GATE CS 1997

A binary search tree contains the values 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the values are… Read More
A polynomial p(x) is such that p(0) =5, p(1) =4, p(2) =9 and p(3) =20. The minimum degree it can have is (A) 1 (B)… Read More
Using the forward Eular method to solve y”(t) = f(t), y'(0) = 0 with a step size of h, we obtain the following values of y in… Read More
Let A= (aij) be an n-rowed square matrix and I12 be the matrix obtained by interchanging the first and second rows of the n-rowed Identify… Read More
What is the maximum value of the function f(x) = 2x2-2x+6 in the interval [0,2] ? (A) 6 (B) 10 (C) 12 (D) 5.5 Answer:… Read More
Dirty bit for a page in a page table (A) helps avoid unnecessary writes on a paging device (B) helps maintain LRU information (C) allows… Read More
Thrashing (A) reduces page I/O (B) decreases the degree of multiprogramming (C) implies excessive page I/O (D) improves the system performance Answer: (C) Explanation: Please… Read More
When an interrupt occurs, an operating system (A) ignores the interrupt (B) always changes state of interrupted process to ‘blocked’ and schedules another process (C)… Read More
I/O redirection (A) implies changing the name of a file (B) can be employed to use an existing file as input file for a program… Read More
The correct matching for the following pairs is (A) Disk Scheduling (1) Round robin (B) Batch Processing (2) SCAN (C) Time sharing (3) LIFO (D)… Read More
Locality of reference implies that the page reference being made by a process (A) will always be to the page used in the previous page… Read More
Given ∑ = {a, b}, which of the following sets is not countable ? (A) Set of all strings over ∑ (B) Set of all languages over… Read More
In a lattice defined by the Hasse diagram given in figure 3.3, how many complements does the element ‘e’ have?          … Read More
Which of the following propositions is a tautology? (A) (p ∨ q) → p (B) p ∨ (q → p) (C) p ∨ (p → q) (D) p →… Read More
Let (Z, *) be an algebraic structure where Z is the set of integers and the operation ∗ is defined by n ∗ m = max(n… Read More

Start Your Coding Journey Now!