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 Deepalitrapti
1
answer
1
ME test Series
315
views
answered
Nov 16, 2019
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$ ?
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 $...
11.2k
views
commented
Nov 11, 2019
Algorithms
algorithms
binary-search
time-complexity
+
–
1
answer
3
Ace Test Series 2019: Theory Of Computation - Push Down Automata
469
views
answered
Oct 30, 2019
Theory of Computation
theory-of-computation
pushdown-automata
ace-test-series
+
–
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
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 foll...
14.5k
views
commented
Sep 9, 2019
DS
data-structures
tree
+
–
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
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, w...
2.2k
views
commented
Jul 27, 2019
Operating System
memory-management
+
–
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.
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...
2.6k
views
commented
Jul 20, 2019
Digital Logic
digital-logic
ripple-counter-operation
sequential-circuit
flip-flop
+
–
1
answer
7
Seriazability
522
views
commented
Jul 18, 2019
1
answer
8
MadeEasy Test Series: Computer Networks - Application Layer Protocols
How to Solve this question ? I am getting answer as 450.
How to Solve this question ?I am getting answer as 450.
1.0k
views
commented
Jul 14, 2019
Computer Networks
computer-networks
application-layer-protocols
made-easy-test-series
+
–
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?
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?
530
views
commented
Jul 12, 2019
Programming in C
made-easy-test-series
programming-in-c
programming
+
–
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?
Consider the following program segmentint main ( ){char ∗ str = “GATECS”;printf (“%d”, madeeasy (str));return 0;}int madeeasy (int ∗ p1){int ∗ p2 = p1;while...
715
views
answered
Jul 3, 2019
Programming in C
data-structures
made-easy-test-series
programming-in-c
pointers
+
–
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
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 mini...
1.2k
views
commented
Jul 3, 2019
Programming in C
data-structures
tree
avl-tree
+
–
0
answers
12
Expectation and BST
Here how did we find the number of comparisons for any number.
Here how did we find the number of comparisons for any number.
946
views
commented
Jul 2, 2019
Algorithms
data-structures
binary-search-tree
+
–
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
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]+...
12.1k
views
commented
Jul 2, 2019
Algorithms
gatecse-2014-set3
algorithms
identify-function
easy
+
–
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
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...
494
views
commented
Jun 18, 2019
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.
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 ver...
2.7k
views
commented
Jun 18, 2019
Graph Theory
discrete-mathematics
graph-theory
ace-booklet
+
–
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
P1 terminates but P2 does notP2 terminates but P1 does notBoth P1 and P2 terminateNeither P1 nor P2 terminate
1.5k
views
commented
Jun 17, 2019
Operating System
operating-system
made-easy-test-series
concurrency
process-synchronization
+
–
1
answer
17
Synchronisation os ace
How 4th statement is true???
How 4th statement is true???
414
views
commented
Jun 15, 2019
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
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 Q...
894
views
commented
Jun 15, 2019
1
answer
19
Deadlock os ace
459
views
commented
Jun 15, 2019
1
answer
20
Toc me test me me
Minimum ba how can accept?
Minimum ba how can accept?
256
views
asked
Jun 13, 2019
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 ... exclusion, progress and bounded waiting d None of these The answer key says c but please explain how is there bounded waiting.
Assume that 2 processes P0 and P1 share one global boolean array flag[] and integer variable 'turn'. Initially flag[0] and flag are zero.Consider the following code exec...
1.1k
views
commented
Jun 13, 2019
2
answers
22
Mamory os me
438
views
answer selected
Jun 12, 2019
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______
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__...
3.0k
views
commented
Jun 8, 2019
Compiler Design
compiler-design
static-single-assignment
intermediate-code
+
–
0
answers
24
Cd me test
356
views
asked
Jun 7, 2019
4
answers
25
Nfa dfa toc ace 1
1.1k
views
commented
Jun 6, 2019
1
answer
26
Toc nfa dfa re ace
273
views
asked
Jun 6, 2019
0
answers
27
Equivalence class toc made easy
How comes 3 states i got 4 states
How comes 3 states i got 4 states
878
views
commented
Jun 5, 2019
Theory of Computation
bad-question
+
–
1
answer
28
MadeEasy CBT 2 q25
Please explain Statement S3?
Please explain Statement S3?
328
views
answered
Jan 28, 2019
Algorithms
algorithms
quick-sort
numerical-answers
made-easy-test-series
+
–
1
answer
29
Functions
354
views
commented
Dec 19, 2018
0
answers
30
Allocation
250
views
asked
Dec 18, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register