## GATE | GATE CS 1996 | Question 68

Consider the syntax-directed translation schema (SDTS) shown below: E → E + E {print “+”} E → E ∗ E {print “.”} E → id… Read More »

## GATE | GATE CS 1996 | Question 67

Consider the following program in pseudo-pascal syntax. What is printed by the program if parameter a in procedure test1 is passed as i) call-by-reference parameter ii)… Read More »

## GATE | GATE CS 1996 | Question 66

Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is… Read More »

## GATE | GATE CS 1996 | Question 65

Let G be the directed, weighted graph shown in below figure We are interested in the shortest paths from A. (a) Output the sequence of… Read More »

## GATE | GATE CS 1996 | Question 64

A complete, undirected, weighted graph G is given on the vertex {0, 1,…., n−1} for any fixed ‘n’. Draw the minimum spanning tree of G… Read More »

## GATE | GATE CS 1996 | Question 63

Insert the characters of the string K R P C S N Y T J M into a hash table of size 10. Use the… Read More »

## GATE | GATE CS 1996 | Question 62

A two dimensional array A[1…n][1…n] of integers is partially sorted if ∀i, j ∈ [1…n−1], A[i][j] < A[i][j+1] and A[i][j] < A[i+1][j] Fill in the… Read More »

## GATE | GATE CS 1996 | Question 61

Let Q = ( {q1,q2}, {a,b}, {a,b,Z}, δ, Z, ϕ) be a pushdown automaton accepting by empty stack for the language which is the set… Read More »

## GATE | GATE CS 1996 | Question 60

Given below are the transition diagrams for two finite state machine M1 and M2 recognizing languages L1 and L2 respectively.          … Read More »

## GATE | GATE CS 1996 | Question 59

Let G be a context-free grammar where G = ( { S, A, B, C}, { a,b, d}, P, S ) with the productions in… Read More »

## GATE | GATE CS 1996 | Question 58

Let be two matrices such that       Express the elements of D in terms of the elements of B.   Answer: Explanation: Quiz… Read More »

## GATE | GATE CS 1996 | Question 57

The Fibonacci sequence {f1, f2, f3,….., fn} is defined by the following recurrence: fn+2 = fn+1 + fn, n ≥ 1; f2 = 1 : f1 = 1… Read More »

## GATE | GATE CS 1996 | Question 56

Let F be the collection of all functions f: {1, 2,3} → {1, 2, 3}. If f and g ∈ F, define an equivalence relation ~  by… Read More »

## GATE | GATE CS 1996 | Question 55

A demand paged virtual memory system uses 16 bit virtual address, page size of 256 bytes, and has 1 Kbyte of main memory. LRU page… Read More »

## GATE | GATE CS 1996 | Question 54

An 8052 based system has an output port with address 00H. Consider the following assembly language program. ORG 0100H MVI A, 00H LXI H, 0105H… Read More »