Dark Mode

Questions by Chaitrasj

1 vote

3 answers

1

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 votes

1 answer

2

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

asked in Digital Logic Feb 1, 2019

743 views

0 votes

0 answers

3

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?

asked in Databases Jan 26, 2019

282 views

0 votes

0 answers

4

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

asked in Graph Theory Jan 16, 2019

496 views

0 votes

2 answers

5

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

asked in Graph Theory Jan 14, 2019

750 views

0 votes

0 answers

6

asked in CO and Architecture Jan 14, 2019

642 views

0 votes

0 answers

7

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)

asked in Algorithms Jan 11, 2019

469 views

0 votes

0 answers

8

Time complexity
What would be the answer for this? As per my analysis, i think it's D. big omega (n). We can't say B. O(n), because g's upper bound is f, and f's lower bound is n, so definitely f can go above n, say n log n, so if we say g as O(n) ... say because f has lower bound n, but g can go below n say log n, Since big oh and big Omega r not n, so not even theta of n.

asked in Algorithms Nov 29, 2018

430 views

0 votes

0 answers

9

Self doubt- Undecidability
L={TM | TM accepts only '11'} A.Is this language an REL? B. Is the complement of L REL or not REL? If REL is it Decidable or Semidecidable? I think there is no logic to reject other string apart from '11', hence we cannot ... so I think L is not REL please somebody verify. But i have doubt in complement of this language is it REL or not REL? Thanks

asked in Theory of Computation Nov 25, 2018

606 views

0 votes

1 answer

10

When to use word access time and when to use block access time in access time calculation.
Hello, I came across this question when practicing from a gate app. My question is here simultaneous access is used and hence we are transferring from cache to cpu if hit or main memory to ... is needed. Added the image of question. Thanks https://gateoverflow.in/?qa=blob&qa_blobid=13957411914537045045

asked in CO and Architecture Oct 4, 2018

198 views