Register
Filter

Recent activity by Overflow04

1 answer
1
Algorithm
Answer ????
Answer ????
0 answers
3
Databases
Please explain option c.
Please explain option c.
0 answers
4
COA
Which of the following is/are true for a CPU which does not have any stack pointer registers? A Interrupts are not possible. B All subroutine calls and interrupts are possible. C It cannot have nested subroutines call. D It cannot have subroutine call instruction.
Which of the following is/are true for a CPU which does not have any stack pointer registers?A Interrupts are not possible. B All subroutine calls and interrupts are po...
1 answer
5
Programming
Someone please explain. Function of ‘^’
Someone please explain. Function of ‘^’
5 answers
6
GATE CSE 2003 | Question: 21
Consider the following graph: Among the following sequences: abeghf abfehg abfhge afghbe Which are the depth-first traversals of the above graph? I, II and IV only I and IV only II, III and IV only I, III and IV only
Consider the following graph: Among the following sequences:abeghfabfehgabfhgeafghbeWhich are the depth-first traversals of the above graph?I, II and IV onlyI and IV only...
1 answer
7
Operating System
When a page is referred for the first time, then it will be counted in page fault or not?. E.g page reference 1,2,3,4,2,1. LRU is used with 3 frames(initially empty).
When a page is referred for the first time, then it will be counted in page fault or not?.E.g page reference 1,2,3,4,2,1.LRU is used with 3 frames(initially empty).
5 answers
8
GATE CSE 2015 Set 3 | Question: 27
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size of a problem that can be solved in $6$ minutes? $256$ $512$ $1024$ $2018$
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size ...
1 answer
9
Programming
Why nothing is printed for %c.
Why nothing is printed for %c.
2 answers
13
GATE CSE 1988 | Question: 10ib
Consider the following grammar: $S \rightarrow S$ $S \rightarrow SS \mid a \mid \epsilon$ Indicate the shift-reduce and reduce-reduce conflict (if any) in the various states of the $\text{LR(0)}$ parser.
Consider the following grammar:$S \rightarrow S$$S \rightarrow SS \mid a \mid \epsilon$Indicate the shift-reduce and reduce-reduce conflict (if any) in the various states...
1 answer
15
Algorithms
What is the logic applied here.
What is the logic applied here.
2 answers
16
GATE IT 2007 | Question: 8
The following circuit implements a two-input AND gate using two $2-1$ multiplexers. What are the values of $X_1, X_2, X_3$? $X_1 = b, X_2 = 0, X_3 = a$ $X_1 = b, X_2 = 1, X_3 = b$ $X_1 = a, X_2 = b, X_3 = 1$ $X_1 = a, X_2 = 0, X_3 = b$
The following circuit implements a two-input AND gate using two $2-1$ multiplexers.What are the values of $X_1, X_2, X_3$?$X_1 = b, X_2 = 0, X_3 = a$$X_1 = b, X_2 = 1, X_...
5 answers
17
GATE CSE 2001 | Question: 2.11
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$. Which of the following is true? $f=X_1'+X_2$ $f=X_1'X_2+X_1X_2'$ $f=X_1X_2+X_1'X_2'$ $f=X_1+X_2'$
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$.Which of the following is true?$f=X_1'+X_2$$f=X_1'X_2+X_1X_2'$$f=X_1X_2+...
0 answers
24
Databases
How to identify many to many relationship. Can R2 be one to one.
How to identify many to many relationship.Can R2 be one to one.
1 answer
25
Databases
In Query1, how mid is projected from did.?????????/
In Query1, how mid is projected from did.?????????/
0 answers
27
Computer Networks
Number of packets readily available in the buffer are 10. 4 bit sequence number is used. The maximum number of outstanding frames are Answer given is: 10
Number of packets readily available in the buffer are 10.4 bit sequence number is used. The maximum number of outstanding frames areAnswer given is: 10
1 answer
28
Computer Networks
I am getting M1 as correct.
I am getting M1 as correct.
1 answer
29
Computer Networks
Since 8 bit delimeter pattern = 01111110. So whenever 0111111( 6’s ones) is matched we will add one extra bit. But in the solution extra bit is added just after 011111(5’s ones).
Since 8 bit delimeter pattern = 01111110. So whenever 0111111( 6’s ones) is matched we will add one extra bit.But in the solution extra bit is added just after 011111...
0 answers
30
Computer Networks
What is the significance of this line(highlighted part): Node D get this flood packet from nodes C, F,B,E in this order. Other things are clear to me.
What is the significance of this line(highlighted part): Node D get this flood packet from nodes C, F,B,E in this order.Other things are clear to me.