Register
Filter

Questions by snaily16

0 votes
0 answers
2
MadeEasy Subject Test 2019: Digital Logic - Digital Counter
Consider the circuit given below. Assume initially flipflops are in reset state. What will be the mod of above digital circuit?
Consider the circuit given below. Assume initially flipflops are in reset state. What will be the mod of above digital circuit?
0 votes
3 answers
3
MadeEasy Full Length Test 2019: Combinatory - Permutations And Combinations
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
0 votes
1 answer
4
MadeEasy Test Series: Discrete Mathematics - Graph Thoery
The number of labelled subgraphs possible for the graph given below.
The number of labelled subgraphs possible for the graph given below.
1 votes
0 answers
5
MadeEasy Subject Test 2019: Operating System - Process Syncronization
Fails to Guarantee mutual exclusion Guarantee mutual exclusion and prevents deadlock Fails to prevent deadlock Fails to guarantee mutual exclusion and fails to prevent deadlock
Fails to Guarantee mutual exclusion Guarantee mutual exclusion and prevents deadlockFails to prevent deadlockFails to guarantee mutual exclusion and fails to prevent dead...
1 votes
1 answer
6
Gateforum Test Series: Operating System - Virtual Memory
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano seconds.
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano sec...
0 votes
2 answers
8
made easy test
Given below are 4 functions $999999n$ $0.99999 n logn$ $1.000001^{n}$ $n^{2}$ The increasing order of the above functions in terms of their asymptotic complexity is?
Given below are 4 functions$999999n$$0.99999 n logn$$1.000001^{n}$$n^{2}$The increasing order of the above functions in terms of their asymptotic complexity is?
0 votes
0 answers
9
Ace Test series
Consider the following cfg S → aSa | bSb | a | b find the number of conflicts in LR(0) state diagram? 2 4 8 10
Consider the following cfgS → aSa | bSb | a | bfind the number of conflicts in LR(0) state diagram?24810