Recent activity by sardendu / GATE Overflow for GATE CSE

5 answers

1

MADE EASY TEST-SERIES
Consider R(A,B,C,D,E,F,G) be a relational schema with the following functional dependencies: AC->G, D->EG, BC->D, CG->BD, ACD->B, CE->AG The number of different minimal cover possible are___________?

Consider R(A,B,C,D,E,F,G) be a relational schema with the following functional dependencies:AC->G, D->EG, BC->D, CG->BD, ACD->B, CE->AGThe number of different minimal cov...

5.5k views

commented Oct 23, 2018

1 answer

2

MadeEasy Test Series: Databases - B Tree
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is ... 5 pointer then till 5 element we can insert in one leaf. So answer should be 5+ 19+23 = 47. AM i Right?

The following key values are inserted into B+tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of inter...

473 views

asked Oct 22, 2018

4 answers

3

GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$

A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were crea...

19.7k views

comment edited Oct 5, 2018

1 answer

4

made easy online test
For question like :- Find minimum number of variable required to solve the expression in three address code. (not SSA) Do we need to consider the given variable also? Example:- q + r/3 + s – t * 5 + u * v/w how many variable required?

For question like :-Find minimum number of variable required to solve the expression in three address code. (not SSA)Do we need to consider the given variable also?Exampl...

469 views

commented Oct 1, 2018

11 answers

5

GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used

A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that ord...

28.6k views

commented Sep 30, 2018

4 answers

6

GATE CSE 2017 Set 1 | Question: 12
Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? p1 = a - b q1 = p1 * c p1 = u * v q1 = p1 + q1 p3 = a - b q4 = p3 * c p4 = ... = a - b q1 = p2 * c p3 = u * v q2 = p4 + q3 p1 = a - b q1 = p * c p2 = u * v q2 = p + q

Consider the following intermediate program in three address codep = a - b q = p * c p = u * v q = p + qWhich one of the following corresponds to a static single assignme...

11.6k views

commented Sep 28, 2018

2 answers

7

GATE CSE 2005 | Question: 60
Consider the grammar: $S \rightarrow (S) \mid a$ Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be $n_1, n_2$ and $n_3$ respectively. The following relationship holds good: $n_1 < n_2 < n_3$ $n_1 = n_3 < n_2$ $n_1 = n_2 = n_3$ $n_1 \geq n_3 \geq n_2$

Consider the grammar:$$S \rightarrow (S) \mid a$$Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be $n_1, n_2$ and $n_3$ respectively. The ...

15.4k views

commented Sep 23, 2018

2 answers

8

GATE CSE 2010 | Question: 38
The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1) LR(1) but not LL(1) Both LL(1) and LR(1) Neither LL(1) nor LR(1)

The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1)LR(1) but not LL(1)Both LL(1) and LR(1)Neither LL(1) nor LR(1)

12.9k views

commented Sep 22, 2018

3 answers

9

GATE IT 2006 | Question: 72
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If only the root node does not satisfy the heap property, the algorithm to convert the complete binary tree into a heap has the best asymptotic time complexity of $O (n)$ $O (\log n)$ $O (n \log n)$ $O (n \log \log n)$

An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If only the root node does not satisfy...

7.5k views

commented Sep 11, 2018

4 answers

10

GATE CSE 1994 | Question: 1.21
Which one of the following statements is true? Macro definitions cannot appear within other macro definitions in assembly language programs Overlaying is used to run a program which is longer than the address space of a computer Virtual memory can ... than the address space of a computer It is not possible to write interrupt service routines in a high level language

Which one of the following statements is true?Macro definitions cannot appear within other macro definitions in assembly language programsOverlaying is used to run a prog...

8.5k views

answered Sep 11, 2018

2 answers

11

GATE CSE 1990 | Question: 3-vi
Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.

Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...

16.8k views

commented Sep 3, 2018

6 answers

12

GATE CSE 2009 | Question: 16, ISRO2017-12
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every context-free language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

Which one of the following is FALSE?There is a unique minimal DFA for every regular languageEvery NFA can be converted to an equivalent PDA.Complement of every context-fr...

15.7k views

commented Aug 23, 2018

4 answers

13

GATE IT 2008 | Question: 32
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet $\{a, b\}$ will be accepted by the new DFA? Set of all strings that do not end with $ab$ Set of all strings that begin ... of all strings that do not contain the substring $ab$, The set described by the regular expression $b^*aa^*(ba)^*b^*$

If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet $\{a, b\}$ will be accepted by the new...

8.9k views

commented Aug 16, 2018

6 answers

14

GATE CSE 2017 Set 1 | Question: 38
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}\mid m,n \geq 0 \right \}$. Which of the following are context-free languages? $L_{1} \cup L_{2}$ $L_{1} \cap L_{2}$ I only II only I and II Neither I nor II

Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \le...

13.7k views

commented Aug 6, 2018

2 answers

15

GATE IT 2007 | Question: 48
Consider the grammar given below: $S \rightarrow x \ B \mid y \ A$ $A \rightarrow x \mid x \ S \mid y \ A \ A$ $B \rightarrow y \mid y \ S \mid x \ B \ B$ Consider the following strings. $xxyyx$ $xxyyxy$ $xyxy$ $yxxy$ $yxx$ $xyx$ Which of the above strings are generated by the grammar ? i, ii and iii ii, v and vi ii, iii and iv i, iii and iv

Consider the grammar given below:$S \rightarrow x \ B \mid y \ A$$A \rightarrow x \mid x \ S \mid y \ A \ A$$B \rightarrow y \mid y \ S \mid...

7.5k views

commented Aug 6, 2018

3 answers

16

GATE IT 2008 | Question: 51
Consider the C program given below. What does it print? #include <stdio.h> int main () { int i, j; int a [8] = {1, 2, 3, 4, 5, 6, 7, 8}; for(i = 0; i < 3; i++) { a[i] = a[i] + 1; i++; } i--; for (j = 7; j > 4; j--) { int i = j/2; a[i] = a[i] - 1; } printf ("%d, %d", i, a[i]); } $2, 3$ $2, 4$ $3, 2$ $3, 3$

Consider the C program given below. What does it print?#include <stdio.h int main () { int i, j; int a [8] = {1, 2, 3, 4, 5, 6, 7, 8}; for(i = 0; i < 3; i++) { a[i] = a[i...

15.0k views

commented Jun 22, 2017

2 answers

17

C programming
int i=0; char *a = "abcde\0efgh"; while(a[++i]) printf("%d",*++a - 'a'); the output of the above c code segment?

int i=0; char *a = "abcde\0efgh"; while(a[++i]) printf("%d",*++a - 'a');the output of the above c code segment?

1.1k views

commented Jun 17, 2017

10 answers

18

GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$

A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...

34.2k views

commented Dec 17, 2016

2 answers

19

dout os
While switching context from process A to process B, operating system does not change the address translation table. why is this statement false give explanation

While switching context from process A to process B, operating system does not change the address translation table.why is this statement false give explanation

1.7k views

answered Dec 16, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true