Register
Filter

Answers by vamp_vaibhav

1 votes
1
madeeasy
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ? A.O(n) B. θ(n) C. Ω(n) D. None of these Ans is given C Please explain how to solve such questions
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ?A.O(n)B. θ(n)C. Ω(n)D. None of theseAns is given CPlease explain how to solve such questio...
1 votes
2
RBR_Cn
which of the protocol is flow control but not error control? 1)stop n wait 2) go back n 3)selective repeate 4)simplest
which of the protocol is flow control but not error control?1)stop n wait2) go back n3)selective repeate4)simplest
1 votes
3
# made easy demo test #Q 23
my answer 5 plz check but answer given 4
my answer 5 plz check but answer given 4
6 votes
5
MadeEasy Test Series: Databases - Transactions
Consider the following schedule: S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B) How many serial schedules conflict equal to schedules (S)?
Consider the following schedule:S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B)How many serial schedules conflict equal to schedules (S)?
0 votes
6
Test Series
Please explain why first option is wrong
Please explain why first option is wrong
2 votes
9
AVL tree rotations
1 votes
10
go back n
Assume while transmitting packets using GB5, every 4th packet is lost. Number of transmissions required to transmit 10 packets is ________
Assume while transmitting packets using GB5, every 4th packet is lost. Number of transmissions required to transmit 10 packets is ________
0 votes
12
SQL query
Answer given on virtual gate is a1,a3,a2 I'm getting a1,a3,a2,a1 as duplicate values are allowed in SQL. What is my mistake here ?
Answer given on virtual gate is a1,a3,a2I'm getting a1,a3,a2,a1 as duplicate values are allowed in SQL. What is my mistake here ?
0 votes
13
Linked List (Time Complexity)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? O(n) O(1) θ(n2) θ(n)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?O(n)O(1)θ(n2)θ...
2 votes
14
Dbms #self doubt
1. How many super key is possible if (a,bc,cd) is candidate key and R(ABCDEF) #DOUBT When we use veen digram why we are taking only intersections part only ??? Need help please explain ..
1. How many super key is possible if (a,bc,cd) is candidate key and R(ABCDEF)#DOUBTWhen we use veen digram why we are taking only intersections part only ??? Need help pl...
0 votes
15
Huffman coding
The following message is: GATE2018GAATTTEEEE22000011188 What is the average length of bits required for encoding each letter using Huffman coding___?
The following message is: GATE2018GAATTTEEEE22000011188What is the average length of bits required for encoding each letter using Huffman coding___?
1 votes
16
Bellman Ford Shortest path
Is the below statement correct: Bellman Ford finds all negative weight cycles in the graph. This is true or false?
Is the below statement correct:Bellman Ford finds all negative weight cycles in the graph.This is true or false?
1 votes
17
MADE EASY TEST SERIES
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’.What is the expected number of colliding pairs of elements...
1 votes
18
Made easy test series
How L2 is NOT regular and L3 is regular??? please explain
How L2 is NOT regular and L3 is regular??? please explain
0 votes
20
merge sort
0 votes
21
Binary search
How to get space complexity of binary search .. I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+ log n B = O(n) ...
How to get space complexity of binary search ..I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+...
0 votes
23
solve the recurrence using any method just solve it
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n) a)answer is justified b)answer is not justified c)cannot be determined d)none
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n)a)answer is justifiedb)answer is not justifiedc)cannot be determinedd)none
0 votes
24
Binary Search
I/p - Sorted array of n element O/p- find any two elements a and b such that (a+b)>1000 if lenear search is possible then go to Binary Search and Find time complexity ..?
I/p - Sorted array of n elementO/p- find any two elements a and b such that (a+b)>1000if lenear search is possible then go to Binary Search and Find time complexity ..?
0 votes
25
Please Solve this Q
In the following C function, let n >= m. int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? (A) (logn)? (B) (n) (C) (loglogn) (D) (sqrt(n))
In the following C function, let n >= m.int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m,n); }How many recursive calls are made by this function? (A) (logn)?(B...
0 votes
29
Lossless decomposition
Relation: R(ABCDE): FDs: A->BC, CD->E, B->D, E->A This relation is not in BCNF bcz of FD B->D. So how it make BCNF by decomposition so that the resultant decomposition is both lossless and dependency preserving ? plzz explain ?
Relation: R(ABCDE):FDs: A->BC, CD->E, B->D, E->AThis relation is not in BCNF bcz of FD B->D. So how it make BCNF by decomposition so that the resultant decomposition is b...
0 votes
30
DBMS Conditional Join
Does out put of conditional join contains duplicates?I know that it gives distinct in natural join as the projection operator removes duplicate rows. But in conditional join does this thing holds true?
Does out put of conditional join contains duplicates?I know that it gives distinct in natural join as the projection operator removes duplicate rows. But in conditional j...
Page: