Dark Mode

Recent activity by Deepalitrapti

1 answer

1

answered in Theory of Computation Nov 17, 2019

208 views

2 answers

2

Self doubt in Binary search Algo
The average successful search time taken by binary search on a sorted array of $10$ items? $2.6$ $2.7$ $2.8$ $2.9$ Answer is $2.9$ My doubt:- But when I am using $log_2n$ for $n = 10$ it is not equal to $2.9$, and $log_210 = 3.3219$ ?

commented in Algorithms Nov 11, 2019

9.0k views

1 answer

3

Ace Test Series 2019: Theory Of Computation - Push Down Automata

answered in Theory of Computation Oct 30, 2019

338 views

2 answers

4

Tree question
In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right child as non-empty. Which of the following is true about inorder successor needed in delete operation? Inorder Successor ... Inorder successor may be an ancestor of the node Inorder successor is always either a leaf node or a node with empty right child

commented in DS Sep 10, 2019

11.7k views

1 answer

5

IES ESE
A disc drive has a average seek time of 10ms, 32 sectors on each track and 512 bytes per sector. If the average time to read 8kbytes of continuously stored data is 20ms, what is the rotational speed of the disc drive? 3600 rpm 6000 rpm 3000 rpm 2400 rpm

commented in Operating System Jul 28, 2019

1.8k views

0 answers

6

Digital Logic made easy
Consider the circuit given below: MSB and LSB of mod 10 ripple counter act as clock to ripple down and up counter respectively. Initially all the counters were cleared and output of comparator was A=B. The clock pulse is applied. Find the minimum no of clock pulses required to make A=B again.

commented in Digital Logic Jul 21, 2019

1.9k views

1 answer

7

commented in Databases Jul 18, 2019

327 views

1 answer

8

MadeEasy Test Series: Computer Networks - Application Layer Protocols
How to Solve this question ? I am getting answer as 450.

commented in Computer Networks Jul 15, 2019

688 views

1 answer

9

MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explained detialed execution of this code, I am not getting how int stored in char, like we can interchange using ASCII but still cant store right?

commented in Programming Jul 13, 2019

344 views

2 answers

10

MadeEasy Test Series: Programming & DS - Programming In C
Consider the following program segment int main ( ) { char ∗ str = GATECS ; printf ( %d , madeeasy (str)); return 0; } int madeeasy (int ∗ p1) { int ∗ p2 = p1; while (∗++p1); return (p1 - p2); } ... of data type int occupies 2 bytes. Is this question right because according to me types are not same when we pass argument inside madeeasy?

answered in Programming Jul 3, 2019

512 views

2 answers

11

DS AVL Trees
Consider the tree T in which left subtree contains half of the maximum number of nodes possible in the avl tree of height 6 and right subtree contains one 3rd of the minimum number of nodes possible in Avl tree of height 6.What will be total number of nodes in T? Edit:- I am getting 75.5 as answer.Now i am not sure whether to pick 75 ot 76

commented in Programming Jul 3, 2019

965 views

0 answers

12

Expectation and BST
Here how did we find the number of comparisons for any number.

commented in Algorithms Jul 3, 2019

626 views

3 answers

13

GATE CSE 2014 Set 3 | Question: 10
Let $A$ be the square matrix of size $n \times n$. Consider the following pseudocode. What is the expected output? C=100; for i=1 to n do for j=1 to n do { Temp = A[i][j]+C; A[i][j] = A[j][i]; A[j][i] = ... $A$ Adding $100$ to the upper diagonal elements and subtracting $100$ from lower diagonal elements of $A$ None of the above

commented in Algorithms Jul 2, 2019

10.0k views

0 answers

14

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 Jun 19, 2019

246 views

2 answers

15

#ACE_ACADEMY_DISCRETE_MATHS_BOOKLET.
Which of the following is not true? (a) Number of edge-disjoint Hamiltonian cycles in $K_7$ is $3$ (b) If $G$ is a simple graph with $6$ vertices and the degree of each vertex is at least $3$, then the Hamiltonian cycle exists in ... simple graph with $5$ vertices and $7$ edges, then the Hamiltonian cycle exists in $G$ Please help me understand all the options.

commented in Graph Theory Jun 19, 2019

2.0k views

3 answers

16

MadeEasy Test Series: Operating System - Process Synchronization
P1 terminates but P2 does not P2 terminates but P1 does not Both P1 and P2 terminate Neither P1 nor P2 terminate

commented in Operating System Jun 17, 2019

1.2k views

1 answer

17

Synchronisation os ace
How 4th statement is true???

commented in Operating System Jun 15, 2019

290 views

0 answers

18

TOC Language
Consider the following statements regarding alphabet and language inequalities. Which of the above statements are always true? Answer is S1. Why S2 is False ? It's ME Test Que

commented in Theory of Computation Jun 15, 2019

573 views

1 answer

19

Deadlock os ace

commented in Operating System Jun 15, 2019

348 views

1 answer

20

Toc me test me me
Minimum ba how can accept?

asked in Theory of Computation Jun 14, 2019

192 views

1 answer

21

Made easy operating system
Assume that 2 processes P0 and P1 share one global boolean array flag[] and integer variable 'turn'. Initially flag[0] and flag[1] are zero.Consider the following code executed by processes Pi where i=0 or 1: while(true) { flag[i]=true ... Mutual exclusion, progress and bounded waiting d None of these The answer key says c but please explain how is there bounded waiting.

commented in Operating System Jun 13, 2019

765 views

2 answers

22

answer selected in Operating System Jun 12, 2019

280 views

5 answers

23

Static Single Assignment form
Consider the following code generation: a=b+c; c=a+x; d=b+c; b=a+x; The minimum no. of total variables required to convert the above code to static single assignment form is______

commented in Compiler Design Jun 8, 2019

1.8k views

0 answers

24

asked in Compiler Design Jun 8, 2019

212 views

4 answers

25

Nfa dfa toc ace 1

commented in Theory of Computation Jun 6, 2019

716 views

1 answer

26

Toc nfa dfa re ace

asked in Theory of Computation Jun 6, 2019

187 views

0 answers

27

Equivalence class toc made easy
How comes 3 states i got 4 states

commented in Theory of Computation Jun 5, 2019

611 views

1 answer

28

MadeEasy CBT 2 q25
Please explain Statement S3?

answered in Algorithms Jan 28, 2019

234 views

1 answer

29

commented in Set Theory & Algebra Dec 19, 2018

180 views

0 answers

30

asked in Programming Dec 19, 2018

158 views