search
Log In
Not in Current GATE syllabus

Recent questions tagged out-of-syllabus-now

0 votes
0 answers
1
Token ring is operating at 4Mbps and has a token holding time of 10. Milli seconds what is the longest frame that can be sent on this ring ?
asked Dec 26, 2016 in Computer Networks Bharani Viswas 380 views
0 votes
0 answers
2
If $x \| \underline{x} \| \infty = 1< i^{max} < n \: \: max \: \: ( \mid x1 \mid ) $ for the vector $\underline{x} = (x1, x2 \dots x_n)$ ... using a known property of this norm. Although this norm is very easy to calculate for any matrix, explain why the condition number is difficult (i.e. expensive) to calculate.
asked Dec 20, 2016 in Linear Algebra jothee 219 views
0 votes
1 answer
3
Translate the executable statements of the following Pascal Program into quadruples. Assume that integer and real values require four words each. repeat flag[i]:=true; while turn !=i do begin while flag[j] do skip turn:=i; end critical section flag[i]:=false; until false Program Test; var i:integer; a: array [1...10] of real; begin i:=0; While i:<=10 do begin a[i]:=0; i:=i+1 end; end.
asked Dec 19, 2016 in Compiler Design jothee 423 views
0 votes
0 answers
4
Consider the following Ada program: Procedure P is BAD-FORMAT: exception Procedure Q is begin ... if S/='b' then raise BAD-FORMAT end if; ... end Q; Procedure R is begin Q; exception when BAD-Format => ... handler body 1 end R; begin R; Q; exception when BAD-FORMAT => ... handler body 2 end P; Under what conditions are the two handler bodies 1 and 2 executed?
asked Dec 19, 2016 in Programming jothee 176 views
0 votes
0 answers
5
Write a LISP function to compute the product of all the numbers in a list. Assume that the list contains only number.
asked Dec 19, 2016 in Programming jothee 145 views
0 votes
0 answers
6
Which of the following features are available in Ada? procedures, monitors, packages, common statement, goto statement, generic unit tasks, backtracking, recursion, exceptions, pragmas, classes.
asked Dec 19, 2016 in Programming jothee 140 views
0 votes
0 answers
7
Consider a database with the following three relations: CREDITS (STUDENT; COURSE) OFFERS (TEACHER; COURSE) BELONGS (TEACHER; DEPARTMENT) Given below is a code in query language QUEL. Describe in one English sentence the query posed by the given QUEL program. range of s is CREDITS range of t ... is LIST1 range of e2 is LIST2 range of e3 is LIST3 retrieve(E1.I) where e1.I=e2.I and where e1.I=e3.I
asked Dec 15, 2016 in Databases makhdoom ghaya 232 views
1 vote
0 answers
8
If the transportation problem is solved using some version of the simplex algorithm, under what condition will the solution always have integer values?
asked Dec 11, 2016 in Others jothee 154 views
0 votes
0 answers
9
An 8085-based microcomputer consisting of 16 kbytes of ROM, 16kbytes of RAM and four 8-bit I/O ports is to be designed using RAM and ROM chips each of 2 kbytes capacity. The chip to be used for I/O ports realization consists of two 8-bit ports and requires four ... in the memory address space. The I/O locations are to occupy lower order I/O address space. Give memory map and I/O address map.
asked Dec 1, 2016 in CO and Architecture makhdoom ghaya 161 views
0 votes
0 answers
10
Provide short answers to the following questions: Consider the following sequence of UNIX commands: grep main a.c b.c c.c > grepout & wc < grepout & rm grepout & Why is this not equivalent to the following? grep main a.c.b.c c.c | wc
asked Dec 1, 2016 in Operating System makhdoom ghaya 206 views
4 votes
1 answer
11
Match the pairs in the following questions: (a) Small talk (p) Logic programming (b) LISP (q) Data flow programming (c) Prolog (r) Functional programming (d) VAL (s) Object-oriented programming ...
asked Nov 19, 2016 in Programming makhdoom ghaya 1.1k views
3 votes
3 answers
13
In case of a DVD, the speed of data transfer is mentioned in multiples of? 150 KB/s 1.38 MB/s 300 KB/s 2.40 MB/s
asked May 2, 2016 in Operating System makhdoom ghaya 2.5k views
15 votes
3 answers
14
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d ... this code segment without any spill to memory? Do not apply any optimization other than optimizing register allocation. 3 4 5 6
asked Apr 21, 2016 in Compiler Design jothee 3.3k views
1 vote
1 answer
15
In which file the compiler manage the various objects, which are used in windows programming ? (A) Control File (B) Binary File (C) Text File (D) Obj File
asked Apr 19, 2016 in Compiler Design Sanjay Sharma 848 views
2 votes
2 answers
16
How many 256 X 4 RAM chips are required to organize a memory of capacity 32KB ? What is the size of decoder required in this implementation to select a row of chip? Options : (a) 128 , 7 X 128 (b) 256 , 7 X 128 (c) 512 , 7 X 128 (d) 256 , 8 X 256.
asked Mar 14, 2016 in CO and Architecture Jitendra Verma 5.1k views
0 votes
2 answers
17
A computer with 32-bit wide data bus uses 4 K x 8 static RAM memory chips. The smallest memory this computer can have is: (a) 32 kb (b) 16 kb (c) 8 kb (d) 24 kb
asked Jan 12, 2016 in CO and Architecture spawndon 1.6k views
0 votes
0 answers
18
Find Number Of Lexeme And Tokens in the Below FORTRAN Code. [ ignore the white spaces only ] ( pls also explain me what do the code mean ) DO 10 I = 100 DO 10 I=10,1 DO 10 I = 10.1
asked Jan 11, 2016 in Compiler Design pC 842 views
4 votes
1 answer
19
3 votes
2 answers
20
The arithmetic expression $(a+b) * c- d/e ** l$ is to be evaluated on a two address machine, where each operand is either a register or a memory location. With a minimum number of memory accesses of operands.the number of registers required to evaluate this expression is ______. The number of memory accesses of operands is ____________
asked Nov 14, 2015 in Compiler Design ibia 761 views
0 votes
0 answers
21
0 votes
1 answer
22
System having 8 MB of video memory for bit mapped graphics with 64 bit color what is max resolution can support
asked Oct 7, 2015 in Operating System monali 1k views
22 votes
5 answers
23
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
asked Feb 14, 2015 in Graph Theory makhdoom ghaya 9k views
9 votes
3 answers
24
Consider the following C program segment. while (first <= last) { if (array[middle] < search) first = middle + 1; else if (array[middle] == search) found = TRUE; else last = middle - 1; middle = (first + last)/2; } if (first > last) notpresent = TRUE; The cyclomatic complexity of the program segment is_______________.
asked Feb 13, 2015 in IS&Software Engineering makhdoom ghaya 4.7k views
31 votes
5 answers
25
Consider the intermediate code given below. (1) i=1 (2) j=1 (3) t1 = 5 * i (4) t2 = t1 + j (5) t3 = 4 * t2 (6) t4 = t3 (7) a[t4] = -1 (8) j = j + 1 (9) if j <= 5 goto (3) (10) i = i +1 (11) if i < 5 goto (2) The number of nodes and edges in control-flow-graph constructed for the above code, respectively, are 5 and 7 6 and 7 5 and 5 7 and 8
asked Feb 12, 2015 in Compiler Design jothee 12.9k views
21 votes
3 answers
26
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.
asked Feb 12, 2015 in Graph Theory jothee 4.5k views
14 votes
2 answers
27
Consider two decision problems $Q_1, Q_2$ such that $Q_1$ reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to $Q_2$. Then which one of the following is consistent with the above statement? $Q_1$ is in NP, $Q_2$ is NP hard. $Q_2$ is in NP, $Q_1$ is NP hard. Both $Q_1$ and $Q_2$ are in NP. Both $Q_1$ and $Q_2$ are in NP hard.
asked Feb 12, 2015 in Theory of Computation jothee 3k views
5 votes
1 answer
28
How many labelled sub-graphs of $K_n$ are isomorphic to $W_{n-1}$? (Where $K_n$ : Complete graph with $n$ vertices , $W_n$ : Wheel graph with $ n+1$ vertices) 1.$\frac{(n-1)!}{2}$ 2. $\frac{(n-2)!}{2}$ 3. $\frac{n!}{2(n-1)}$ 4. $\frac{n!}{2(n-1)^2}$
asked Feb 1, 2015 in Graph Theory Vikrant Singh 315 views
3 votes
2 answers
30
If G is a planar graph with 35 regions each of degree 6 the no of vertices are a) 70 b) 80 c) 72 d) 62 What does degree of a region specify here?
asked Nov 30, 2014 in Graph Theory dhingrak 1.5k views
...