Dark Mode

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 ?

commented in Digital Logic Jun 10, 2016

981 views

2 answers

2

OS
Which of following is multi-user and multitasking operating system ? MS-DOS WINDOWS MAC OS X UNIX

commented in Operating System May 21, 2016

1.3k views

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

answered in Programming in C May 21, 2016

924 views

3 answers

4

answered in Operating System May 21, 2016

706 views

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$

answer edited in Probability May 11, 2016

7.3k views

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 ?

commented in Mathematical Logic May 10, 2016

450 views

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))

commented in Mathematical Logic May 10, 2016

700 views

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?

comment edited in Digital Logic May 8, 2016

412 views

2 answers

9

answered in CO and Architecture May 3, 2016

921 views

2 answers

10

Gate 2008 Ee
Answer given as option a ) My knowledge . Rank of a matrix Q is 4 implies 1 out of 5 rows of Q is zero linearly independent solution = n-r n--> no of unknowns r---> rank therefore linerly independent solution = 5-4 = 1 What is linerly independent Rows ... ? linerly independent vectors ?

commented in Linear Algebra May 3, 2016

664 views

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

answered in Operating System May 3, 2016

1.5k views

3 answers

12

GATE2012 AE: GA-10
In the early nineteenth century, theories of social evolution were inspired less by Biology than by the conviction of social scientists that there was a growing improvement in social institutions. Progress was taken for granted and social scientists attempted to ... was a fact. did not approve of Biology. framed the laws of progress. emphasized Biology over Social Sciences.

answered in Verbal Aptitude May 2, 2016

1.1k views

3 answers

13

GATE2013 EE: GA-7
Statement: There were different streams of freedom movements in colonial India carried out by the moderates, liberals, radicals, socialists, and so on. Which one of the following is the best inference from the above statement? The emergence ... . Nationalism in India emerged in the context of colonialism. Nationalism in India is homogeneous. Nationalism in India is heterogeneous

answered in Verbal Aptitude May 2, 2016

2.3k views

1 answer

14

Cache Coherence
Given a virtual memory system with a TLB, a cache, and a page table, assume the following: A TLB hit requires 5ns. A cache hit requires 12ns. A memory reference requires 25ns. A disk reference requires 200ms (this includes updating the page table, ... down the equation to calculate the effective access time. please help and what we do mean by access is not restarted in above .

commented in CO and Architecture Apr 30, 2016

1.5k views

7 answers

15

GATE CSE 2016 Set 1 | Question: GA08
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$. $P$ always beats $Q$ $R$ always beats $S$ $S$ loses to $P$ only sometimes. $R$ always loses to $Q$ Which of the following can be logically ... $S$ is the absolute worst player in the set (i). only (ii) only (i) and (ii) only' neither (i) nor (ii)

answered in Analytical Aptitude Feb 23, 2016

7.9k views

6 answers

16

GATE CSE 2016 Set 2 | Question: 22
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of ... to yield a serial schedule? Topological order Depth-first order Breadth-first order Ascending order of the transaction indices

answer edited in Databases Feb 19, 2016

13.3k views

5 answers

17

GATE CSE 2016 Set 2 | Question: 34
A complete binary min-heap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $0$. The maximum depth at which integer $9$ can appear is _________.

comment edited in DS Feb 13, 2016

25.8k views

7 answers

18

GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive

commented in Theory of Computation Feb 13, 2016

33.5k views

6 answers

19

GATE CSE 2016 Set 2 | Question: 27
Which one of the following well-formed formulae in predicate calculus is NOT valid ? $(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee \forall _{x} q(x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$

commented in Mathematical Logic Feb 13, 2016

16.8k views

5 answers

20

GATE CSE 2016 Set 2 | Question: 43
Consider the following languages: $L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$ $L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$ Which one of the following is TRUE? Both $L_{1}$ and $L_{2}$ are context-free. $L_{1}$ is context ... $L_{2}$ is context-free while $L_{1}$ is not context-free. Neither $L_{1}$ nor $L_{2}$ is context-free.

commented in Theory of Computation Feb 12, 2016

20.9k views

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 _______.

asked in CO and Architecture Feb 3, 2016

1.3k views

2 answers

22

Pipeline
A memory system has got the latency of 35 ns with 2 byte per operation. The system is pipelined so that 6 operations can overlap during execution. The bandwidth of the system is (A) 3.42 × 108 bytes/sec (B) 2.68 × 108 bytes/sec (C) 1.96 × 108 bytes/sec (D) 4.12 × 108 bytes/sec

asked in CO and Architecture Feb 2, 2016

519 views

1 answer

23

Number of Prime Implicants

asked in Digital Logic Feb 2, 2016

566 views

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

asked in Compiler Design Jan 29, 2016

3.3k views

9 answers

25

GATE CSE 2013 | Question: 50
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are supplied in array $oldc$ ... given above, how many test cases will be able to capture the flaw? Only one Only two Only three All four

commented in DS Jan 24, 2016

14.3k views

1 answer

26

asked in Computer Networks Jan 22, 2016

1.9k views

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 ______

commented in CO and Architecture Jan 21, 2016

40.9k views

5 answers

28

GATE CSE 2015 Set 3 | Question: 4
Consider the equality $\displaystyle{\sum_{i=0}^n} i^3 = X$ and the following choices for $X$: $\Theta(n^4)$ $\Theta(n^5)$ $O(n^5)$ $\Omega(n^3)$ The equality above remains correct if $X$ is replaced by Only I Only II I or III or IV but not II II or III or IV but not I

commented in Algorithms Jan 21, 2016

16.5k views

2 answers

29

asked in Databases Jan 19, 2016

306 views

1 answer

30

asked in Databases Jan 19, 2016

284 views