Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sonu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sonu
2
answers
1
Exist
947
views
commented
May 27, 2016
Databases
sql
+
–
1
answer
2
Quadratic sorts behavior
Is below problem meaningful? I am not able to get any logic behind it. Either am missing something or the problem is real crap. Suppose one is applying a particular quadratic sorting algorithm to an array of integers. After four iterations the array ... ? Selection sort that selects the largest element in each iteration Insertion sort i or ii ii only ii only None of these
Is below problem meaningful? I am not able to get any logic behind it. Either am missing something or the problem is real crap.Suppose one is applying a particular quadra...
670
views
commented
May 27, 2016
Algorithms
algorithms
sorting
+
–
1
answer
3
quick sort partition procedure
Is below question and its answer correct? Or its just kind of rubbish? After one pass through the partition procedure of quick sort array stand as below: 2,1,4,5,9,7,8,10 How many possible pivots can you find in the array? (A) 1 (B) 2 (C) 3 ... once run, one element is at its final position. So if that it is the question shouldn't be the answer (A)? Am I wrong?
Is below question and its answer correct? Or its just kind of rubbish?After one pass through the partition procedure of quick sort array stand as below:2,1,4,5,9,7,8,10H...
1.6k
views
commented
May 26, 2016
Algorithms
algorithms
quick-sort
numerical-answers
+
–
2
answers
4
Programming \ what is the output?
#include<stdio.h> int main() { int a[10][20][30]={0}; printf("%ld",&a+1 - &a); return 0; }
#include<stdio.h int main() { int a[10][20][30]={0}; printf("%ld",&a+1 - &a); return 0; }
1.5k
views
answered
May 26, 2016
Programming in C
programming-in-c
output
interview
array
+
–
4
answers
5
GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.
An operating system handles requests to resources as follows.A process (which asks for some resources, uses them for some time and then exits the system) is assigned a un...
7.5k
views
answered
May 26, 2016
Operating System
gate1997
operating-system
resource-allocation
normal
descriptive
+
–
5
answers
6
GATE CSE 2007 | Question: 61
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want to find the employees who get higher salary than anyone in the department $5,$ ... $Q_1$ and $Q_2$ produce the same answer Neither $Q_1$ nor $Q_2$ is the correct query
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want...
26.6k
views
answered
May 26, 2016
Databases
gatecse-2007
databases
sql
normal
verbal-aptitude
+
–
2
answers
7
CMI2012-A-09
Consider the following programming errors: Type mismatch in an expression. Array index out of bounds. Use of an uninitialized variable in an expression. Which of these errors will typically be caught at compile-time by a modern compiler. I, II and III I and II I and III None of them
Consider the following programming errors:Type mismatch in an expression.Array index out of bounds.Use of an uninitialized variable in an expression.Which of these errors...
2.9k
views
commented
May 25, 2016
Compiler Design
cmi2012
compiler-design
compilation-phases
normal
+
–
2
answers
8
DB\ ER to relational model
795
views
commented
May 24, 2016
Databases
databases
er-diagram
relational-algebra
+
–
5
answers
9
GATE CSE 1991 | Question: 1,ix
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
5.4k
views
commented
May 23, 2016
DS
gate1991
binary-tree
easy
data-structures
descriptive
+
–
3
answers
10
CMI2013-A-10
The below question is based on following program: procedure mystery (A : array [1..100] of int) int i,j,position,tmp; begin for j := 1 to 100 do position := j; for i := j to 100 do if (A[i] > A[position]) then position := i; endfor tmp := A[j]; ... endfor end The number of times the test $A[i] > A[\text{position}]$ is executed is: $100$ $5050$ $10000$ Depends on contents of $A$
The below question is based on following program:procedure mystery (A : array [1..100] of int) int i,j,position,tmp; begin for j := 1 to 100 do position := j; for i := j ...
1.3k
views
answered
May 23, 2016
Algorithms
cmi2013
algorithms
time-complexity
+
–
5
answers
11
CMI2013-A-05
You have $n$ lists, each consisting of $m$ integers sorted in ascending order. Merging these lists into a single sorted list will take time: $O(nm \log m)$ $O(mn \log n)$ $O(m + n)$ $O(mn)$
You have $n$ lists, each consisting of $m$ integers sorted in ascending order. Merging these lists into a single sorted list will take time:$O(nm \log m)$$O(mn \log n)$...
6.6k
views
answered
May 23, 2016
Algorithms
cmi2013
algorithms
sorting
+
–
4
answers
12
TestBook Test Series: Compiler Design - Lexical Analysis
I think answer should be 13. We got 13 tokens printf ( "string" ++ & & * * * a ) ;
I think answer should be 13. We got 13 tokensprintf ( "string" ++ & & * * * a ) ;
1.3k
views
answered
Jan 19, 2016
Compiler Design
testbook-test-series
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
+
–
8
answers
13
GATE2012 CY: GA-7
$A$ and $B$ are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for more than $15$ minutes. The probability that they will meet on that day is $1/4$ $1/16$ $7/16$ $9/16$
$A$ and $B$ are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for m...
17.0k
views
commented
Jan 19, 2016
Quantitative Aptitude
gate2012-cy
quantitative-aptitude
probability
+
–
11
answers
14
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...
32.6k
views
comment edited
Dec 24, 2015
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
6
answers
15
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of$O(m)$$O(n)$$O(m+n)$$O(\log m + \log n)$
47.6k
views
commented
Dec 17, 2015
Algorithms
gate1995
algorithms
sorting
normal
+
–
3
answers
16
MadeEasy Test Series: CO & Architecture - Speedup
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by 30% and the speed of a fixed point unit has been increased by $20$%. The overall speedup achieved if the ratio of the ... operation used to take twice the time taken by fixed point operation in the original design(upto $2$ decimal places is __________.
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by 30% and the speed of a fixed point unit has been increased by $20$%. The ...
541
views
asked
Dec 17, 2015
CO and Architecture
speedup
co-and-architecture
made-easy-test-series
+
–
1
answer
17
Made Easy Test Series
467
views
asked
Dec 17, 2015
CO and Architecture
cache-memory
effective-memory-access
+
–
2
answers
18
GATE CSE 2008 | Question: 6
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/are decimal $10$ decimal $11$ decimal $10$ and $11$ any value $> 2$
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/aredecimal $10$decimal $11$decimal $10$ and $11$any value ...
11.6k
views
commented
Dec 12, 2015
Digital Logic
gatecse-2008
digital-logic
number-representation
normal
+
–
1
answer
19
The ALU, the bus and all the register are identical in size. the instruction "memory write"
The ALU, the bus and all the register are identical in size. The instruction "memory write" has the register transfer interpretation M[(R1)] ← R2. The minimum number of clock cycles needed for execution cycle of this instruction if memory write completion takes 1 cycle is a) 2 b)3 c)4 d)5
The ALU, the bus and all the register are identical in size. The instruction "memory write" has the register transfer interpretation M[(R1)] ← R2. The minimum number...
863
views
commented
Dec 8, 2015
CO and Architecture
co-and-architecture
data-path
+
–
3
answers
20
GATE CSE 2015 Set 2 | Question: 42
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack in the main memory is implemented from memory location $(0100)_{16}$ and it grows upward. The stack ... value of the stack pointer is: $(016A)_{16}$ $(016C)_{16}$ $(0170)_{16}$ $(0172)_{16}$
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack...
16.8k
views
commented
Dec 7, 2015
CO and Architecture
gatecse-2015-set2
co-and-architecture
machine-instruction
easy
+
–
1
answer
21
Consider the following languages
Consider the following languages $A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$ $B=\left\{\langle M \rangle \mid \text{ TM M accepts more than 2 distinct inputs} \right\}$ Identify the ... Turing recognizable $A$ is not Turing recognizable Both $A$ and $B$ are Turing recognizable Neither $A$ nor $B$ is Turing recognizable
Consider the following languages$A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$$B=\left\{\langle M \rangle \mid \text{ TM M acce...
10.6k
views
commented
Dec 2, 2015
Theory of Computation
turing-machine
theory-of-computation
normal
+
–
6
answers
22
GATE CSE 2014 Set 2 | Question: 36
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ ... is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has a...
24.9k
views
commented
Nov 27, 2015
Theory of Computation
gatecse-2014-set2
theory-of-computation
normal
regular-language
+
–
5
answers
23
TIFR CSE 2012 | Part B | Question: 3
For a person $p$, let $w(p)$, $A(p, y)$, $L(p)$ and $J(p)$ denote that $p$ is a woman, $p$ admires $y$, $p$ is a lawyer and $p$ is a judge respectively. Which of the following is the correct translation in first order logic of ...
For a person $p$, let $w(p)$, $A(p, y)$, $L(p)$ and $J(p)$ denote that $p$ is a woman, $p$ admires $y$, $p$ is a lawyer and $p$ is a judge respectively. Which of the foll...
2.1k
views
commented
Nov 19, 2015
Mathematical Logic
tifr2012
mathematical-logic
first-order-logic
+
–
2
answers
24
Given Language is REC or Non RE
Which of the following is true for the given language? $L=$ {<TM> | TM halts on every input} <TM> is encoding of the Turing machine (A) $L$ is Recursive and $\overline{L}$ is also Recursive (B) $L$ is Recursive ... Enumerable and $\overline{L}$ is Recursive Enumerable (D) $L$ is Non Recursive Enumerable and $\overline{L}$ is Non Recursive Enumerable
Which of the following is true for the given language?$L=$ {<TM | TM halts on every input}<TM is encoding of the Turing machine(A) $L$ is Recursive and $\overline{L}$ is ...
3.0k
views
commented
Nov 3, 2015
Theory of Computation
theory-of-computation
difficult
recursive-and-recursively-enumerable-languages
decidability
+
–
3
answers
25
Data hazards: RAW,WAR,WAW
Indicate the type of data hazards (RAW, WAR, and WAW) that exist between the following instructions: I1:ADD R1, R2, R3 ; R1 = R2 + R3 I2:ADD R4, R1, R4 ; R4 = R1 + R4 I3:ADD R3, R1, R2 ; R3 = R1 + R2 I4:ADD R1, R1, R4 ; R1 = R1 + ... single instruction?(as in I2 and I4) ii)Do we have to consider only consecutive instructions? (as in I1 and I2) or can it be (I1 and I3) too?
Indicate the type of data hazards (RAW, WAR, and WAW) that exist between the following instructions:I1:ADD R1, R2, R3 ; R1 = R2 + R3I2:ADD R4, R1, R4 ; R4 =...
2.0k
views
answer edited
Nov 3, 2015
CO and Architecture
data-hazards
pipelining
+
–
1
answer
26
War raw waw
(common data q-30_31) A pipelined processor uses a 4- stages instruction pipeline with the following stages. Instructions fetch (IF) , instruction decode (ID), execute (EX) and write back (WB). The arithmetic operations as well as the load and store ... available in rhe resisters ro, r1, r2 and r4 respectively; before the execution of the instruction sequence. Add r5,r0,r1 r5
(common data q-30_31)A pipelined processor uses a 4- stages instruction pipeline with the following stages. Instructions fetch (IF) , instruction decode (ID), execute (EX...
1.4k
views
answered
Nov 3, 2015
CO and Architecture
co-and-architecture
pipelining
data-hazards
+
–
3
answers
27
dma throughput
A DMA controller transfers $16$ bytes to memory using cycle stealing with frequency $1.2$GHz. The number of clock cycles used for transfer of $16$ bytes is $20$ Clock cycles. Find the throughout?
A DMA controller transfers $16$ bytes to memory using cycle stealing with frequency $1.2$GHz. The number of clock cycles used for transfer of $16$ bytes is $20$ Clock cyc...
1.1k
views
answered
Oct 30, 2015
CO and Architecture
dma
+
–
2
answers
28
TIFR CSE 2012 | Part A | Question: 13
The maximum value of the function $f\left(x, y, z\right)= \left(x - 1 / 3\right)^{2}+ \left(y - 1 / 3\right)^{2}+ \left(z - 1 / 3\right)^{2}$ subject to the constraints $x + y + z=1,\quad x \geq 0, y \geq 0, z \geq 0$ is $1 / 3$ $2 / 3$ $1$ $4 / 3$ $4 / 9$
The maximum value of the function$f\left(x, y, z\right)= \left(x - 1 / 3\right)^{2}+ \left(y - 1 / 3\right)^{2}+ \left(z - 1 / 3\right)^{2}$subject to the constraints$x +...
1.4k
views
answered
Oct 30, 2015
Calculus
tifr2012
calculus
maxima-minima
+
–
3
answers
29
microinstruction
1.3k
views
answered
Oct 30, 2015
CO and Architecture
microprogramming
+
–
3
answers
30
Give me the formula for write back and write through ( avg access time ) in both parallel and serial
14.1k
views
commented
Oct 30, 2015
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register