Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by pradipbasak
0
votes
1
GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this ...
52.1k
views
answered
Aug 8, 2018
Digital Logic
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
+
–
0
votes
2
GATE CSE 2011 | Question: 36
Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The variables $a, b, c, d,$ and $e$ are initially stored in memory. The binary operators used ... in memory, what is the minimum number of registers needed to evaluate this expression? $2$ $9$ $5$ $3$
Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The ...
15.0k
views
answered
Jul 11, 2018
Compiler Design
gatecse-2011
compiler-design
register-allocation
normal
+
–
–1
votes
3
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...
33.3k
views
answered
Feb 1, 2018
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
0
votes
4
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
32.1k
views
answered
Jan 28, 2018
DS
gatecse-2003
data-structures
binary-heap
+
–
17
votes
5
GATE CSE 2016 Set 2 | Question: GA-06
Among $150$ faculty members in an institute, $55$ are connected with each other through Facebook and $85$ are connected through Whatsapp. $30$ faculty members do not have Facebook or Whatsapp accounts. The numbers of faculty members connected only through Facebook accounts is _______. $35$ $45$ $65$ $90$
Among $150$ faculty members in an institute, $55$ are connected with each other through Facebook and $85$ are connected through Whatsapp. $30$ faculty members do not have...
7.5k
views
answered
Jan 24, 2018
Quantitative Aptitude
gatecse-2016-set2
quantitative-aptitude
venn-diagram
easy
+
–
5
votes
6
GATE CSE 2016 Set 1 | Question: GA06
A shaving set company sells $4$ different types of razors- Elegance, Smooth, Soft and Executive. Elegance sells at $\text{Rs.} \ 48$, Smooth at $\text{Rs.} \ 63$, Soft at $\text{Rs.} \ 78$ ... Which product contributes the greatest fraction to the revenue of the company in that year? Elegance Executive Smooth Soft
A shaving set company sells $4$ different types of razors- Elegance, Smooth, Soft and Executive.Elegance sells at $\text{Rs.} \ 48$, Smooth at $\text{Rs.} \ 63$, Soft at ...
5.4k
views
answered
Jan 24, 2018
Quantitative Aptitude
gatecse-2016-set1
quantitative-aptitude
data-interpretation
easy
+
–
3
votes
7
GATE CSE 2005 | Question: 53
Consider the machine $M$: The language recognized by $M$ is: $\left\{ w \in \{a, b\}^* \text{ | every a in $w$ is followed by exactly two $b$'s} \right\}$ ... $'} \right\}$ $\left\{w \in \{a, b\}^* \text{ | $w$ does not contain $aa$' as a substring} \right\}$
Consider the machine $M$:The language recognized by $M$ is:$\left\{ w \in \{a, b\}^* \text{ | every a in $w$ is followed by exactly two $b$’s} \right\}$$\left\{w \in \{...
13.0k
views
answered
Jan 19, 2018
Theory of Computation
gatecse-2005
theory-of-computation
finite-automata
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register