Dark Mode

Recent questions tagged gatecse-2014-set3

45 votes

7 answers

1

GATE CSE 2014 Set 3 | Question: 55
Let $\oplus$ denote the exclusive OR (XOR) operation. Let '$1$' and '$0$' denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$ ... $F$ is $P+Q$ $\overline{P+Q}$ $P \oplus Q$ $\overline {P \oplus Q}$

go_editor asked in Digital Logic Sep 28, 2014

10.6k views

43 votes

7 answers

2

GATE CSE 2014 Set 3 | Question: 54
Consider the following relational schema: employee (empId,empName,empDept) customer (custId,custName,salesRepId,rating) salesRepId is a foreign key referring to empId of the employee relation. Assume that each employee makes a sale to at least one ... a 'GOOD' rating. Names of all the employees with all their customers having a 'GOOD' rating.

go_editor asked in Databases Sep 28, 2014

16.2k views

37 votes

11 answers

3

GATE CSE 2014 Set 3 | Question: 53
The CORRECT formula for the sentence, "not all Rainy days are Cold" is $\forall d (\text{Rainy}(d) \wedge \text{~Cold}(d))$ $\forall d ( \text{~Rainy}(d) \to \text{Cold}(d))$ $\exists d(\text{~Rainy}(d) \to \text{Cold}(d))$ $\exists d(\text{Rainy}(d) \wedge \text{~Cold}(d))$

go_editor asked in Mathematical Logic Sep 28, 2014

7.8k views

19 votes

2 answers

4

GATE CSE 2014 Set 3 | Question: 52
Let $\delta$ denote the minimum degree of a vertex in a graph. For all planar graphs on $n$ vertices with $\delta \geq 3$, which one of the following is TRUE? In any planar embedding, the number of faces is at least $\frac{n}{2}+2$ In any planar ... than $\frac{n}{2}+2$ There is a planar embedding in which the number of faces is at most $\frac {n}{\delta+1}$

go_editor asked in Graph Theory Sep 28, 2014

8.0k views

57 votes

11 answers

5

GATE CSE 2014 Set 3 | Question: 51
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have? $\left\lfloor\frac {n}{k}\right\rfloor$ $\left\lceil \frac{n}{k} \right\rceil$ $n-k$ $n-k+1$

go_editor asked in Graph Theory Sep 28, 2014

18.3k views

77 votes

6 answers

6

GATE CSE 2014 Set 3 | Question: 50
There are two elements $x,\:y$ in a group $(G,*)$ such that every element in the group can be written as a product of some number of $x$'s and $y$'s in some order. It is known that $x*x=y*y=x*y*x*y=y*x*y*x=e$ where $e$ is the identity element. The maximum number of elements in such a group is ____.

go_editor asked in Set Theory & Algebra Sep 28, 2014

15.5k views

78 votes

6 answers

7

GATE CSE 2014 Set 3 | Question: 49
Consider the set of all functions $f:\{0,1, \dots,2014\} \to \{0,1,\dots, 2014\}$ such that $ f\left(f\left(i\right)\right)=i$, for all $0 \leq i \leq 2014$. Consider the following statements: $P$. For each such function it must be the case that for every ... is CORRECT? $P, Q$ and $R$ are true Only $Q$ and $R$ are true Only $P$ and $Q$ are true Only $R$ is true

go_editor asked in Set Theory & Algebra Sep 28, 2014

15.5k views

35 votes

5 answers

8

GATE CSE 2014 Set 3 | Question: 48
Let $S$ be a sample space and two mutually exclusive events $A$ and $B$ be such that $A \cup B = S$. If $P(.)$ denotes the probability of the event, the maximum value of $P(A)P(B)$ is_____.

go_editor asked in Probability Sep 28, 2014

8.8k views

31 votes

4 answers

9

GATE CSE 2014 Set 3 | Question: 47
The value of the integral given below is $\int \limits_0^{\pi} \: x^2 \: \cos x\:dx$ $-2\pi$ $\pi$ $-\pi$ $2\pi$

go_editor asked in Calculus Sep 28, 2014

8.1k views

5 votes

1 answer

10

GATE CSE 2014 Set 3 | Question: 46
With respect to the numerical evaluation of the definite integral, $K = \int \limits_a^b \:x^2 \:dx$, where $a$ and $b$ are given, which of the following statements is/are TRUE? The value of $K$ obtained using the trapezoidal rule is always ... ;s rule is always equal to the exact value of the definite integral. I only II only Both I and II Neither I nor II

go_editor asked in Numerical Methods Sep 28, 2014

3.5k views

27 votes

5 answers

11

GATE CSE 2014 Set 3 | Question: 45
The above synchronous sequential circuit built using JK flip-flops is initialized with $Q_2Q_1Q_0 = 000$. The state sequence for this circuit for the next $3$ clock cycles is $001, 010, 011$ $111, 110, 101$ $100, 110, 111$ $100, 011, 001$

go_editor asked in Digital Logic Sep 28, 2014

17.5k views

69 votes

6 answers

12

GATE CSE 2014 Set 3 | Question: 44
The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write operation with a hit in cache and $10$ nanoseconds for a write ... cache hit-ratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.

go_editor asked in CO and Architecture Sep 28, 2014

23.8k views

53 votes

7 answers

13

GATE CSE 2014 Set 3 | Question: 43
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies $1$ ns, $2.2 $ ns, $2$ ... program on the old and the new design are $P$ and $Q$ nanoseconds, respectively. The value of $P/Q$ is __________.

go_editor asked in CO and Architecture Sep 28, 2014

22.1k views

58 votes

10 answers

14

GATE CSE 2014 Set 3 | Question: 42
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if ... implementation of binary search. It will always find the maximum element in $listA$. It will return −$1$ even when $x$ is present in $listA$.

go_editor asked in DS Sep 28, 2014

13.4k views

56 votes

7 answers

15

GATE CSE 2014 Set 3 | Question: 41
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... height of the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree

go_editor asked in DS Sep 28, 2014

19.7k views

49 votes

3 answers

16

GATE CSE 2014 Set 3 | Question: 40
Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfilled after the first $3$ insertions? $(97 \times 97 \times 97) / 100^3$ $(99 \times 98 \times 97) / 100^3$ $(97 \times 96 \times 95) / 100^3$ $(97 \times 96 \times 95 / (3! \times 100^3)$

go_editor asked in DS Sep 28, 2014

21.8k views

118 votes

8 answers

17

GATE CSE 2014 Set 3 | Question: 39
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.

go_editor asked in DS Sep 28, 2014

31.3k views

11 votes

3 answers

18

GATE CSE 2014 Set 3 | Question: 38
Consider the decision problem $2CNFSAT$ defined as follows: $\left\{ \phi \mid \phi \text{ is a satisfiable propositional formula in CNF with at most two literals per clause}\right\}$ ... by reduction to directed graph reachability. solvable in constant time since any input instance is satisfiable. NP-hard but not NP-complete.

go_editor asked in Theory of Computation Sep 28, 2014

3.8k views

52 votes

4 answers

19

GATE CSE 2014 Set 3 | Question: 37
Suppose you want to move from $0$ to $100$ on the number line. In each step, you either move right by a unit distance or you take a shortcut. A shortcut is simply a pre-specified pair of integers $i,\:j \:\text{with}\: i <j$. Given a shortcut $(i,j)$, if you ... $y$ and $z$ be such that $T(9) = 1 + \min(T(y),T(z))$. Then the value of the product $yz$ is _____.

go_editor asked in Algorithms Sep 28, 2014

10.0k views

32 votes

2 answers

20

GATE CSE 2014 Set 3 | Question: 36
Consider the following languages over the alphabet $\sum = \{0, 1, c\}$ $L_1 = \left\{0^n1^n\mid n \geq 0\right\}$ $L_2 = \left\{wcw^r \mid w \in \{0,1\}^*\right\}$ ... the string $w$. Which of these languages are deterministic Context-free languages? None of the languages Only $L_1$ Only $L_1$ and $L_2$ All the three languages

go_editor asked in Theory of Computation Sep 28, 2014

9.8k views

32 votes

3 answers

21

GATE CSE 2014 Set 3 | Question: 35
Which one of the following problems is undecidable? Deciding if a given context-free grammar is ambiguous. Deciding if a given string is generated by a given context-free grammar. Deciding if the language generated by a given context-free grammar is empty. Deciding if the language generated by a given context-free grammar is finite.

go_editor asked in Theory of Computation Sep 28, 2014

8.6k views

67 votes

4 answers

22

GATE CSE 2014 Set 3 | Question: 34
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are $6$ and $6$ $8$ and $10$ $9$ and $12$ $4$ and $4$

go_editor asked in Compiler Design Sep 28, 2014

34.7k views

38 votes

3 answers

23

GATE CSE 2014 Set 3 | Question: 33
Consider a paging hardware with a $TLB$. Assume that the entire page table and all the pages are in the physical memory. It takes $10$ milliseconds to search the $TLB$ and $80$ milliseconds to access the physical memory. If the $TLB$ hit ratio is $0.6$, the effective memory access time (in milliseconds) is _________.

go_editor asked in Operating System Sep 28, 2014

15.8k views

24 votes

3 answers

24

GATE CSE 2014 Set 3 | Question: 32
An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): ... The average waiting time (in milliseconds) of the processes is ______.

go_editor asked in Operating System Sep 28, 2014

9.1k views

22 votes

5 answers

25

GATE CSE 2014 Set 3 | Question: 31
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________.

go_editor asked in Operating System Sep 28, 2014

13.5k views

61 votes

3 answers

26

GATE CSE 2014 Set 3 | Question: 30
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation. employee (empId, ... is greater than that of some dependent. all dependents. some of his/her dependents. all of his/her dependents.

go_editor asked in Databases Sep 28, 2014

13.6k views

30 votes

2 answers

27

GATE CSE 2014 Set 3 | Question: 29
Consider the transactions $T1, T2, \:\text{and} \:T3$ and the schedules $S1 \:\text{and} \:S2$ given below. $T1: r1(X); r1(Z); w1(X); w1(Z) $ $T2: r2(Y); r2(Z); w2(Z) $ $T3: r3(Y); r3(X); w3(Y) $ ... Only $S1$ is conflict-serializable. Only $S2$ is conflict-serializable. Both $S1$ and $S2$ are conflict-serializable. Neither $S1$ nor $S2$ is conflict-serializable.

go_editor asked in Databases Sep 28, 2014

8.3k views

48 votes

10 answers

28

GATE CSE 2014 Set 3 | Question: 28
An $IP$ router with a $\text{Maximum Transmission Unit (MTU)}$ of $1500$ bytes has received an $IP$ packet of size $4404\text{ bytes}$ with an $IP$ header of length $20\text{ bytes}$. The values of the relevant fields in the header of the third $IP$ ... $1,$ Datagram Length$: 1500;$ Offset$: 370$ $\text{MF bit}$: $0,$ Datagram Length$: 1424;$ Offset$: 2960$

go_editor asked in Computer Networks Sep 28, 2014

21.1k views

79 votes

11 answers

29

GATE CSE 2014 Set 3 | Question: 27
Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ ... globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?

go_editor asked in Computer Networks Sep 28, 2014

21.6k views

50 votes

6 answers

30

GATE CSE 2014 Set 3 | Question: 26
An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address $131.23.151.76$ ... The identifier of the output interface on which this packet will be forwarded is ______.

go_editor asked in Computer Networks Sep 28, 2014

17.1k views

Page:

1
2
3
next »

Recent questions tagged gatecse-2014-set3