Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
chauhansunil20th
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by chauhansunil20th
0
votes
1
UPPCL AE 2018:47
How many Boolean functions in one variable are $\text{NOT}$ idempotent: i.e. they do not satisfy $\forall a.f(f(a)) = f(a).$ $4$ Infinite $1$ $0$
How many Boolean functions in one variable are $\text{NOT}$ idempotent: i.e. they do not satisfy $\forall a.f(f(a)) = f(a).$$4$Infinite$1$$0$
373
views
answered
Mar 5, 2019
Digital Logic
uppcl2018
digital-logic
boolean-algebra
+
–
4
votes
2
Cache Organization
Can any one help me out with this question : This was asked in MadeEasy CBT held on 23rd jan
Can any one help me out with this question :This was asked in MadeEasy CBT held on 23rd jan
985
views
answered
Jan 28, 2019
CO and Architecture
cache-memory
co-and-architecture
effective-memory-access
+
–
1
votes
3
A system uses Selective-Repeat protocol.(Applied gate mock - 3)
A system uses Selective-Repeat protocol with a window size of 4.If each packet carries 5000 bits of data, then the time taken to transfer 5 million bits of data, if the distance between sender and receiver is 2500 Km, the propagation speed ... .25s I think answer should be around 7.5 to 7.8.. Can any one explain what the answer is ??
A system uses Selective-Repeat protocol with a window size of 4.If each packet carries 5000 bits of data, then the time taken to transfer 5 million bits of data, if the d...
2.6k
views
answered
Jan 16, 2019
3
votes
4
Test by Bikram | Mock GATE | Test 2 | Question: 41
A $DMA$ module is transferring bytes to memory using cycle stealing mode from a device transmitting at $16 KB/s$. The processor is fetching instructions at the rate of $1 MB/s$. The percentage by which the processor will be slowed down due to the $DMA$ activity is ______.
A $DMA$ module is transferring bytes to memory using cycle stealing mode from a device transmitting at $16 KB/s$. The processor is fetching instructions at the rate of $1...
850
views
answered
Jan 7, 2019
GATE
tbb-mockgate-2
numerical-answers
co-and-architecture
dma
+
–
7
votes
5
GATE Overflow | Mock GATE | Test 1 | Question: 44
For two data sets, each of size $5$, the variances are given to be $4$ and $5$ and the corresponding means are given to be $2$ and $4$ respectively. The variance of the combined data is? $11/2$ $6$ $13/2$ $5/2$
For two data sets, each of size $5$, the variances are given to be $4$ and $5$ and the corresponding means are given to be $2$ and $4$ respectively. The variance of the c...
946
views
answered
Jan 4, 2019
Probability
go-mockgate-1
quantitative-aptitude
statistics
variance
probability
+
–
0
votes
6
GATE Overflow | Mock GATE | Test 1 | Question: 45
Consider the following modified Heapify and Build_heap procedure. void Heapify(int* A, int i, int n) { int left=2*i+1; int right=2*i+2; int mid=i; if (left<=n && right <=n) { if ((A[left] > A[right] && A[left]< A[i]) || A[left]<A[right] & ... $6 \: 8 \: 1 \: 9 \: 4$ $9 \: 6 \: 1 \: 8 \: 4$ $6 \: 9 \: 1 \: 8 \: 4$
Consider the following modified Heapify and Build_heap procedure.void Heapify(int* A, int i, int n) { int left=2*i+1; int right=2*i+2; int mid=i; if (left<=n && right...
1.0k
views
answered
Jan 4, 2019
Algorithms
go-mockgate-1
algorithms
data-structures
binary-heap
+
–
0
votes
7
GATE Overflow | Mock GATE | Test 1 | Question: 12
Consider a parent process $P$ that has forked a child process $C$. $C$ has again forked another child process $D$. Now $P$ terminates while $C$ and $D$ are still running. In this case, which of the following statements ... process, until adopted by the parent process of $P$ $P$ immediately becomes an orphan process, until adopted by its parent
Consider a parent process $P$ that has forked a child process $C$. $C$ has again forked another child process $D$. Now $P$ terminates while $C$ and $D$ are still running....
3.4k
views
answered
Jan 4, 2019
Operating System
go-mockgate-1
operating-system
process-and-threads
fork-system-call
+
–
1
votes
8
GATE Overflow | Mock GATE | Test 1 | Question: 27
A single query in DBMS can be executed through different algorithms or re-written in different forms and structures. The most optimal pathway of getting the correct output among all these algorithms can be obtained by the process of ... columnB >3000 and columnC<3000; select columnA from Employee; The given query is already in optimized form.
A single query in DBMS can be executed through different algorithms or re-written in different forms and structures. The most optimal pathway of getting the correct outpu...
1.4k
views
answered
Jan 4, 2019
Databases
go-mockgate-1
sql
databases
+
–
3
votes
9
GATE Overflow | Mock GATE | Test 1 | Question: 49
Consider the following two relational schemas: MovieExec(name, address, cert, netWorth) Studio(name, address, presC) Suppose we wish to require that one must have a net worth of at least $1000000$ Rupees to be president of a movie studio. The join operation if ... P, Q and S P, Q and R Q and R P and S
Consider the following two relational schemas:MovieExec(name, address, cert, netWorth)Studio(name, address, presC)Suppose we wish to require that one must have a net wort...
778
views
answered
Jan 4, 2019
Databases
go-mockgate-1
relational-algebra
databases
+
–
3
votes
10
GATE Overflow | Mock GATE | Test 1 | Question: 56
Consider the following language $L$: $L=\{<M,x,k> \mid M \text{ is a Turing Machine and M does not halt on x within k steps} \}$ The language family to which $L$ belongs is not closed under? Intersection Homomorphism Set Difference Complementation
Consider the following language $L$:$L=\{<M,x,k \mid M \text{ is a Turing Machine and M does not halt on x within k steps} \}$The language family to which $L$ belongs is ...
1.6k
views
answered
Jan 4, 2019
Theory of Computation
go-mockgate-1
recursive-and-recursively-enumerable-languages
theory-of-computation
turing-machine
closure-property
+
–
5
votes
11
GATE Overflow | Mock GATE | Test 1 | Question: 57
Which of the following statements on Viable Prefixes is incorrect? A viable prefix does not extend past the right end of the handle For any context-free grammar, the set of viable prefixes is a regular language A viable prefix by default is a suffix of the handle As long as a parser has viable prefixes on the stack no parsing error has been detected
Which of the following statements on Viable Prefixes is incorrect?A viable prefix does not extend past the right end of the handleFor any context-free grammar, the set of...
1.5k
views
answered
Jan 4, 2019
Compiler Design
go-mockgate-1
lr-parser
compiler-design
parsing
viable-prefix
+
–
11
votes
12
GATE Overflow | Mock GATE | Test 1 | Question: 58
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$ The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the value $Q \% P$ where $'\%'$ denotes the modulo operator?
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the v...
1.8k
views
answered
Jan 4, 2019
Digital Logic
go-mockgate-1
numerical-answers
k-map
prime-implicants
digital-logic
+
–
3
votes
13
GATE Overflow | Mock GATE | Test 1 | Question: 60
A program runs in $20s$ in machine A with a clock speed of $200MHz$. A computer architecture wants to build a machine B which will run this program in $6$ seconds. The architect has delivered that a substantial increase in clock rate is ... clock cycles as machine A for this program. What clock rate should be targeted for a best design? (In $MHz$)
A program runs in $20s$ in machine A with a clock speed of $200MHz$. A computer architecture wants to build a machine B which will run this program in $6$ seconds. The a...
1.0k
views
answered
Jan 4, 2019
CO and Architecture
go-mockgate-1
numerical-answers
clock-cycles
clock-frequency
co-and-architecture
+
–
7
votes
14
GATE Overflow | Mock GATE | Test 1 | Question: 61
A $5$ stage pipeliine is used to overlap all the instructions except the branch instructions. The target of the branch can't be fetched till the current instruction is completed. What is the Throughput (in MIPS) of the system if $20\%$ of the ... The pipeline clock rate is $0.1 \: GHz$. Branch penalty is $4$ cycles. (Upto $2$ decimal place).
A $5$ stage pipeliine is used to overlap all the instructions except the branch instructions. The target of the branch can't be fetched till the current instruction is co...
1.0k
views
answered
Jan 4, 2019
CO and Architecture
go-mockgate-1
numerical-answers
pipelining
co-and-architecture
+
–
4
votes
15
GATE Overflow | Mock GATE | Test 1 | Question: 62
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is? $\text{Insertion sort, } O(\log ^2 n)$ $\text{Merge sort, } \Theta (( \log n) \log (\log n ))$ $\text{Heap sort, } \Theta ( \log ^2)(\log n ))$ $\text{Quick sort, } O ( \log 2)(\log n ))$
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is?$\text{Inse...
1.5k
views
answered
Jan 4, 2019
Algorithms
go-mockgate-1
data-structures
linked-list
sorting
algorithms
+
–
4
votes
16
GATE Overflow | Mock GATE | Test 1 | Question: 63
A system is having user processes $P_1, P_2, \dots , P_N$ each requiring $Q_N, Q_{N-1}, \dots , Q_1$ number of resource instances of resource $R$. The minimum number of resource instances of $R$ to guarantee that deadlock will not occur is $NQ_N - N+1$ $NQ_1 + N-1$ $(Q_1 + Q_2 + … + Q_N) + N – 1$ $(Q_1 + Q_2 + … + Q_N) + 1 – N$
A system is having user processes $P_1, P_2, \dots , P_N$ each requiring $Q_N, Q_{N-1}, \dots , Q_1$ number of resource instances of resource $R$. The minimum number of r...
681
views
answered
Jan 4, 2019
Operating System
go-mockgate-1
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
+
–
8
votes
17
GATE Overflow | Mock GATE | Test 1 | Question: 64
Consider the $2$ dimensional array $A$: int A[][]=new int[100][100]; where $A[0][0]$ is at location $800$ in a paged memory system with pages of size $800 bytes$. Each int type needs 4 bytes and A is stored in row-major order. A small process that ... other $2$ are initially empty? for (int i=0;i<100;i++) for (int j=0;j<100; j++) A[j][i]=1;
Consider the $2$ dimensional array $A$:int A[][]=new int[100][100];where $A[0][0]$ is at location $800$ in a paged memory system with pages of size $800 bytes$. Each int ...
1.2k
views
answered
Jan 4, 2019
Operating System
go-mockgate-1
numerical-answers
page-fault
operating-system
co-and-architecture
cache-memory
+
–
3
votes
18
GATE Overflow | Mock GATE | Test 1 | Question: 22
Which of the following is TRUE with respect to Diffie-Hellman Key exchange algorithm? It can be used for encryption or decryption purpose It doesn't suffer from man in the middle attack It suffers from bucket brigade attack It is an example of private key cryptography algorithm
Which of the following is TRUE with respect to Diffie-Hellman Key exchange algorithm?It can be used for encryption or decryption purposeIt doesn't suffer from man in the ...
2.2k
views
answered
Jan 3, 2019
Computer Networks
go-mockgate-1
computer-networks
network-security
+
–
6
votes
19
GATE Overflow | Mock GATE | Test 1 | Question: 14
Let $S(x,y,z)$ and $C(x,y,z)$ represents the Sum & Carry function of a full adder circuit. Which of the following options best represents $S(x,y,z)$ and $C(x,y,z)$ respectively? $x \oplus y \oplus z, y( x \oplus z)+xy$ $x \oplus y \oplus z, y(x+y+z)$ $x \odot y \odot z, z(x+y)+xy$ $\text{None of these}$
Let $S(x,y,z)$ and $C(x,y,z)$ represents the Sum & Carry function of a full adder circuit. Which of the following options best represents $S(x,y,z)$ and $C(x,y,z)$ respec...
1.4k
views
answered
Jan 3, 2019
Digital Logic
go-mockgate-1
digital-logic
adder
digital-circuits
+
–
6
votes
20
GATE Overflow | Mock GATE | Test 1 | Question: 5
A book contains $100$ pages. A page is chosen at random. What is the chance that the sum of the digits on the page is equal to $8$? $0.08$ $0.09$ $0.90$ $0.10$
A book contains $100$ pages. A page is chosen at random. What is the chance that the sum of the digits on the page is equal to $8$?$0.08$$0.09$$0.90$$0.10$
3.2k
views
answered
Jan 3, 2019
Quantitative Aptitude
go-mockgate-1
engineering-mathematics
probability
quantitative-aptitude
+
–
3
votes
21
Test by Bikram | Mock GATE | Test 1 | Question: 63
Identify the pair of words which has a relationship similar to “Wheat : Chaff” Wine: Dregs Crop: Corn Laughter: Revelry Cloud: Rain
Identify the pair of words which has a relationship similar to “Wheat : Chaff”Wine: DregsCrop: CornLaughter: RevelryCloud: Rain
471
views
answered
Dec 27, 2018
GATE
tbb-mockgate-1
word-pairs
verbal-aptitude
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register