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
Recent activity by ravi_ssj4
4
answers
1
GATE CSE 2015 Set 1 | Question: 27
Consider the following relation: ... P WHERE S.Roll_No= P.Roll_No GROUP BY S.STUDENT_Name The numbers of rows that will be returned by the SQL query is_________________.
Consider the following relation:$$\overset{\text{Student}}{\begin{array}{|c|c|}\hline\\\underline{\textbf{Roll_No}}& \textbf{Student_Name}\\\hline1& \text{Raj} \\...
17.3k
views
commented
Mar 21, 2017
Databases
gatecse-2015-set1
databases
sql
normal
numerical-answers
+
–
3
answers
2
GATE CSE 2015 Set 1 | Question: GA-10
The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing in at least one, a $50\%$ ... Only relation I is true. Only relation II is true. Relations II and III are true. Relations I and III are true.
The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing ...
12.6k
views
commented
Mar 7, 2017
Quantitative Aptitude
gatecse-2015-set1
quantitative-aptitude
probability
+
–
7
answers
3
GATE CSE 2017 Set 2 | Question: 38
Consider the following C function int fun(int n) { int i, j; for(i=1; i<=n; i++) { for (j=1; j<n; j+=i) { printf("%d %d", i, j); } } } Time complexity of $fun$ in terms of $\Theta$ notation is $\Theta(n \sqrt{n})$ $\Theta(n^2)$ $\Theta(n \: \log n)$ $\Theta(n^2 \log n)$
Consider the following C functionint fun(int n) { int i, j; for(i=1; i<=n; i++) { for (j=1; j<n; j+=i) { printf("%d %d", i, j); } } }Time complexity of $fun$ in terms of ...
24.9k
views
commented
Feb 14, 2017
Algorithms
gatecse-2017-set2
algorithms
time-complexity
+
–
12
answers
4
GATE CSE 2016 Set 1 | Question: 19
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
Consider the following code segment.x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;The minimum number of total variables required to convert the above code segment...
27.7k
views
answer edited
Feb 10, 2017
Compiler Design
gatecse-2016-set1
compiler-design
static-single-assignment
normal
numerical-answers
+
–
2
answers
5
GATE Overflow | Data Structures | Test 1 | Question: 22
A function $f$ defined on stack of integer satisfies the following properties: $f(\{\}) = 1$ and $f(PUSH(S,i)) = \max (f(S),1) * i$ for all stacks $S$ and integer $i$. If a stack $S$ contains the integers $4, -2, 9$ in order from bottom to top, what is $f(S)$?
A function $f$ defined on stack of integer satisfies the following properties:$f(\{\}) = 1$ and$f(PUSH(S,i)) = \max (f(S),1) * i$ for all stacks $S$ and integer $i$.If a ...
769
views
commented
Feb 3, 2017
DS
go-ds-1
data-structures
stack
numerical-answers
+
–
1
answer
6
GATE Overflow | Data Structures | Test 1 | Question: 30
In a Network where bytes are continuously being transferred, it is required to identify the most frequently transferred byte. What would be an appropriate data structure for finding this? Linked List Array Dynamically growing Array Set
In a Network where bytes are continuously being transferred, it is required to identify the most frequently transferred byte. What would be an appropriate data structure ...
789
views
commented
Feb 3, 2017
DS
go-ds-1
data-structures
+
–
2
answers
7
GATE Overflow | Operating Systems | Test 1 | Question: 18
System calls are usually invoked by using a software interrupt polling an indirect jump a privileged instruction
System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction
511
views
commented
Feb 2, 2017
Operating System
go-os-1
operating-system
+
–
10
answers
8
GATE CSE 2004 | Question: 68
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ ... percentage of processor time consumed for the transfer operation? $5.0 \%$ $1.0\%$ $0.5\%$ $0.1\%$
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ clo...
27.3k
views
commented
Dec 6, 2016
CO and Architecture
gatecse-2004
dma
normal
co-and-architecture
+
–
6
answers
9
GATE CSE 2006 | Question: 61
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$ ... a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening a...
27.7k
views
commented
Dec 1, 2016
Operating System
gatecse-2006
operating-system
process-synchronization
normal
+
–
6
answers
10
GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ and the number of segments are given below.$$\small \begin{array}{|c|c|c|}\h...
29.2k
views
commented
Nov 26, 2016
Operating System
gateit-2006
operating-system
memory-management
difficult
+
–
2
answers
11
GATE CSE 1995 | Question: 14
If the overhead for formatting a disk is $96$ bytes for a $4000$ byte sector, Compute the unformatted capacity of the disk for the following parameters: Number of surfaces: $8$ Outer diameter of the disk: $12$ cm Inner diameter of ... rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory.
If the overhead for formatting a disk is $96$ bytes for a $4000$ byte sector,Compute the unformatted capacity of the disk for the following parameters:Number of surfaces:...
12.9k
views
commented
Nov 22, 2016
Operating System
gate1995
operating-system
disk
normal
descriptive
+
–
4
answers
12
GATE CSE 1993 | Question: 28
Let $\left(\{ p,q \},*\right)$ be a semigroup where $p*p=q$. Show that: $p*q=q*p$ and $q*q=q$
Let $\left(\{ p,q \},*\right)$ be a semigroup where $p*p=q$. Show that:$p*q=q*p$ and$q*q=q$
4.7k
views
commented
Nov 20, 2016
Set Theory & Algebra
gate1993
set-theory&algebra
group-theory
normal
descriptive
+
–
3
answers
13
GATE CSE 2016 Set 1 | Question: GA05
A cube is built using $64$ cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the body (in square units) after the removal is ________. $56$ $64$ $72$ $96$
A cube is built using $64$ cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the b...
12.9k
views
commented
Nov 18, 2016
Quantitative Aptitude
gatecse-2016-set1
quantitative-aptitude
geometry
normal
+
–
10
answers
14
GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows:$$\begin{array}{|c|c|c|c|} \hline \textbf{+} & \textbf{a}& \textbf{b} &\textbf{c...
7.1k
views
commented
Nov 15, 2016
Set Theory & Algebra
gatecse-2003
set-theory&algebra
normal
binary-operation
+
–
16
answers
15
GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ___...
15.7k
views
commented
Nov 15, 2016
Combinatory
gatecse-2015-set3
combinatory
normal
numerical-answers
+
–
1
answer
16
GATE IT 2008 | Question: 26
Consider the field $C$ of complex numbers with addition and multiplication. Which of the following form(s) a subfield of $C$ with addition and multiplication? S1: the set of real numbers S2: $\{(a + ib) \mid a$ and $b$ are rational numbers$\}$ S3: $\{a + ib \mid (a^2 + b^2) \leq 1\}$ S4: $\{ia \mid a \text{ is real}\}$ only S1 S1 and S3 S2 and S3 S1 and S2
Consider the field $C$ of complex numbers with addition and multiplication. Which of the following form(s) a subfield of $C$ with addition and multiplication?S1: the set...
4.0k
views
commented
Nov 14, 2016
Set Theory & Algebra
gateit-2008
set-theory&algebra
normal
fields
non-gate
+
–
2
answers
17
GATE CSE 1994 | Question: 15
Use the patterns given to prove that $\sum\limits_{i=0}^{n-1} (2i+1) = n^2$ (You are not permitted to employ induction) Use the result obtained in (A) to prove that $\sum\limits_{i=1}^{n} i = \frac{n(n+1)}{2}$
Use the patterns given to prove that$\sum\limits_{i=0}^{n-1} (2i+1) = n^2$(You are not permitted to employ induction)Use the result obtained in (A) to prove that $\sum\li...
2.0k
views
commented
Nov 14, 2016
Combinatory
gate1994
combinatory
proof
summation
descriptive
+
–
6
answers
18
GATE CSE 2004 | Question: 24
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ ... $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$
Consider the binary relation:$S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$The reflexive transitive closure is $S$ is$\lef...
9.9k
views
commented
Nov 13, 2016
Set Theory & Algebra
gatecse-2004
set-theory&algebra
easy
relations
+
–
4
answers
19
GATE CSE 1992 | Question: 01-vi
In an $11$-bit computer instruction format, the size of address field is $4$-bits. The computer uses expanding OP code technique and has $5$ two-address instructions and $32$ one-address instructions. The number of zero-address instructions it can support is ________
In an $11$-bit computer instruction format, the size of address field is $4$-bits. The computer uses expanding OP code technique and has $5$ two-address instructions and ...
13.2k
views
commented
Nov 4, 2016
CO and Architecture
gate1992
co-and-architecture
machine-instruction
instruction-format
normal
numerical-answers
+
–
4
answers
20
GATE CSE 2013 | Question: 46
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is (A) 4 (B) 5 (C) 6 (D) 7
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is(A...
27.8k
views
commented
Oct 26, 2016
Digital Logic
gatecse-2013
digital-logic
normal
out-of-syllabus-now
+
–
1
answer
21
GATE CSE 1997 | Question: 72
Following floating point number format is given $f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (includes sign hit) in sign magnitude form and $n=(f, e) = f. 2^e$ ... addition of $A$ and $B.$ What is the percentage error (up to one position beyond decimal point) in the addition operation in (b)?
Following floating point number format is given$f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (...
3.1k
views
commented
Oct 19, 2016
Digital Logic
gate1997
digital-logic
floating-point-representation
normal
descriptive
+
–
5
answers
22
GATE CSE 1996 | Question: 2.21
Consider the circuit in below figure which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output. Binary to Hex conversion Binary to BCD conversion Binary to Gray code conversion Binary to $radix-12$ conversion
Consider the circuit in below figure which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output.Binary to Hex co...
14.1k
views
commented
Oct 17, 2016
Digital Logic
gate1996
digital-logic
circuit-output
normal
+
–
5
answers
23
GATE IT 2008 | Question: 42
The two numbers given below are multiplied using the Booth's algorithm. Multiplicand : $0101$ $1010$ $1110$ $1110$ Multiplier: $0111$ $0111$ $1011$ $1101$ How many additions/Subtractions are required for the multiplication of the above two numbers? $6$ $8$ $10$ $12$
The two numbers given below are multiplied using the Booth's algorithm.Multiplicand : $0101$ $1010$ $1110$ $1110$Multiplier: ...
21.9k
views
commented
Oct 15, 2016
Digital Logic
gateit-2008
digital-logic
booths-algorithm
normal
+
–
21
answers
24
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...
42.7k
views
commented
Sep 19, 2016
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
5
answers
25
GATE IT 2004 | Question: 27
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which the Ethernet address of the host is unique is the subnet to which the host belongs the Department network the University network the Internet
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which ...
13.6k
views
answered
Sep 16, 2016
Computer Networks
gateit-2004
computer-networks
lan-technologies
ethernet
normal
+
–
9
answers
26
GATE CSE 2014 Set 3 | Question: 25
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram ... $\text{ii}$ only $\text{ii}$ and $\text{iii}$ only $\text{i, ii}$ and $\text{iii}$
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches...
16.5k
views
answered
Sep 16, 2016
Computer Networks
gatecse-2014-set3
computer-networks
ip-packet
normal
+
–
5
answers
27
GATE CSE 2006 | Question: 82
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least serial number. ... $\text{B1, B5, B2, B3, B4}$ $\text{B1, B3, B4, B5, B2}$
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridg...
23.1k
views
commented
Sep 8, 2016
Computer Networks
gatecse-2006
computer-networks
bridges
normal
+
–
4
answers
28
GATE CSE 2000 | Question: 2.16
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited `in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the following is always true? LASTIN = LASTPOST LASTIN = LASTPRE LASTPRE = LASTPOST None of the above
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the foll...
17.7k
views
commented
Sep 6, 2016
DS
gatecse-2000
data-structures
binary-tree
normal
+
–
11
answers
29
GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ...
33.1k
views
commented
Sep 6, 2016
DS
gatecse-2004
binary-search-tree
normal
data-structures
+
–
7
answers
30
GATE CSE 2015 Set 2 | Question: 29
Consider the intermediate code given below. (1) i=1 (2) j=1 (3) t1 = 5 * i (4) t2 = t1 + j (5) t3 = 4 * t2 (6) t4 = t3 (7) a[t4] = -1 (8) j = j + 1 (9) if j <= 5 goto (3) (10) i = i +1 (11) if i < 5 goto (2) The number of nodes and edges in control-flow-graph constructed for the above code, respectively, are $5$ and $7$ $6$ and $7$ $5$ and $5$ $7$ and $8$
Consider the intermediate code given below.(1) i=1 (2) j=1 (3) t1 = 5 * i (4) t2 = t1 + j (5) t3 = 4 * t2 (6) t4 = t3 (7) a[t4] = -1 (8) j = j + 1 (9) if j <= 5 goto (3) ...
25.9k
views
commented
Sep 6, 2016
Compiler Design
gatecse-2015-set2
compiler-design
intermediate-code
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register