Dark Mode

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?

commented in Set Theory & Algebra May 5, 2019

8.1k views

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?

commented in Probability Apr 14, 2019

477 views

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)$

commented in Written Exam Apr 14, 2019

786 views

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)$

commented in Written Exam Apr 14, 2019

408 views

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?

asked in Combinatory Mar 11, 2019

1.8k views

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; }

commented in Programming in C Mar 5, 2019

1.2k views

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

commented in Digital Logic Feb 1, 2019

729 views

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) ?

commented in Databases Jan 28, 2019

3.4k views

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?

commented in Databases Jan 26, 2019

280 views

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)$

commented in Algorithms Jan 24, 2019

6.2k views

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)$

commented in Quantitative Aptitude Jan 21, 2019

11.0k views

0 answers

12

ACE Test Series

commented in Mathematical Logic Jan 19, 2019

256 views

0 answers

13

Ace test series

commented in Mathematical Logic Jan 19, 2019

323 views

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

commented in CO and Architecture Jan 18, 2019

2.8k views

0 answers

15

Ace Test Series: Operating System - Virtual Memory

commented in Operating System Jan 18, 2019

802 views

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

commented in Graph Theory Jan 18, 2019

803 views

2 answers

17

ME- CBT1
Can anyone explain how this is to be solved?

answer selected in Graph Theory Jan 18, 2019

735 views

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

commented in Graph Theory Jan 16, 2019

473 views

0 answers

19

commented in CO and Architecture Jan 15, 2019

623 views

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?

commented in Digital Logic Jan 15, 2019

1.2k views

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)

commented in Algorithms Jan 12, 2019

461 views

2 answers

22

Testbook Test Series: Digital Logic - Xor
Q,R,S are true for sure but how p is true ???

commented in Digital Logic Jan 3, 2019

1.5k views

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?

commented in Digital Logic Jan 2, 2019

2.0k views

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$

commented in Linear Algebra Dec 29, 2018

4.5k views

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?

commented in Databases Dec 22, 2018

323 views

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

commented in Theory of Computation Dec 20, 2018

2.4k views

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

commented in Algorithms Dec 13, 2018

4.5k views

1 answer

28

Ace Test Series
Can any one explain I am not able to understand.

answered in Theory of Computation Dec 11, 2018

1.0k views

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?

answered in Theory of Computation Dec 11, 2018

268 views

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}$

commented in Combinatory Dec 9, 2018

4.9k views