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 Aryan
16
answers
1
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
54.0k
views
commented
Oct 18, 2020
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
+
–
8
answers
2
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
31.7k
views
commented
Jul 6, 2016
Algorithms
gate1996
algorithms
easy
isro2016
searching
+
–
1
answer
3
ugc
356
views
answered
Jul 5, 2016
Algorithms
optimal
tree
+
–
2
answers
4
ISRO2016-13
The circuit given in the figure below is An oscillating circuit and its output is square wave The one whose output remains stable in $\text{‘1'}$ state The one having output remains stable in $\text{‘0'}$ state has a single pulse of three times propagation delay
The circuit given in the figure below isAn oscillating circuit and its output is square waveThe one whose output remains stable in $\text{‘1'}$ stateThe one having outp...
4.7k
views
commented
Jul 5, 2016
Digital Logic
isro2016
digital-logic
circuit-output
+
–
5
answers
5
ISRO-2013-35
How many number of times the instruction sequence below will loop before coming out of the loop? MOV AL, 00H A1: INC AL JNZ A1 1 255 256 Will not come out of the loop.
How many number of times the instruction sequence below will loop before coming out of the loop? MOV AL, 00H A1: INC AL JNZ A11255256Will not come out of t...
3.9k
views
answered
Jul 2, 2016
CO and Architecture
isro2013
8085-microprocessor
non-gate
+
–
3
answers
6
Average access time in cache memory along with hard disk
A system has cache main memory and disk for virtual memory. If referenced word in cache $30$ ns to access it. If it is not in cache $80$ ns to load it in cache and reference is started again. If the word not in memory then $22$ms to ... memory and $80$ ns from memory to cache and start again. Cache hit ratio is $0.8$ memory hit ratio is $0.9$
A system has cache main memory and disk for virtual memory. If referenced word in cache $30$ ns to access it. If it is not in cache $80$ ns to load it in cache and refere...
2.2k
views
commented
Jul 1, 2016
CO and Architecture
cache-memory
multilevel-cache
+
–
3
answers
7
ISRO2014-38
How many lines of output does the following C code produce? #include<stdio.h> float i=2.0; float j=1.0; float sum = 0.0; main() { while (i/j > 0.001) { j+=j; sum=sum+(i/j); printf("%f\n", sum); } } 8 9 10 11
How many lines of output does the following C code produce?#include<stdio.h float i=2.0; float j=1.0; float sum = 0.0; main() { while (i/j 0.001) { j+=j; sum=sum+(i/j); ...
5.7k
views
commented
Jun 27, 2016
Programming in C
isro2014
programming-in-c
loop
output
+
–
3
answers
8
ISRO2014-74
What is the median of data if its mode is $15$ and the mean is $30?$ $30$ $25$ $22.5$ $27.5$
What is the median of data if its mode is $15$ and the mean is $30?$$30$$25$$22.5$$27.5$
4.7k
views
asked
Jun 27, 2016
Probability
probability
statistics
mean-mode-median
isro2014
+
–
2
answers
9
ISRO2014-23
The test suite (set of test input) used to perform unit testing on a module could cover 70% of the code. What is the reliability of the module if the probability of success is 0.95 during testing? 0.665 to 0.95 At the most 0.665 At the most 0.95 At least 0.665
The test suite (set of test input) used to perform unit testing on a module could cover 70% of the code. What is the reliability of the module if the probability of succe...
4.8k
views
commented
Jun 27, 2016
IS&Software Engineering
isro2014
is&software-engineering
software-testing
+
–
5
answers
10
ISRO2014-15
Consider the logic circuit given below: $\text{Q =}$ __________? $\overline{\text{A}} \text{C} + \text{B} \overline{\text{C}} +\text{CD}$ $\text{ABC} + \overline{\text{C}} \text{D}$ $\text{AB + B} \overline{\text{C}} + \text{B} \overline{\text{D}}$ $\text{A} \overline{\text{B}} + \text{A} \overline{\text{C}} + \overline{\text{C}} \text{D}$
Consider the logic circuit given below:$\text{Q =}$ __________?$\overline{\text{A}} \text{C} + \text{B} \overline{\text{C}} +\text{CD}$$\text{ABC} + \overline{\text{C}} \...
4.0k
views
commented
Jun 27, 2016
Digital Logic
isro2014
digital-logic
circuit-output
+
–
6
answers
11
ISRO2011-41
If a microcomputer operates at $5$ MHz with an $8$-bit bus and a newer version operates at $20$ MHz with a $32$-bit bus, the maximum speed-up possible approximately will be $2$ $4$ $8$ $16$
If a microcomputer operates at $5$ MHz with an $8$-bit bus and a newer version operates at $20$ MHz with a $32$-bit bus, the maximum speed-up possible approximately will ...
5.8k
views
commented
Jun 26, 2016
CO and Architecture
isro2011
co-and-architecture
cpu
+
–
5
answers
12
ISRO2011-13
Which of the following statements about peephole optimization is False? It is applied to a small part of the code It can be used to optimize intermediate code To get the best out of this, it has to be applied repeatedly It can be applied to the portion of the code that is not contiguous
Which of the following statements about peephole optimization is False?It is applied to a small part of the codeIt can be used to optimize intermediate codeTo get the bes...
8.8k
views
commented
Jun 26, 2016
Compiler Design
isro2011
compiler-design
code-optimization
+
–
1
answer
13
BCD adder
the bcd adder to add two decimal digits needs minimum of a) 6 full adder, 2 half adder b) 5 full adder, 3 half adder c) 4 full adder, 3 half adder d) 5 full adder, 2 half adder
the bcd adder to add two decimal digits needs minimum of a) 6 full adder, 2 half adder b) 5 full adder, 3 half adder c) 4 full adder, 3 half adder d) 5 full adder, 2 half...
1.2k
views
asked
May 31, 2016
2
answers
14
GATE CSE 1993 | Question: 12
The following Pascal program segments finds the largest number in a two-dimensional integer array $A[0\dots n-1, 0\dots n-1]$ using a single loop. Fill up the boxes to complete the program and write against $\fbox{A}, \fbox{B}, \fbox{C} \text{ and } \fbox{D}$ in your answer ... A[i, j]>max then max:=A[i, j]; if |C| then j:=j+1; else begin j:=0; i:=|D| end end end
The following Pascal program segments finds the largest number in a two-dimensional integer array $A[0\dots n-1, 0\dots n-1]$ using a single loop. Fill up the boxes to co...
5.0k
views
commented
May 7, 2016
DS
gate1993
data-structures
array
normal
descriptive
+
–
1
answer
15
probability
A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68
A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the pr...
1.9k
views
asked
Apr 11, 2016
2
answers
16
Conflict serializable and 2pl schedule
Can someone write one example of a schedule which is conflict serializable but is not allowed by 2pl protocol. I have read that 2pl-> css, but css-> 2pl is not necessary?
Can someone write one example of a schedule which is conflict serializable but is not allowed by 2pl protocol. I have read that 2pl- css, but css- 2pl is not necessary?
4.4k
views
commented
Apr 10, 2016
2
answers
17
decimal equivalent of BCD
What is decimal equivalent of BCD 11011.1100 ? (A) 22.0 (B) 22.2 (C) 20.2 (D) 21.2
What is decimal equivalent of BCD 11011.1100 ?(A) 22.0 (B) 22.2 (C) 20.2 (D) 21.2
6.5k
views
commented
Apr 7, 2016
Digital Logic
digital-logic
number-system
+
–
5
answers
18
What is the value of base x?
Given $(135)_x+(144)_x=(323)_x$ What is the value of base $x$ ?
Given$(135)_x+(144)_x=(323)_x$What is the value of base $x$ ?
6.8k
views
answered
Apr 1, 2016
Digital Logic
number-representation
+
–
2
answers
19
Which type of function it is?
Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is: (A) injective (B) surjective (C) both injective and surjective (D) neither injective nor surjective
Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is:(A) injective (B) surjective(C) both injective and surjective(D) neither injective nor surjective
394
views
asked
Mar 30, 2016
3
answers
20
Hash table
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is? A 0.45 B 0.5 C 0.3 D 0.34 (approximately)
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is?A 0.45B 0.5C 0.3D 0.34 (approximately)
15.5k
views
commented
Mar 26, 2016
Algorithms
hashing
probability
+
–
1
answer
21
Quadratic probing
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from $1$ to $6$. Which of the following locations will never be probed if a collision occurs at position $5$ ? A). $4$ B). $5$ C). $8$ D). $6$ Ans: $B$ Ans ... $ 6+1 = 3$ so the $5^{th}$ location is never probed Here why we are adding $1$ to find f(key)?
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from $1$ to $6$. Which of the following locations will never...
6.3k
views
commented
Mar 26, 2016
Programming in C
data-structures
hashing
+
–
1
answer
22
How do you compare associativity (in cache) to chaining in hash table?
How do you compare associativity (in cache) to chaining in hash table?
How do you compare associativity (in cache) to chaining in hash table?
475
views
answered
Mar 26, 2016
CO and Architecture
hashing
associative-memory
+
–
4
answers
23
ISICAL MTech 2014 CS
How many asterisks $(*)$ in terms of $k$ will be printed by the following C function, when called as $\text{count}(m)$ where $m = 3^k \ ?$ Justify your answer. Assume that $4$ bytes are used to store an integer in C and $k$ is such that $3^k$ can be stored in $4$ bytes. void count(int n){ printf("*"); if(n>1){ count(n/3); count(n/3); count(n/3); } }
How many asterisks $(*)$ in terms of $k$ will be printed by the following C function, when called as $\text{count}(m)$ where $m = 3^k \ ?$ Justify your answer.Assume that...
1.6k
views
answered
Feb 6, 2016
Programming in C
programming-in-c
recursion
isi2014
+
–
1
answer
24
returned value
783
views
commented
Feb 6, 2016
Programming in C
programming
recursion
+
–
1
answer
25
How to find complexity of below code ?
for (int i=3;i*i<n ;i=i+2) { while(n%i ==0 ) { printf("%d",i); n=n/i; } } In this one worst case will be when n is some prime number for which the loop will run O(sqrt(n) ) times but how to deal with the best ... even if I try forming some series like i+2i+3i+.... then what should be the last term of this series for the evaluation of while loop .
for (int i=3;i*i<n ;i=i+2) { while(n%i ==0 ) { printf("%d",i); n=n/i; } }In this one worst case will be when n is some prime number for which the loop will run O(sqrt(n) ...
498
views
commented
Jan 25, 2016
Algorithms
algorithms
time-complexity
+
–
1
answer
26
Probability
Three people X,Y, and Z are contesting in an election and we assume that exactly one of them wins it. Suppose that X and Z have the same chances of winning and Y has only half the chance of X or Z. The probability that either X or Y wins the election is _____
Three people X,Y, and Z are contesting in an election and we assume that exactly one of them wins it. Suppose that X and Z have the same chances of winning and Y has only...
276
views
answered
Jan 24, 2016
Probability
probability
+
–
6
answers
27
TIFR CSE 2013 | Part B | Question: 18
Let $S$ be a set of numbers. For $x \in S$, the rank of $x$ is the number of elements in $S$ that are less than or equal to $x$. The procedure $\textsf{Select}(S, r)$ takes a set $S$ of numbers and a rank $r\left(1 \leq r \leq |S|\right)$ and returns the ... $|S|$ constant · $|S||R|$ constant · $|R| \log |S|$ constant · $|S|(1 + \log |R|)$
Let $S$ be a set of numbers. For $x \in S$, the rank of $x$ is the number of elements in $S$ that are less than or equal to $x$. The procedure $\textsf{Select}(S, r)$ tak...
2.5k
views
answered
Jan 24, 2016
Algorithms
tifr2013
algorithms
quick-sort
time-complexity
+
–
12
answers
28
GATE CSE 2003 | Question: 61
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n-1)}{2}\) \(\frac{n(n-1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i a_j\).If all permutations are equally likel...
22.0k
views
answered
Jan 17, 2016
Algorithms
gatecse-2003
algorithms
sorting
inversion
normal
+
–
4
answers
29
TIFR CSE 2014 | Part B | Question: 4
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? cost$(a, b) \geq 6$. cost$(b, e) \geq 5$. cost$(e, f) \geq 5$. cost$(a, d) \geq 4$. cost$(b, c) \geq 4$.
Consider the following undirected graph with some edge costs missing.Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequa...
5.0k
views
answered
Jan 16, 2016
Algorithms
tifr2014
algorithms
graph-algorithms
minimum-spanning-tree
+
–
10
answers
30
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
32.0k
views
commented
Jan 16, 2016
DS
gatecse-2003
data-structures
binary-heap
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register