Answers by minal / GATE Overflow for GATE CSE

1 votes

31

How to evaluate given DAG ?
In this one I am unable to follow in the above node marked as "-" ,it has two edges one upward and one downward for "+" node so then how to proceed with this ?

In this one I am unable to follow in the above node marked as "-" ,it has two edges one upward and one downward for "+" node so then how to proceed with this ?

1.4k views

answered Jan 14, 2016

3 votes

32

referential Integrity

757 views

answered Jan 2, 2016

5 votes

33

Subnetting
I want to have an idea about how the divisions are done.Please explain An Internet Service Provider (ISP) is granted a block of addresses starting with 145.75.0.0/16. The ISP needs to distribute these addresses to three groups of customers as follows: (a) The first group has 128 customers ... 24, 32768 (B) 145.75.159.192/26, 16384 (C) 145.75.159.192/26, 32768 (D) 145.75.191.128/25, 16384

I want to have an idea about how the divisions are done.Please explainAn Internet Service Provider (ISP) is granted a block of addresses starting with145.75.0.0/16. The I...

3.8k views

answered Dec 28, 2015

3 votes

34

Number of candidate keys
A relation $R$ with $5$ attributes $A_1,A_2,A_3,A_4,A_5$. Given the following FDs $A_1\rightarrow A_2$ $A_2A_3\rightarrow A_5$ $A_4A_5\rightarrow A_1$ the number of candidates keys that includes attribute $A_3$ is ________________.

A relation $R$ with $5$ attributes $A_1,A_2,A_3,A_4,A_5$. Given the following FDs $A_1\rightarrow A_2$ $A_2A_3\rightarrow A_5$ $A_...

977 views

answered Dec 27, 2015

33 votes

35

GATE CSE 1995 | Question: 5
A computer installation has $1000k$ of main memory. The jobs arrive and finish in the following sequences. Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 requiring 300k arrives Job 1 finishes Job 4 requiring 120k ... arrives Draw the memory allocation table using Best Fit and First Fit algorithms. Which algorithm performs better for this sequence?

A computer installation has $1000k$ of main memory. The jobs arrive and finish in the following sequences.Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 ...

8.0k views

answered Dec 10, 2015

1 votes

36

huffman coding
we use huffman encoding to encode a b c with frequency fa fb fc.Which of the following code sequence is not possible? code 1={0,10,11} code 2={0,00,1} code 3={10,00,01}

we use huffman encoding to encode a b c with frequency fa fb fc.Which of the following code sequence is not possible?code 1={0,10,11}code 2={0,00,1}code 3={10,00,01}

2.9k views

answered Dec 5, 2015

3 votes

37

toc
$L1$ is a Context free language (CFL), $L2$ is a Deterministic Context free language (DCFL) and , $L = L1 \cap\overline{L2}$ then $L$ is a) Need not be CFL b) not CFL c)DCFL

$L1$ is a Context free language (CFL), $L2$ is a Deterministic Context free language (DCFL)and , $L = L1 \cap\overline{L2}$then $L$ isa) Need not be CFLb) not CFLc)DCFL

758 views

answered Dec 2, 2015

4 votes

38

Memory management
If page fault service time is 50 milli second and memory access time is 100 ns, then what will be EMAT, if the probability of page fault is $p$ ? a) $500000 + 100p$ ns b) $100 + 500000p $ ns c) $10^{-7} - 5 p\times 10^{-2}$ seconds d) $10^{-7} + 49.9p \times 10^{-3}$ seconds

If page fault service time is 50 milli second and memory access time is 100 ns, then what will be EMAT, if the probability of page fault is $p$ ?a) $500000 + 100p$ nsb) ...

1.7k views

answered Nov 11, 2015

90 votes

39

GATE CSE 2014 Set 2 | Question: 31
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while( ... the buffer is empty. The starting value for the semaphore $n$ must be $1$ and not $0$ for deadlock-free operation.

Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1;void producer() { while(true) { produce(); semWait(...

14.3k views

answered Nov 10, 2015

65 votes

40

GATE CSE 2006 | Question: 06, ISRO2009-14
Consider three CPU-intensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $1$ $2$ $3$ $4$

Consider three CPU-intensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are nee...

16.0k views

answered Nov 8, 2015

41 votes

41

GATE CSE 2004 | Question: 48
Consider two processes $P_1$ and $P_2$ accessing the shared variables $X$ and $Y$ protected by two binary semaphores $S_X$ and $S_Y$ respectively, both initialized to 1. $P$ and $V$ denote the usual semaphore operators, where $P$ decrements the semaphore value, and $V$ increments the ... $P(S_X), P(S_X); P(S_Y), P(S_Y)$ $P(S_X), P(S_Y); P(S_X), P(S_Y)$

Consider two processes $P_1$ and $P_2$ accessing the shared variables $X$ and $Y$ protected by two binary semaphores $S_X$ and $S_Y$ respectively, both initialized to 1. ...

11.8k views

answered Nov 8, 2015

17 votes

42

GATE CSE 1991 | Question: 01-xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______

A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______

3.2k views

answered Nov 8, 2015

24 votes

43

GATE CSE 1996 | Question: 1.25
Consider the following floating-point number representation.$\begin{array}{c|c} \begin{array}{cc}31\;\;\hspace{15pt}&\hspace{15pt}24\end{array} & \begin{array}{cc}23\hspace{15pt}&\hspace{15pt}0\end{array} \\\hline \text{Exponent}&\text{Mantissa}\\ \hline \end{array}$The ... to $1$ $0.5$ to $1$ $2^{-23}$ to $0.5$ $0.5$ to $\left(1-2^{-23}\right)$

Consider the following floating-point number representation.$$\begin{array}{c|c}\begin{array}{cc}31\;\;\hspace{15pt}&\hspace{15pt}24\end{array} & \begin{array}{cc}23\hspa...

20.8k views

answered Nov 5, 2015

4 votes

44

GATE CSE 2007 | Question: 48
Which of the following is TRUE about formulae in Conjunctive Normal Form? For any formula, there is a truth assignment for which at least half the clauses evaluate to true. For any formula, there is a truth assignment for which all the clauses ... formula such that for each truth assignment, at most one-fourth of the clauses evaluate to true. None of the above.

Which of the following is TRUE about formulae in Conjunctive Normal Form?For any formula, there is a truth assignment for which at least half the clauses evaluate to true...

15.0k views

answered Nov 5, 2015

74 votes

45

GATE CSE 2006 | Question: 38
Consider a Boolean function $ f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $ i_{1}=\left \langle w_{1}, x_{1}, y_{1},z_{1}\right \rangle $ ... $ wx\overline{y} \overline{z}, xz, w\overline{x}yz$ $ wx\overline{y}, wyz, wxz, \overline{w}xz, x\overline{y}z, xyz$

Consider a Boolean function $ f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors...

21.1k views

answered Nov 4, 2015

50 votes

46

GATE CSE 2004 | Question: 58
A circuit outputs a digit in the form of $4$ bits. $0$ is represented by $0000, 1$ by $0001, \ldots, 9$ by $1001$. A combinational circuit is to be designed which takes these $4$ bits as input and outputs $1$ if the digit $\geq$ $5$, and $0$ otherwise ... $\textsf{NOT}$ gates may be used, what is the minimum number of gates required? $2$ $3$ $4$ $5$

A circuit outputs a digit in the form of $4$ bits. $0$ is represented by $0000, 1$ by $0001, \ldots, 9$ by $1001$. A combinational circuit is to be designed which takes t...

12.0k views

answered Nov 3, 2015

0 votes

47

process
If a process on the system could issue an I/O request then the process will be placed on which of the following ? a)Ready State b) Running state c) ready queue d) I/o queue

If a process on the system could issue an I/O request then the process will be placed on which of the following ?a)Ready Stateb) Running statec) ready queued) I/o queue

1.4k views

answered Oct 17, 2015

0 votes

48

DBMS SQL query (3)

661 views

answered Oct 16, 2015

5 votes

49

How many subgraphs with at least one vertex does K3 have?

14.3k views

answered Oct 9, 2015

5 votes

50

How many of $16$ boolean functions in $2$ variables $x$ and $y$ can be represented using only
How many of $16$ boolean functions in $2$ variables $x$ and $y$ can be represented using only the given set of operators, variables $x$ and $y$ ,and values $0$ and $1$? a) $\{\, \sim \,\}$ b) $\{\, \cdot \,\}$ c) $\{\, + \,\}$ d) $\{\, \cdot \,,\, + \,\}$

How many of $16$ boolean functions in $2$ variables $x$ and $y$ can be represented using only the given set of operators, variables $x$ and $y$ ,and values $0$ and $1$?a)...

1.5k views

answered Oct 7, 2015

26 votes

51

TIFR CSE 2010 | Part A | Question: 7
The limit of $\dfrac{10^{n}}{n!}$ as $n \to \infty$ is. $0$ $1$ $e$ $10$ $\infty$

The limit of $\dfrac{10^{n}}{n!}$ as $n \to \infty$ is.$0$$1$$e$$10$$\infty$

3.4k views

answered Oct 2, 2015

2 votes

52

ISRO2011-69
Lightweight Directory Access protocol is used for Routing the packets Authentication obtaining IP address domain name resolving

Lightweight Directory Access protocol is used forRouting the packetsAuthenticationobtaining IP addressdomain name resolving

2.6k views

answered Oct 1, 2015

2 votes

53

Galvin Eighth Edition
Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also ... . Describe the CPU utilization for a round-robin scheduler when: The time quantum is 1 millisecond The time quantum is 10 milliseconds

Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing a...

8.7k views

answered Oct 1, 2015

2 votes

54

GATE CSE 2005 | Question: 36
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n-1)k + 1$ $n(k-1) +1$ $n(k-1)$

In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is:$nk$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...

23.1k views

answered Sep 14, 2015

34 votes

55

GATE CSE 2004 | Question: 2,ISRO2017-54
Consider the following function void swap(int a, int b) { int temp; temp = a; a = b; b = temp; } In order to exchange the values of two variables $x$ and $y$. call $swap(x, y)$ call $swap(\&x, \&y)$ $swap (x, y)$ cannot be used as it does not return any value $swap (x, y)$ cannot be used as the parameters are passed by value

Consider the following functionvoid swap(int a, int b) { int temp; temp = a; a = b; b = temp; }In order to exchange the values of two variables $x$ and $y$.call $swap(x, ...

14.7k views

answered Sep 13, 2015

29 votes

56

GATE CSE 2002 | Question: 11
The following recursive function in C is a solution to the Towers of Hanoi problem. void move(int n, char A, char B, char C) { if (......................) { move (.............................); printf("Move disk %d from pole %c to pole %c\n", n, A, C); move (.....................); } } Fill in the dotted parts of the solution.

The following recursive function in C is a solution to the Towers of Hanoi problem.void move(int n, char A, char B, char C) { if (......................) { move (...........

3.3k views

answered Sep 7, 2015

3 votes

57

Prim's Algorithm
Which one of following statement is false about prim's algorithm? a) It use a running time of O(Elog2V) using binary heap b) It may use a binomial max-heap to represent the priority queue. c) A fibonacci heap imlementation require O(E+V log2V) d) Initially all keys of nodes in priority queue are set to infinity . The root's key is set to 0.

Which one of following statement is false about prim's algorithm?a) It use a running time of O(Elog2V) using binary heapb) It may use a binomial max-heap to represent the...

2.1k views

answered Aug 20, 2015

1 votes

58

How to solve the below question of Directed graph ?
Let $G (V, E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is sequence of vertices $(v_i, v_{i+1}, \ldots, v_j)$ such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ through $j - 1$. (A ... , then every simple path from $j$ to $k$ contain most $A[j, k]$ edges. I am confused between option C and D , answer given is D .

Let $G (V, E)$ be a directed graph with $n$ vertices.A path from $v_i$ to $v_j$ in $G$ is sequence of vertices $(v_i, v_{i+1}, \ldots, v_j)$ such that $(v_k, v_{k+1}) \in...

625 views

answered Aug 19, 2015

3 votes

59

Which of the following changes to typical QuickSort improves its performance on average and are generally done in practice ?

1) Randomly picking up to make worst case less likely to occur. 2) Calling insertion sort for small sized arrays to reduce recursive calls. 3) QuickSort is tail recursive...

3.1k views

answered Aug 18, 2015

119 votes

60

GATE CSE 2005 | Question: 73
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each packet contains a header of $3$ bytes, then the optimum packet size is: $4$ $6$ $7$ $9$

In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each...

42.7k views

answered Aug 13, 2015

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