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 Aakanchha
0
answers
1
COAP 2018
Do all IIT's upload offers on COAP portal at the same time or they upload offers in some order ?
Do all IIT's upload offers on COAP portal at the same time or they upload offers in some order ?
672
views
asked
May 24, 2018
IISc/IITs
coap
gate2018-admissions
+
–
1
answer
2
IIIT Hyderabad Interview 2017
You have 1 billions elements, but memory which can hold only 1 million. How would you sort it using merge sort? Source-:https://gateoverflow.in/blog/4532/iiit-hyderabad-interview-experience-2017
You have 1 billions elements, but memory which can hold only 1 million. How would you sort it using merge sort?Source-:https://gateoverflow.in/blog/4532/iiit-hyderabad-in...
2.4k
views
commented
May 17, 2018
Algorithms
interview
mtech
iiith-pgee
merge-sort
+
–
1
answer
3
ISI 2017 PCB C3 (A)
Let R(A, B, C) be a relation with primary key (A) and S(A, D, E) a relation with primary key (A, D). Each of the relations has n tuples. If the number of tuples in R natural join S is m, then determine the number of tuples in R natural left outer join S.
Let R(A, B, C) be a relation with primary key (A) and S(A, D, E) a relation with primary key (A, D). Each of the relations has n tuples. If the number of tuples in R natu...
675
views
commented
May 9, 2018
Databases
userisi2017
usermod
databases
+
–
2
answers
4
ISI2017-MMA-7
Let $n \geq 3$ be an integer.Then the statement $(n!)^{1/n} \leq \frac{n+1}{2}$ is true for every $n \geq 3$ true if and only if $n \geq 5$ not true for $n \geq 10$ true for even integers $n \geq 6$, not true for odd $n \geq 5$
Let $n \geq 3$ be an integer.Then the statement $$(n!)^{1/n} \leq \frac{n+1}{2}$$ istrue for every $n \geq 3$true if and only if $n \geq 5$not true for $n \geq 10$true ...
912
views
asked
May 3, 2018
Quantitative Aptitude
isi2017-mma
general-aptitude
quantitative-aptitude
+
–
1
answer
5
ISI2017-MMA-3
If $\alpha,\beta $ and $ \gamma$ are the roots of the equation $x^3+3x^2-8x+1=0$, then an equation whose roots are $\alpha +1 , \beta +1 , \gamma +1 $ is given by $y^3-11y+11=0$ $y^3-11y-11=0$ $y^3+13y+13=0$ $y^3+6y^2+y-3=0$
If $\alpha,\beta $ and $ \gamma$ are the roots of the equation $x^3+3x^2-8x+1=0$, then an equation whose roots are $\alpha +1 , \beta +1 , \gamma +1 $ is given by$y^3-11y...
639
views
asked
May 2, 2018
Quantitative Aptitude
isi2017-mma
general-aptitude
quantitative-aptitude
+
–
1
answer
6
ISI 2017 PCB A2
Let $a,b,c$ and $d$ be real number such that $a+b=c+d$ and $ab=cd$. Prove that $a^{n}+b^{n}=c^{n}+d^{n}$ for all positive integer $n$.
Let $a,b,c$ and $d$ be real number such that $a+b=c+d$ and $ab=cd$. Prove that $a^{n}+b^{n}=c^{n}+d^{n}$ for all positive integer $n$.
501
views
commented
May 2, 2018
Combinatory
userisi2017
usermod
+
–
4
answers
7
GATE CSE 2001 | Question: 2.17 | UGCNET-AUG2016-III: 21
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing? Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } func1(x,y,z) { y = y + 4; z = x + y + z } $\text{10, 3}$ $\text{31, 3}$ $\text{27, 7}$ None of the above
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing?Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } f...
12.4k
views
commented
Apr 18, 2018
Programming in C
gatecse-2001
programming-in-c
parameter-passing
normal
ugcnetcse-aug2016-paper3
+
–
3
answers
8
ISRO2014-8
In the standard $\text{IEEE}$ $754$ single precision floating point representation, there is $1$ bit for sign, $23$ bits for fraction and $8$ bits for exponent. What is the precision in terms of the number of decimal digits? $5$ $6$ $7$ $8$
In the standard $\text{IEEE}$ $754$ single precision floating point representation, there is $1$ bit for sign, $23$ bits for fraction and $8$ bits for exponent. What is t...
8.1k
views
commented
Mar 20, 2018
Digital Logic
number-representation
ieee-representation
isro2014
+
–
0
answers
9
GATE 2018
My expected score for GATE 2018 is 606(General) and hence I won't be getting any good college at this score .Should I try for IIITH and BITS?Also, my last year score was 647 can I use that score while applying to colleges?
My expected score for GATE 2018 is 606(General) and hence I won't be getting any good college at this score .Should I try for IIITH and BITS?Also, my last year score was ...
417
views
asked
Mar 7, 2018
Others
career-advice
admissions
+
–
6
answers
10
GATE CSE 2018 | Question: 31
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing ... the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the...
19.2k
views
commented
Feb 14, 2018
Algorithms
gatecse-2018
algorithms
dynamic-programming
2-marks
+
–
14
answers
11
GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
39.2k
views
commented
Feb 14, 2018
DS
gatecse-2018
binary-heap
numerical-answers
combinatory
2-marks
+
–
5
answers
12
GATE CSE 2018 | Question: 11
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and that the cardinality of E1 is greater than the cardinality of E2. Which ... Every entity in E2 is associated with exactly one entity in E1 Every entity in E2 is associated with at most one entity in E1
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and ...
28.0k
views
answered
Feb 14, 2018
Databases
gatecse-2018
databases
er-diagram
normal
1-mark
+
–
1
answer
13
ISRO 2018 CSE
As per various sites, syllabus and pattern of GATE and ISRO are similar. For someone who has prepared for GATE, how to start preparations for ISRO CSE exam to be held on 22 april 2018?
As per various sites, syllabus and pattern of GATE and ISRO are similar. For someone who has prepared for GATE, how to start preparations for ISRO CSE exam to be held on ...
3.4k
views
asked
Feb 9, 2018
ISRO
isro-preparation
+
–
6
answers
14
GATE CSE 2011 | Question: 15
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is 9 8 512 258
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is98512258
15.1k
views
commented
Feb 2, 2018
Digital Logic
gatecse-2011
digital-logic
normal
digital-counter
+
–
0
answers
15
MadeEasy Test Series 2018: Theory of Computation - Turing Machine
Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5} Which of the following is true? (A) Decidable and REC (B) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE
Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5}Which of the following is true?(A) Decidable and REC(B) Unde...
2.4k
views
commented
Jan 28, 2018
Theory of Computation
theory-of-computation
turing-machines
decidability
madeeasy-testseries-2018
+
–
1
answer
16
MadeEasy Test Series: Theory of Computation- Closure Property
Which of the following is false ? a. Union of two recursive languages is recursive b. Intersection of regular and recursive language is recursive c. Union of regular language and recursive language is recursive d. None of these. please give examples of each option.. and also describe intersection of regular and recursive is recursive..
Which of the following is false ?a. Union of two recursive languages is recursive b. Intersection of regular and recursive language is recursivec. Union of regular langua...
2.3k
views
commented
Jan 28, 2018
Theory of Computation
theory-of-computation
closure-property
made-easy-test-series
+
–
0
answers
17
Revision Queries
This will be my fourth attempt in GATE. Even after working hard last year along with my job I could only get an AIR 1200. I had lost all hopes and hence didn't felt like studying again. However, in December I started studying again. I know ... ). I am currently confused should I go for second round of revision or continue solving papers and test series in this last week?
This will be my fourth attempt in GATE.Even after working hard last year along with my job I could only get an AIR 1200. I had lost all hopes and hence didn't felt like s...
388
views
edited
Jan 27, 2018
GATE
revision
+
–
2
answers
18
decidability
Is the following problem decidable-: 1. Given a deterministic context-free grammar G, is L(G) = Σ* for some alphabet Σ ? Please also provide explaination.
Is the following problem decidable-:1. Given a deterministic context-free grammar G, is L(G) = Σ* for some alphabet Σ ?Please also provide explaination.
916
views
commented
Jan 26, 2018
Theory of Computation
decidability
theory-of-computation
+
–
0
answers
19
Allocation scheme
Consider the following statements: S1 : : Linked allocation scheme efficiently implement variable size file. S2 : Contiguous allocation scheme efficiently implement fixed size file. S3 : Search time for file in linked allocation is more than in contiguous allocation. Which of the following is correct? Only S2 is wrong . How???
Consider the following statements:S1 : : Linked allocation scheme efficiently implement variable size file.S2 : Contiguous allocation scheme efficiently implement fixe...
979
views
commented
Jan 23, 2018
1
answer
20
Hashing
Consider the following keys that are hashed into the hash table in the order given using the hash function Where to handle the collision chaining is used, after inserting all the above keys in table if 2 new keys inserted into table the what is the probability new items hashed into empty slot ? ................... ... ............................................... I am getting 5/11 * 4/11.
Consider the following keys that are hashed into the hash table in the order given using the hash functionWhere to handle the collision chaining is used, after inserting ...
1.4k
views
commented
Jan 21, 2018
Programming in C
hashing
+
–
0
answers
21
Self doubt
Is equivalence problem decidable in case of-: 1) CFG's 2) DCFG's If yes, then how?
Is equivalence problem decidable in case of-:1) CFG's2) DCFG'sIf yes, then how?
236
views
commented
Jan 19, 2018
Theory of Computation
context-free-grammar
theory-of-computation
+
–
0
answers
22
Recurrence equation
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\left ( \frac{n}{2} \right ) +n^{2}2^{\frac{1}{2}}$
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\lef...
836
views
commented
Jan 11, 2018
Algorithms
algorithms
time-complexity
recurrence-relation
recursion
+
–
1
answer
23
Regular expressions
921
views
commented
Jan 1, 2018
Theory of Computation
theory-of-computation
regular-expression
regular-language
+
–
1
answer
24
MINIMAL DFA
667
views
answer selected
Dec 31, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
0
answers
25
C Programming
Can someone explain this one ? What is the output of the following program? main() { static char *s[] = { "ice", "green", "cone", "please", }; static char **ptr[]= {s+3,s+2,s+1,s}; char ***p=ptr; printf("\n%x",**++p); printf("\n%s",*--*++p+3); printf("\n%s",*p[-2]+3); printf("\n%s",p[-1][-1]+1); }
Can someone explain this one ?What is the output of the following program?main() { static char *s[] = { "ice", "green", "cone", "please", }; static char ptr[]= {s+3,s+2,...
454
views
asked
Dec 5, 2017
Programming in C
programming-in-c
+
–
0
answers
26
ISRO GATE
The solution given to this question is : How can z=5? According to me it should be 100
The solution given to this question is :How can z=5? According to me it should be 100
473
views
asked
Dec 5, 2017
Programming in C
programming-in-c
+
–
0
answers
27
ISRO GATE
The answer is given as (A) but according to me it should be (B). Can anyone explain please?
The answer is given as (A) but according to me it should be (B). Can anyone explain please?
338
views
commented
Dec 5, 2017
Programming in C
programming-in-c
matrix
+
–
0
answers
28
ISRO 2017
Will I clear the written test round for ISRO 2017 recruitment exam for 'SC'(CSE) with a score of 137 in general category?
Will I clear the written test round for ISRO 2017 recruitment exam for 'SC'(CSE) with a score of 137 in general category?
588
views
asked
Jun 11, 2017
2
answers
29
Set associative cache
Consider a 16-way set-associative cache with data words are 64 bits long and words are addressed to the half-word. The cache holds 2 Mbytes of data and each block holds 16 data words. Physical addresses are 64 bits long, How many bits of tag, index, ... to this cache? Can someone please explain what do we we mean by words are addressed to the half-word in the above question?
Consider a 16-way set-associative cache with data words are 64 bits long and words are addressed to the half-word. The cache holds 2 Mbytes of data and each block holds 1...
3.8k
views
commented
Jan 29, 2017
CO and Architecture
co-and-architecture
+
–
2
answers
30
Mininmal DFA
What will a minimal DFA over alphabet {a,b} which accepts all strings in which second symbol from RHS is always 'a' look like?
What will a minimal DFA over alphabet {a,b} which accepts all strings in which second symbol from RHS is always 'a' look like?
755
views
commented
Sep 4, 2016
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register