Register
Filter

Recent activity by Mojo-Jojo

2 answers
1
Number of flip flops required?
For the counting sequence 100, 200, 300 , 400 , 100 (repeat), the number of flip flops required are ?
For the counting sequence 100, 200, 300 , 400 , 100 (repeat), the number of flip flops required are ?
2 answers
2
OS
Which of following is multi-user and multitasking operating system ? MS-DOS WINDOWS MAC OS X UNIX
Which of following is multi-user and multitasking operating system ?MS-DOSWINDOWSMAC OS XUNIX
2 answers
3
tree data-structure
Which of the following data structures will be the most efficient for inserting a number into a sorted list of numbers? Queue Stack Linked list Array
Which of the following data structures will be the most efficient for inserting a number into a sorted list of numbers?QueueStackLinked listArray
3 answers
4
isro
3 answers
5
ISRO2014-37
The probability that two friends are born in the same month is ____ ? $1/6$ $1/12$ $1/144$ $1/24$
The probability that two friends are born in the same month is ____ ?$1/6$$1/12$$1/144$$1/24$
1 answer
6
Logic Basic
I have a proposition here Not Everyone is perfect The above statement also mean there is someone who is perfect So can i write ∃xP(x) where P(x) is x is perfect And in book it is written ∼∀x P(x) Which one is correct and where am i wrong ?
I have a proposition here Not Everyone is perfect The above statement also mean there is someone who is perfect So can i write ∃xP(x) where P(x) is x is perfect And in ...
2 answers
7
Logic basics
If i have a statement like : "No large birds live on honey" where domain is set of all Birds Here let Q(x) : x is a large bird R(x) : lives on honey CAn i write this is ∀x (∽Q(x)-->R(x)) ..is it right ? and what about this ∀x (Q(x)-->∽R(x))
If i have a statement like :"No large birds live on honey" where domain is set of all Birds Here let Q(x) : x is a large bird R(x) : lives on honey CAn i write this is&f...
1 answer
8
Modulous value of counter?
If a counter counts like : 0 - 4 - 2 - 5 - 3 - 0 (repeat).... what is the modulous value of counter?
If a counter counts like : 0 - 4 - 2 - 5 - 3 - 0 (repeat).... what is the modulous value of counter?
2 answers
9
assembly
4 answers
11
operating systems
a system has 6 processes sharing 7 resourses if each process needs maximum 3 units then a) deadlock can never occur b)deadlock may occur c)starvation will occur d)none of these
a system has 6 processes sharing 7 resourses if each process needs maximum 3 units thena) deadlock can never occurb)deadlock may occurc)starvation will occurd)none of the...
2 answers
21
Number of bits
A computer system has a main memory consisting of 1 M 16 bit words. It also has a 4 way set associative cache of size 4 K words and 64 words per block. The number of tag bits are _______.
A computer system has a main memory consisting of 1 M 16 bit words. It also has a 4 way set associative cache of size 4 K words and 64 words per block. The number of tag ...
1 answer
23
Number of Prime Implicants
4 answers
24
DAG
Q). Consider the following directed acyclic graph (DAG): The expression represented by above DAG is: (A) $a+a+(a+a+a)$ (B) $a+a+(a+a+a+(a+a+a+a))$ (C) $a+a+(a+a+a+(a+a+a))$ (D) None
Q). Consider the following directed acyclic graph (DAG): The expression represented by above DAG is:(A) $a+a+(a+a+a)$(B) $a+a+(a+a+a+(a+a+a+a))$...
1 answer
26
Supernetting
5 answers
27
GATE CSE 2015 Set 3 | Question: 51
Consider the following reservation table for a pipeline having three stages $S_1, S_2 \text{ and } S_3$ ... $} & & & \text{$X$} & \\\hline \end{array}$ The minimum average latency (MAL) is ______
Consider the following reservation table for a pipeline having three stages $S_1, S_2 \text{ and } S_3$.$$\begin{array}{|ccccc|} \hline \textbf{Time} \rightarrow \\\hline...
2 answers
29
DBMS
1 answer
30
DBMS