Questions by Arjun

40 votes

3 answers

1541

GATE CSE 2013 | Question: 31
Consider the following function: int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); } The return value of the function is $\Theta(n^2)$ $\Theta(n^2\log n)$ $\Theta(n^3)$ $\Theta(n^3\log n)$

asked in Algorithms Sep 24, 2014

23.5k views

100 votes

8 answers

1542

GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$

asked in Algorithms Sep 24, 2014

23.4k views

77 votes

10 answers

1543

GATE CSE 2013 | Question: 29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$

asked in Operating System Sep 24, 2014

23.0k views

42 votes

5 answers

1544

GATE CSE 2013 | Question: 28
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence? Instruction fetch Operand fetch Conditional branch Initiation of interrupt service

asked in CO and Architecture Sep 24, 2014

11.7k views

46 votes

7 answers

1545

GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$

asked in Mathematical Logic Sep 24, 2014

10.5k views

57 votes

8 answers

1546

GATE CSE 2013 | Question: 26
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if $e$ ... of a planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only

asked in Graph Theory Sep 24, 2014

15.3k views

24 votes

2 answers

1547

GATE CSE 2013 | Question: 25
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. P only Q only Both P and Q Neither P nor Q

asked in Graph Theory Sep 24, 2014

14.2k views

55 votes

5 answers

1548

GATE CSE 2013 | Question: 24
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$

asked in Probability Sep 24, 2014

16.5k views

3 votes

2 answers

1549

GATE CSE 2013 | Question: 23
Function $f$ is known at the following points: $x$ 0 0.3 0.6 0.9 1.2 1.5 1.8 2.1 2.4 2.7 3.0 $f(x)$ 0 0.09 0.36 0.81 1.44 2.25 3.24 4.41 5.76 7.29 9.00 The value of $\int_{0}^{3} f(x) \text{d}x$ computed using the trapezoidal rule is (A) 8.983 (B) 9.003 (C) 9.017 (D) 9.045

asked in Numerical Methods Sep 24, 2014

2.7k views

16 votes

3 answers

1550

GATE CSE 2013 | Question: 22
Which one of the following functions is continuous at $x = 3?$ $f(x) = \begin{cases} 2,&\text{if $x = 3$ } \\ x-1& \text{if $x > 3$}\\ \frac{x+3}{3}&\text{if $x < 3$ } \end{cases}$ ... $} \end{cases}$ $f(x) = \begin{cases} \frac{1}{x^3-27}&\text{if $x \neq 3$ } \end{cases}$

asked in Calculus Sep 24, 2014

6.1k views

32 votes

7 answers

1551

GATE CSE 2013 | Question: 21
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$? $xy + x′ y′$ $x\oplus y′$ $x′\oplus y$ $x′\oplus y′$

asked in Digital Logic Sep 24, 2014

7.3k views

68 votes

4 answers

1552

GATE CSE 2013 | Question: 20
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v-1) $

asked in CO and Architecture Sep 23, 2014

11.6k views

33 votes

4 answers

1553

GATE CSE 2013 | Question: 19
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? $\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)$ $\theta(n^3\log n)$

asked in Algorithms Sep 23, 2014

22.2k views

25 votes

1 answer

1554

GATE CSE 2013 | Question: 18
Which of the following statements are TRUE? The problem of determining whether there exists a cycle in an undirected graph is in $P$. The problem of determining whether there exists a cycle in an undirected graph is in $NP$. If a problem A is $NP-Complete$, there exists a non-deterministic ... solve $A$ $1$, $2$ and $3$ $1$ and $2$ only $2$ and $3$ only $1$ and $3$ only

asked in Theory of Computation Sep 23, 2014

6.2k views

38 votes

6 answers

1555

GATE CSE 2013 | Question: 17
Which of the following statements is/are FALSE? For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection and ... and intersection. $1$ and $4$ only $1$ and $3$ only $2$ only $3$ only

asked in Theory of Computation Sep 23, 2014

18.8k views

52 votes

8 answers

1556

GATE CSE 2013 | Question: 16
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation (i.e., $wait$) on semaphores $a$, $b,$ and $c$; process $Y$ executes the $P$ operation on semaphores $b$, $c,$ and $d$; process ... $X:$ $P(a)P(b)P(c)$ $Y:$ $P(c)P(b)P(d)$ $Z:$ $P(c)P(d)P(a)$

asked in Operating System Sep 23, 2014

13.3k views

43 votes

2 answers

1557

GATE CSE 2013 | Question: 15
An index is clustered, if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index

asked in Databases Sep 23, 2014

13.1k views

38 votes

4 answers

1558

GATE CSE 2013 | Question: 14
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D. Network layer - $4$ times and Data link ... $4$ times and Data link layer - $6$ times Network layer - $2$ times and Data link layer - $6$ times

asked in Computer Networks Sep 23, 2014

14.4k views

23 votes

3 answers

1559

GATE CSE 2013 | Question: 13
Using public key cryptography, $X$ adds a digital signature σ to message $M$, encrypts $\langle M, \sigma \rangle$, and sends it to $Y$, where it is decrypted. Which one of the following sequences of keys is used for the operations? Encryption: $X's$ ... : $X's$ private key followed by $Y's$ public key; Decryption: $Y's$ private key followed by $X's$ public key

asked in Computer Networks Sep 23, 2014

7.6k views

27 votes

4 answers

1560

GATE CSE 2013 | Question: 12
The transport layer protocols used for real time multimedia, file transfer, $\textsf{DNS}$ and email, respectively are $\textsf{TCP, UDP, UDP}\; \text{and}\; \textsf{TCP}$ $\textsf{UDP, TCP, TCP}\; \text{and}\; \textsf{UDP}$ $\textsf{UDP, TCP, UDP}\; \text{and}\; \textsf{TCP}$ $\textsf{TCP, UDP, TCP}\;\text{and}\; \textsf{UDP}$

asked in Computer Networks Sep 23, 2014

10.0k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions by Arjun

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Subjects

Questions by Arjun

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Recent Posts

Subjects

Recent Blog Comments