Tag Archives: GATE CS 1997

Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and… Read More
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the… Read More
A program P reads and processes 1000 consecutive records from a sequential file F stored on device D without using any file system facilities. Given… Read More
A concurrent system consists of 3 processes using a shared resource R in a non-preemptible and mutually exclusive manner. The processes have unique priorities in… Read More
Following floating point number format is given f is a fraction represented by a 6-bit mantissa (includes sign bit) in sign magnitude form e is… Read More
Let f = (w’+y)(x’+y)(w+x’+z)(w’+z)(x’+z) a). Express f as the minimal sum of products. Write only the answer. b). If the output line is stuck at… Read More
Following is a state table for some finite state machine. A). Find the equivalence partition on the states of the machine. B). Give the state… Read More
Consider the following program fragment in Pascal: Program Main; var X : integer; procedure A: var Y : integer; procedure B: var Z : integer;… Read More
The language L, defined by the following grammar allows use of real or integer data in expressions and assignment statements. (assign-stmt):: = (LHS):= (E) (E)… Read More
A language L is a subset of Pascal with the following constructs: a). Expressions involving the operators ‘+’ and ‘<‘ only b). Assignment statements c).… Read More
Given that L is a language accepted by a finite state machine, show that LP and LR are also accepted by some finite state machines,… Read More
Construct a finite state machine with minimum number of states, accepting all strings over {a, b} such that the number of a‘s is divisible by… Read More
A B+ tree of order d is a tree in which each internal node has between d and 2d key values. An internal node with… Read More
Consider the following piece of ‘C’ code fragment that removes duplicates from an ordered list of integers. Node *remove-duplicates(Node *head, int *j) { Node *t1,… Read More
An array A contains n≥1 positive integers in the locations A[1], A[2],… A[n]. The following program fragment prints the length of a shortest sequence of… Read More