Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
User007
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by User007
1
answer
1
GRAPH THEORY
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False? 1. G is connected. 2. G doesn't have cycles. 3. G contain n-1 edges.
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False?1. G is connected.2. G doesn't have cycles.3. G contai...
509
views
asked
Sep 27, 2017
Graph Theory
graph-theory
graph-connectivity
true-false
+
–
2
answers
2
MST
Let T be a MST of G.Suppose that we decreased the weight of one of the edge present in G but not in T.How much time will it take to construct MST for modified graph G.
Let T be a MST of G.Suppose that we decreased the weight of one of the edge present in G but not in T.How much time will it take to construct MST for modified graph G.
2.9k
views
answer edited
Sep 27, 2017
Algorithms
algorithms
minimum-spanning-tree
time-complexity
+
–
10
answers
3
GATE CSE 2014 Set 3 | Question: 42
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if ... implementation of binary search. It will always find the maximum element in $listA$. It will return −$1$ even when $x$ is present in $listA$.
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order.int ProcessArray(int *listA, int x, int n) { in...
13.4k
views
commented
Apr 25, 2017
DS
gatecse-2014-set3
data-structures
array
easy
+
–
4
answers
4
GATE CSE 2003 | Question: 63, ISRO2009-25
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements...
20.1k
views
commented
Apr 25, 2017
DS
gatecse-2003
data-structures
easy
isro2009
binary-search-tree
+
–
3
answers
5
GATE IT 2007 | Question: 17
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute $b^n \bmod{m}, 0 \leq b, n \leq m$ ? $O(\log n)$ $O(\sqrt n)$ $O\Biggl (\frac{n}{\log n} \Biggr )$ $O(n)$
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications require...
8.7k
views
commented
Apr 23, 2017
Algorithms
gateit-2007
algorithms
time-complexity
normal
+
–
7
answers
6
GATE IT 2005 | Question: 34
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the greatest common divisor of $m$ and $n$. $p(q - 1)$ $pq$ $\left ( p^{2}-1 \right ) (q - 1)$ $p(p - 1) (q - 1)$
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the great...
8.0k
views
commented
Apr 21, 2017
Set Theory & Algebra
gateit-2005
set-theory&algebra
normal
number-theory
+
–
8
answers
7
GATE CSE 2017 Set 1 | Question: 50
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) ... speedup (correct to two decimal places) achieved by EP over NP in executing $20$ independent instructions with no hazards is _________ .
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). T...
18.9k
views
commented
Feb 16, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
0
answers
8
MADE EASY TEST SERIES
Database table (R) consist 1000 records. The number of minimum B+ tree index blocks required to build dense B+tree index for relation (R) are _________. Assume order of B+ tree root node atleast 1 key atmost 12 key and other nodes of B+ tree order atleast 6 keys and atmost 12 keys.
Database table (R) consist 1000 records. The number of minimum B+ tree index blocks required to build dense B+tree index for relation (R) are _________. Assume order of B...
250
views
asked
Feb 8, 2017
2
answers
9
MADE EASY TEST SERIES
Consider 6 stage pipeline (S1, S2, S3, S4, S5, S6) which allows all the instructions except branch instructions. Processor stops fetching the following instruction after the branch until the target address is available. Target address is available in the S4 stage. ... the stages are balanced with a 2.3 GHz clock. MIPS rate of the processor is ________ (in 2 decimal places).
Consider 6 stage pipeline (S1, S2, S3, S4, S5, S6) which allows all the instructions except branch instructions. Processor stops fetching the following instruction after ...
1.3k
views
asked
Feb 8, 2017
1
answer
10
MADE EASY TEST SERIES
354
views
commented
Feb 7, 2017
1
answer
11
ME test
Consider a function AVLConstruction(). Which takes an array n elements as input in Ascending order and produce output as AVL tree for given array. AVLConstruction() function selects the median of the array and put it as the Root element. Recursively build Left subtree from the left half of ... array. what will be the complexity of AVLConstruction()? A) O(nlogn) B) O(n2) C) O(n3) D) O(n)
Consider a function AVLConstruction(). Which takes an array n elements as input in Ascending order and produce output as AVL tree for given array. AVLConstruction() funct...
919
views
commented
Feb 7, 2017
DS
data-structures
avl-tree
time-complexity
+
–
0
answers
12
MADE EASY TEST SERIES
Made easy says answer is option C but i doubt it. Can somebody confirm ?
Made easy says answer is option C but i doubt it. Can somebody confirm ?
463
views
commented
Feb 4, 2017
1
answer
13
database doubt
if two entities A and B are connected using total participation with relation R then minimum number of tables required in relational model is?
if two entities A and B are connected using total participation with relation R then minimum number of tables required in relational model is?
690
views
commented
Feb 4, 2017
1
answer
14
made easy test series
447
views
commented
Feb 4, 2017
1
answer
15
MADE EASY TEST SERIES
Which of the following languages over the alphabet Σ = {a, b, 0} is regular ?
Which of the following languages over the alphabet Σ = {a, b, 0} is regular ?
327
views
commented
Feb 4, 2017
0
answers
16
MADE EASY TEST SERIES
Consider the network given below : Each node in the graph represents the router. Each node maintains its routing table to send a packet to its destination with minimum cost. Initially routing table is empty. The table is filled as every node ... routing table F' after each node has twice reported the information it had in the proceeding steps in its immediate neighbours?
Consider the network given below :Each node in the graph represents the router. Each node maintains its routing table to send a packet to its destination with minimum cos...
204
views
asked
Feb 3, 2017
0
answers
17
MADE EASY TEST SERIES
Can somebody confirm whether below given solution is correct or not? I also got answer 12 but not by following below given method.
Can somebody confirm whether below given solution is correct or not? I also got answer 12 but not by following below given method.
269
views
asked
Feb 3, 2017
1
answer
18
MADE EASY TEST SERIES
The maximum size of operator stack, when converting the following infix expression to postfix expression? Assume that has the highest precedence and follows right associativity is _______. Infix:
The maximum size of operator stack, when converting the following infix expression to postfix expression? Assume that has the highest precedence and follows right associ...
2.1k
views
commented
Feb 3, 2017
2
answers
19
MADE EASY TEST SERIES
Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1} Which of the following is true ? A> L2 need not be CFL B> L2 will be regular C> L2 will be CFL D> None of the above
Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1}Which of the following is true ?A L2 ...
658
views
commented
Feb 3, 2017
1
answer
20
MADE EASY TEST SERIES
Which of the following statement false for B-tree and B+ tree index. 1> B+ tree index faster for range queries compare to B tree index. 2> If disk block allocated for B+ tree index and same size disk block allocated for B tree index. Then number of ... B tree index less than equal to I/O cost of B+ tree index for random access of some key from set of distinct keys.
Which of the following statement false for B-tree and B+ tree index.1 B+ tree index faster for range queries compare to B tree index.2 If disk block allocated for B+ tre...
608
views
asked
Feb 3, 2017
1
answer
21
Number of RTTs
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB. The receiver advertise its window at the starting of communication to be 24 KB. Assume the size of ... says 10rtts since after 9 RTTs we would be able to send full 24kb window Can somebody provide some refrence links for this
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB. The receiver ad...
1.0k
views
commented
Jan 31, 2017
Computer Networks
computer-networks
+
–
0
answers
22
MADE EASY TEST SERIES
Consider the following schedule Consider the following statements : S1 : Schedule(S) is conflict serializable schedule. S2 : Schedule(S) is allowed by 2PL. S3 : Schedule(S) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
Consider the following scheduleConsider the following statements :S1 : Schedule(S) is conflict serializable schedule.S2 : Schedule(S) is allowed by 2PL.S3 : Schedule(S) i...
339
views
commented
Jan 29, 2017
1
answer
23
MADE EASY TEST SERIES
Match List-I with List-II and select the correct answer using the codes given below the lists: List-I List-II A. Stop and Wait ARQ 1. Each frame sent or resent needs a timer, which means that the timer needs to be numbered. B. Go-back N ARQ 2. Ack all sent ... 1 (c) 3 4 1 (d) 2 1 4 Below given snapshot is the solution provided by Made easy. Please point out the errors if any.
Match List-I with List-II and select the correct answer using the codes given below the lists:List-IList-IIA. Stop and Wait ARQ1. Each frame sent or resent needs a timer,...
885
views
commented
Jan 29, 2017
0
answers
24
MADE EASY TEST SERIES
Consider the following schedule Consider the following statements : S1 : Schedule(S) is conflict serializable schedule. S2 : Schedule(S) is allowed by 2PL. S3 : Schedule(S) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
Consider the following scheduleConsider the following statements :S1 : Schedule(S) is conflict serializable schedule.S2 : Schedule(S) is allowed by 2PL.S3 : Schedule(S) i...
152
views
asked
Jan 29, 2017
0
answers
25
MADE EASY TEST SERIES
Consider the following recursive function which is used by dynamic programming. Assume for every function call T(i) it checks the table first, if its value is already computed it retrieves the value from table. Otherwise it calls a recursive function call ... of function calls that need the support of stack to complete the execution of the function T(12) are __________ .
Consider the following recursive function which is used by dynamic programming.Assume for every function call T(i) it checks the table first, if its value is already comp...
168
views
commented
Jan 29, 2017
0
answers
26
MADE EASY TEST SERIES
If 1024 byte block is allocated for either B-tree index or B+tree index with block pointer size 12 bytes, record pointer size 10 bytes, search key size 15 bytes and order P defined max child pointers in B/B+tree index. The difference between ... than Block pointer's size? " Even if we assume that Made easy question is correct, is the below given sloution correct?
If 1024 byte block is allocated for either B-tree index or B+tree index with block pointer size 12 bytes, record pointer size 10 bytes, search key size 15 bytes and order...
511
views
asked
Jan 29, 2017
1
answer
27
MADE EASY TEST SERIES
Consider the following C program segment: struct node What is the output of above C program when it runs on a root node of a binary tree? prints nodes at K distance from root node. print nodes of Kth level of binary tree. Both (a) and (b) None of these
Consider the following C program segment:struct nodeWhat is the output of above C program when it runs on a root node of a binary tree?prints nodes at K distance from roo...
963
views
commented
Jan 28, 2017
DS
binary-tree
+
–
0
answers
28
MADE EASY TEST SERIES
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. What will be the worst case time complexity?
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. What will be the wors...
181
views
asked
Jan 25, 2017
1
answer
29
MADE EASY TEST SERIES
Computer A has 30 MB to send on a network and transmits the data in burst at 6 Mbps. The maximum transmission rate across routers in the network is 4 Mbps. If computer A’s transmission is shaped using a leaky bucket. The capacity that the queue in the bucket must hold so that no data is discarded is ______ (in MB) upto 1 decimal place.
Computer A has 30 MB to send on a network and transmits the data in burst at 6 Mbps. The maximum transmission rate across routers in the network is 4 Mbps. If computer A�...
5.2k
views
asked
Jan 25, 2017
Computer Networks
computer-networks
network-switching
numerical-answers
made-easy-test-series
+
–
1
answer
30
MADE EASY TEST SERIES
15, 20, 25, 30 15, 20, 15, 20 15, 15, 15, 15 None of these
15, 20, 25, 3015, 20, 15, 2015, 15, 15, 15None of these
420
views
commented
Jan 21, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register