Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Aryan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Aryan
0
votes
1
ugc
346
views
answered
Jul 5, 2016
Algorithms
optimal
tree
+
–
0
votes
2
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.8k
views
answered
Jul 2, 2016
CO and Architecture
isro2013
8085-microprocessor
non-gate
+
–
3
votes
3
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
+
–
1
votes
4
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?
460
views
answered
Mar 26, 2016
CO and Architecture
hashing
associative-memory
+
–
3
votes
5
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.5k
views
answered
Feb 6, 2016
Programming in C
programming-in-c
recursion
isi2014
+
–
0
votes
6
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...
264
views
answered
Jan 24, 2016
Probability
probability
+
–
0
votes
7
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.4k
views
answered
Jan 24, 2016
Algorithms
tifr2013
algorithms
quick-sort
time-complexity
+
–
39
votes
8
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...
20.5k
views
answered
Jan 17, 2016
Algorithms
gatecse-2003
algorithms
sorting
inversion
normal
+
–
6
votes
9
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
+
–
3
votes
10
Aptitude
Given $\displaystyle \cfrac{\;\cfrac{a}{b} + \cfrac{b}{a}\;}{\cfrac{a}{b} - \cfrac{b}{a}} = 1$ If $a$ and $c$ are positive integers, then how many ordered pairs are possible for $(a,c)$, where: $a + 4b^2 + c \leq 8$? 45 28 17 18
Given $\displaystyle \cfrac{\;\cfrac{a}{b} + \cfrac{b}{a}\;}{\cfrac{a}{b} - \cfrac{b}{a}} = 1$If $a$ and $c$ are positive integers, then how many ordered pairs are possib...
596
views
answered
Jan 4, 2016
Quantitative Aptitude
combinatory
algebra
+
–
4
votes
11
Which of the following SQL queries find the managers of the Branches with total asset over 10000?
Consider the following relations: Customer (cid, name, city) Branch (bid, manager, city) Account (accid, bid, cid, balance) bid is foreign key of Account referencing Branch, cid is the foreign key of Account referencing ... .bid HAVING SUM (a.balance) > 10000 c. Both (a) and (b) d. None of these
Consider the following relations:Customer (cid, name, city)Branch (bid, manager, city)Account (accid, bid, cid, balance)bid is foreign key of Account referencing Branch, ...
857
views
answered
Jan 15, 2015
Databases
databases
sql
+
–
0
votes
12
functions
Let $f:A\to B$ and $E$ and $F$ be subsets of $A$. Is below statement true or false? $S:f(E \cap F)= f(E) \cap f(F)$
Let $f:A\to B$ and $E$ and $F$ be subsets of $A$. Is below statement true or false?$S:f(E \cap F)= f(E) \cap f(F)$
546
views
answered
Jan 15, 2015
Set Theory & Algebra
functions
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register