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 Chaitrasj
4
answers
1
GATE CSE 1993 | Question: 17
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
8.2k
views
commented
May 5, 2019
Set Theory & Algebra
gate1993
set-theory&algebra
easy
set-theory
descriptive
+
–
1
answer
2
IIT Kanpur Test Sample Paper
(Batman and Robin) The city of Gotham keeps propping up newer challenges for our dynamic duo. The criminals in the city are so organized that they have come up with a schedule to commit the crimes. a. The Mad Hatter commits maddeningly despicable ... . What is the probability of that? 4) In the above scenario, what is the probability that two criminals get defeated?
(Batman and Robin) The city of Gotham keeps propping up newer challenges for our dynamic duo. The criminals in the city are so organized that they have come up wit...
486
views
commented
Apr 14, 2019
Probability
iit-kanpur
written-test
mtech
+
–
2
answers
3
IIT Kanpur
Two sets of numbers are given as sorted arrays in increasing order, A and B, with n and m numbers respectively. What is the best estimate for the complexity of computing the set A \ B? $O(n.m)$ $O(n^2 .m)$ $O(n + m)$ $(n log n + m log m)$
Two sets of numbers are given as sorted arrays in increasing order, A and B, with n and m numbers respectively. What is the best estimate for the complexity of computing ...
813
views
commented
Apr 14, 2019
0
answers
4
IIT Kanpur
10. In the process of designing an $n$ storey building, an architect designed $k$ types of floor modules. Even though the ground floor can use any of the $k$ modules, subsequent floors need to satisfy compatibility constraints. For each module $M_{i}$, there is some subset $B_{i}$ of modules on top of which $M_{i}$ ... A. $O(k^{n})$ B. $O(n^{k})$ C. $O(nk)$ D. $O(nk^{2})$ E $O(n^{2}k)$
10. In the process of designing an $n$ storey building, an architect designed $k$ types of floor modules. Even though the ground floor can use any of the $k$ modules, sub...
414
views
commented
Apr 14, 2019
Written Exam
iit-kanpur
+
–
3
answers
5
Model Question IISc CDS CS Written Test Sample question
Anand is preparing a pizza with 8 slices, and he has 10 toppings to put on the pizza. He can put only one topping on each slice but can use the same topping on zero or more slices. In how many unique ways can he prepare the slices so that the same topping is not used in adjacent slices?
Anand is preparing a pizza with 8 slices, and he has 10 toppings to put on the pizza. He can put only onetopping on each slice but can use the same topping on zero or mor...
1.8k
views
asked
Mar 11, 2019
Combinatory
iisc
cds
+
–
0
answers
6
ACE Test Series: Programming in C
What will be output of the program? int d=0; int f(int a,int b){ int c; d++; if(b==3) return a*a*a; else{ c=f(a,b/3); return(c*c*c); } } int main(){ printf("%d",f(4,81)); return 0; }
What will be output of the program?int d=0; int f(int a,int b){ int c; d++; if(b==3) return a*a*a; else{ c=f(a,b/3); return(c*c*c); } } int main(){ printf("%d",f(4,81)); ...
1.2k
views
commented
Mar 5, 2019
Programming in C
programming-in-c
+
–
1
answer
7
Self doubt- Min no of NOR gates
What is the minimum number of 2 input NOR gates required to realise: F(A,B,C) = (A'+B')(B'+C')(C'+A') Case 1- Compliments of A,B,C are not available Case 2- Compliments of A,B,C are available
What is the minimum number of 2 input NOR gates required to realise:F(A,B,C) = (A'+B')(B'+C')(C'+A')Case 1- Compliments of A,B,C are not availableCase 2- Compliments of A...
732
views
commented
Feb 1, 2019
3
answers
8
MadeEasy Test Series 2019: Databases - Transaction And Concurrency
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict ... ) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$Consider the following statements : S1 :...
3.3k
views
commented
Jan 28, 2019
Databases
transaction-and-concurrency
made-easy-test-series
+
–
0
answers
9
Made easy CBT2
$R_2(A)$W_1(B)$W_1(C)$R_3(B)$R_2(B)$R_1(A)$C_1$R_2(C)$C_2$W_3(A)$C_3$ Is this schedule allowed under 2PL?
$R_2(A)$$W_1(B)$$W_1(C)$$R_3(B)$$R_2(B)$$R_1(A)$$C_1$$R_2(C)$$C_2$$W_3(A)$$C_3$Is this schedule allowed under 2PL?
283
views
commented
Jan 26, 2019
6
answers
10
GATE IT 2007 | Question: 81
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ ... $\Theta\left(n\right)$ $\Theta\left(n\log n\right)$ $\Theta\left(n\log^2 n\right)$ $\Theta\left(n^2\right)$
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line pa...
6.3k
views
commented
Jan 24, 2019
Algorithms
gateit-2007
algorithms
time-complexity
normal
+
–
4
answers
11
GATE CSE 2015 Set 2 | Question: GA-8
In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ? $\left(\dfrac{(q+r)} {qr}\right)$ $\left(\dfrac {qr} {q+r}\right)$ $\large \sqrt {(q^2 + r^2)}$ $\left(\dfrac{(q+r)^2} {qr}\right)$
In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ?$\left(\dfrac{(q+r)} {qr}\right)$$\left(\dfra...
11.1k
views
commented
Jan 21, 2019
Quantitative Aptitude
gatecse-2015-set2
quantitative-aptitude
geometry
difficult
triangles
+
–
0
answers
12
ACE Test Series
264
views
commented
Jan 19, 2019
0
answers
13
Ace test series
327
views
commented
Jan 19, 2019
1
answer
14
CO Cache Memory Access
In a certain system the main memory access time is 100 ns. The cache is 10 time faster than the main memory and uses the write though protocol. If the hit ratio for read request is 0.92 and 85% of the memory requests generated by the CPU are for read, ... write; then the average time consideration both read and write requests is a) 28.95ns b) 348.47ns c) 29.62ns d) 296.2ns
In a certain system the main memory access time is 100 ns. The cache is 10 time faster than the main memory and uses the write though protocol. If the hit ratio for read ...
2.8k
views
commented
Jan 18, 2019
CO and Architecture
cache-memory
co-and-architecture
+
–
0
answers
15
Ace Test Series: Operating System - Virtual Memory
806
views
commented
Jan 18, 2019
Operating System
operating-system
virtual-memory
paging
memory-management
ace-test-series
+
–
0
answers
16
MadeEasy Full Length Test 2018: Graph Theory - Counting
The Number of Labelled possible graph given below ? what I did was → we doesn't remove any of the edge out of 4 = $\binom{4}{0}$ [Because a Graph is sub-graph of itself] we can remove any of one edge out of 4 = $\binom{4}{1}$ we can remove any ... out of 4 = $\binom{4}{2}$ similarly , $\binom{4}{3}$ , $\binom{4}{4 }$ then , add of the them
The Number of Labelled possible graph given below ? what I did was →we doesn’t remove any of the edge out of 4 = $\binom{4}{0}$ [Because a Graph is sub-graph of ...
808
views
commented
Jan 18, 2019
Graph Theory
graph-theory
discrete-mathematics
counting
made-easy-test-series
+
–
2
answers
17
ME- CBT1
Can anyone explain how this is to be solved?
Can anyone explain how this is to be solved?
772
views
answer selected
Jan 18, 2019
0
answers
18
Ace Academy Test series
If a 2 regular graph G has a perfect matching, then which of the following is NOT true? 1. G is a cycle graph 2. Chromatic number of G is 2 3. Every component of G is even cycle 4. G is a bipartite graph
If a 2 regular graph G has a perfect matching, then which of the following is NOT true?1. G is a cycle graph2. Chromatic number of G is 23. Every component of G is even c...
493
views
commented
Jan 16, 2019
0
answers
19
ME- CBT1
649
views
commented
Jan 15, 2019
CO and Architecture
co-and-architecture
addressing-modes
+
–
0
answers
20
Asynchronous counter (Applied course mock 3)
MOD-8 synchronous down counter MOD-8 asynchronous up counter MOD-10 asynchronous up counter MOD-8 asynchronous down counter Please explain why it is down counter?
MOD-8 synchronous down counterMOD-8 asynchronous up counterMOD-10 asynchronous up counterMOD-8 asynchronous down counterPlease explain why it is down counter?
1.2k
views
commented
Jan 15, 2019
Digital Logic
digital-counter
+
–
0
answers
21
Ace Academy Test series
Consider the multi selection problem: Given a set 'S' of n elements and set 'K' of 'r' ranks $K_{1}$, $K_{2}$, ....$K_{r}$. Find the $K_1^{th}$, $K_2^{th}$, ....$K_r^{th}$ smallest elements. Example K = {3,7,10,50} the problem ... of the most efficient algorithm to solve this problem is A. O(n.r) B. O($n^2$.log r) C. O(n) D. O(n.log r)
Consider the multi selection problem:Given a set 'S' of n elements and set 'K' of 'r' ranks $K_{1}$, $K_{2}$, ....$K_{r}$. Find the $K_1^{th}$, $K_2^{th}$, ....$K_r^{th}$...
477
views
commented
Jan 12, 2019
2
answers
22
Testbook Test Series: Digital Logic - Xor
Q,R,S are true for sure but how p is true ???
Q,R,S are true for sure but how p is true ???
1.5k
views
commented
Jan 3, 2019
Digital Logic
testbook-test-series
test-series
digital-logic
digital-circuits
+
–
1
answer
23
Digital Logical(Xor and Xnor Gates)
1. Xor and xnor are same in case number of inputs of odd? 2.If above is yes,then why do we say these ae complement? 3.Are these associative and commutative for more than 2 i/p? 4.How do we correctly define them for more than 2 i/p?Is it just that exor checks odd no. of 1's and xnor checks even number of 1'a? 5.Why exnor is called as even function?
1. Xor and xnor are same in case number of inputs of odd?2.If above is yes,then why do we say these ae complement?3.Are these associative and commutative for more than 2 ...
2.0k
views
commented
Jan 2, 2019
Digital Logic
digital-logic
digital-circuits
+
–
3
answers
24
TIFR CSE 2013 | Part B | Question: 3
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant? Hint: Use modulo $2$ arithmetic. $20160$ $32767$ $49152$ $57343$ $65520$
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant?Hint: Use modulo $2$ arithmetic.$20160$$32767$$49152$$57343$$65520$
4.6k
views
commented
Dec 29, 2018
Linear Algebra
tifr2013
linear-algebra
matrix
+
–
0
answers
25
made easy dbms tt1
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is correct? R1, R2 and R3 are relations, C1 and C2 are selection conditions and A1 ,A2 and A3 are attributes of Relations SHOULDN'T THE ANSWER BE (B)??? ... I USE condition A1 as A1<3 and condition A2 as A2<8 whereas RHS gives me A1 1 1 2 2 hence option D is wrong?
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is correct? R1, R2 and R3 are relations, C1 and C2 are select...
336
views
commented
Dec 22, 2018
0
answers
26
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
Dec 20, 2018
Theory of Computation
theory-of-computation
turing-machines
decidability
madeeasy-testseries-2018
+
–
5
answers
27
TIFR CSE 2019 | Part B | Question: 2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above
4.6k
views
commented
Dec 13, 2018
Algorithms
tifr2019
algorithms
minimum-spanning-tree
+
–
1
answer
28
Ace Test Series
Can any one explain I am not able to understand.
Can any one explain I am not able to understand.
1.1k
views
answered
Dec 11, 2018
1
answer
29
Ace Test Series
I think the answer is b) and in their solution also they are saying it b) but in option c) is correct. Can anyone confirm?
I think the answer is b) and in their solution also they are saying it b) but in option c) is correct. Can anyone confirm?
276
views
answered
Dec 11, 2018
7
answers
30
TIFR CSE 2019 | Part B | Question: 13
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a red or a blue house must be green. How many ways are there to paint the houses? $199$ $683$ $1365$ $3^{10}-2^{10}$ $3^{10}$
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a r...
5.0k
views
commented
Dec 9, 2018
Combinatory
tifr2019
combinatory
counting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register