The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged madeeasytestseries
0
votes
0
answers
1
Test series
Can someone explain this problem? Thanks in advance
asked
Jun 17
in
Theory of Computation
by
Kalpataru Bose
(
337
points)

42
views
madeeasytestseries
testbooktestseries
theoryofcomputation
regularexpressions
+1
vote
1
answer
2
Made Easy Doubt 4
Consider a relation r1(A, B, C), r2(C, D, E) and r3(F, G) with primary keys A, C and F respectively. Assume that r1 has 150 tupples, r2 has 100 tupples and r3 has 75 tupples. The number of resultant tuple in are ________.
asked
Jun 14
in
Databases
by
Na462
Active
(
3.3k
points)

60
views
madeeasytestseries
databases
0
votes
0
answers
3
Made Easy Doubt 3
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf ... responsible of leaf node split up as a result of these insertion is ________. (Assume right baising) Soln. Please Verify my solution :
asked
Jun 14
in
Databases
by
Na462
Active
(
3.3k
points)

35
views
madeeasytestseries
databases
bplustrees
0
votes
0
answers
4
Made Easy Question 2
Consider relation R' and S' have n' and m' tuples, respectively. Choose the best matching between ListI (Expression) and ListII (Maximum number of tuple): Soln. According to me Answer should be Option C. 1.R union S = m+n (easy nothing to say) 2. Say Relations are like: R(A ... 3 3 4 2 3 3 3 5 4 3 3 3 6 Now in R natual join S = m * n So option C should suffice isn't it ?
asked
Jun 14
in
Databases
by
Na462
Active
(
3.3k
points)

31
views
madeeasytestseries
databases
0
votes
2
answers
5
Made Easy Question 1
Consider The Following Schema: The minimum number of tables needed to represent E1 , E2and E3 are ______ Soln. According to me Answer should be 2 because We can merge 1. R1 and E2 in one Relation 2. E1,R2,E3 in one because its total participation on both the sides. So total 2 Tables Should be Enough.
asked
Jun 14
in
Databases
by
Na462
Active
(
3.3k
points)

35
views
madeeasytestseries
databases
erdiagram
0
votes
2
answers
6
#test series
Consider a machine with byte addressable memory 32 bits virtual addresses, 32 bits physical addresses and 4 KB page size. If a twolevel page table system is used where each page table occupies one page and page table entries of 4 B each, then the memory overhead for this machine is ________ KB please explain.
asked
Jun 12
in
Operating System
by
Nancy Pareta
(
121
points)

24
views
madeeasytestseries
0
votes
0
answers
7
MadeEasy Advance TestSeries
Let G be a grammar with the following productions: If LR(1) parser is used to construct the DFA using the above productions, then how many lookaheads are present for an item T → .T * F in the initial state ________.
asked
Jun 12
in
Compiler Design
by
syncronizing
(
103
points)

29
views
madeeasytestseries
0
votes
0
answers
8
Made Easy Test Series
The instruction pipeline of RISC processor has 200 instructions in which 100 are performing addition, 25 performing division and 75 performing multiplications, where Execution state for addition take 1 clock cycle,multiplication take 3 and division take 5. Assume pipeline has ... 5+ (75+51)*3 Am i doing wrong? Solution with explanation of formulae being used will be welcomed.
asked
Jun 9
in
CO & Architecture
by
Subham Nagar
Junior
(
539
points)

40
views
madeeasytestseries
computer
coandarchitecture
pipelining
0
votes
1
answer
9
Made Easy test series
Consider two Person (Person X, Person Y). Person X who was given a problem to calculate A1 A2 A3 with dimension 3 100, 100 2 and 2 2 in minimum multiplication. Person X is the knows only Greedy algorithm (multiply ... . Person Y solved the same problem using Dynamic algorithm with M2multiplications. How many number of multiplications saved by Person Y than Person X?
asked
Jun 2
in
Algorithms
by
Ayesha_S
(
21
points)

55
views
madeeasytestseries
algorithms
0
votes
0
answers
10
madeeasy test series
What is the best data structure to implement topological sort on directed graph? The answer given is Queue. But we can implement it using dfs also, so why the best data structure is Queue and not Stack?
asked
Jun 2
in
Algorithms
by
Ayesha_S
(
21
points)

20
views
madeeasytestseries
algorithms
topologicalsort
0
votes
2
answers
11
Made Easy Question
Consider the following schedule: How many serial schedules view equal to schedule (S)? Answer: 10 Approach Please??
asked
May 18
in
Databases
by
Na462
Active
(
3.3k
points)

51
views
madeeasytestseries
+1
vote
1
answer
12
Made Easy
Please Justify Statements which are true and which are false by an Example: Consider the following statements : S1 :While performing quick sort at any iteration only 1 element can be present at its correct position. S2 : The running time of Radix Sort is effectively ... only P' passes in order to solve the single source shortest path problem on G'. Which of the following is correct ?
asked
Apr 30
in
Algorithms
by
Na462
Active
(
3.3k
points)

27
views
madeeasytestseries
0
votes
0
answers
13
Made Easy Test Series
Consider the following graph: If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________. My Strategy : According to me a = 11 (because if we see the cycle ABD then the edge ... 10) and likewise g = 11,f = 12,b = 8,e = 8,d = 9,c = 6.Hence Sum is = 65 Made Easy Solution :
asked
Apr 30
in
Algorithms
by
Na462
Active
(
3.3k
points)

55
views
madeeasytestseries
0
votes
1
answer
14
Made Easy
Consider the following message: The number of bits required for huffman encoding of the above message are __________? My Strategy: But the answer given is 52bits i used standard Algorithem Made Easy Solution :
asked
Apr 30
in
Algorithms
by
Na462
Active
(
3.3k
points)

60
views
madeeasytestseries
huffmancode
+1
vote
1
answer
15
MADE EASY TEST SERIES 2017
Consider the sliding window protocol used at transport layer to transfer the segments, the receiver sends ACK K + 1 when it receives a packet with sequence number K and window size is denoted by W . Assume the sender's packets start with sequence ... sequence number greater than W is sent by sender iff a new (previously unseen) ACK arrives. (D) None of the above
asked
Apr 30
in
Computer Networks
by
Kartavya Kothari
(
81
points)

71
views
madeeasytestseries
computernetworks
testseries
0
votes
1
answer
16
MADE EASY 2017 TEST SERIES
Consider the following statements, when a distance vector routing protocol finding minimum cost paths suffers from count to infinity problem: S1 : The counttoinfinity problem may arise in distance vector routing protocol, when network gets disconnected. S2 : The count to infinity problem ... is correct? (A) Only S1 AND S3 (B) Only S2 AND S3 (C) Only S2 (D) All of them
asked
Apr 30
in
Computer Networks
by
Kartavya Kothari
(
81
points)

61
views
madeeasytestseries
computernetworks
testseries
0
votes
2
answers
17
MADE EASY TEST SERIES 2018
Consider the following services in network security: 1. Authentication of message 2. Integrity 3. Privacy 4. Non repudiation Which of the security services is/are not provided by digital signature?
asked
Apr 30
in
Computer Networks
by
Kartavya Kothari
(
81
points)

50
views
madeeasytestseries
+2
votes
1
answer
18
Made Easy Online Test Series:Database1 Gate 2019
asked
Apr 7
in
Databases
by
Sona Barman
Active
(
1.1k
points)

111
views
madeeasytestseries
databases
normalisation
super
keys
0
votes
1
answer
19
Made easy test
asked
Apr 4
in
Probability
by
Prince Sindhiya
Junior
(
707
points)

73
views
madeeasytestseries
0
votes
1
answer
20
test series
Consider the Turing machine when the input is still left and the turing machine halts will it accept it by halting or will it process the entire input left??
asked
Feb 3
in
Theory of Computation
by
Venkat Sai
Active
(
3.2k
points)

68
views
madeeasytestseries
0
votes
0
answers
21
#testseries
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x + 7 is ________.
asked
Feb 2
in
Operating System
by
Sukhdip Singh
(
193
points)

73
views
madeeasytestseries
0
votes
1
answer
22
made easy
nice ques from CN,can anyone solve this?
asked
Feb 2
in
Computer Networks
by
raviyogi
Active
(
2.6k
points)

110
views
madeeasytestseries
computernetworks
0
votes
0
answers
23
Made Easy Mock Test
The minimum frame length (in bytes) of the cable of length 240 meter for transmitting data at a rate of 500 Kbps in IEEE 802.3 LAN is __________. (Assume the signal speed in the cable to be, 2,00,000 m/s)
asked
Feb 1
in
Computer Networks
by
_jerry
(
353
points)

104
views
madeeasytestseries
computernetworks
0
votes
0
answers
24
GeeksforGeeks Mock test 1
Consider the following collection of relation schemes: professor(profname, deptname) department(deptname, building) committee(profname,commname) Find all the professors who are in exactly (i.e., no more and no less) all those committees that Professor Smith is ... σprofname = Smith(committee)) R3 < Πcommname(committee)  R2 (committee / R2)  Πprofname(committee ⋈ R3)
asked
Feb 1
in
Databases
by
Utsav09
Active
(
1.1k
points)

66
views
madeeasytestseries
geekmock2017
databases
sql
relationalalgebra
0
votes
0
answers
25
ME test series
Consider the size of congestion window of a TCP connection be 36 KB when a timeout occurs. The round trip time of the connection is 200 μsec and the maximum segment size used is 2 KB. What is the time taken by the TCP connection to get back to 36 KB congestion window?
asked
Feb 1
in
Computer Networks
by
sumit chakraborty
Active
(
1.2k
points)

41
views
madeeasytestseries
computernetworks
0
votes
0
answers
26
IPv6 addressing
Hi Guys, Could you please provide justification for the mentioned options ?
asked
Jan 31
in
Computer Networks
by
Chhotu
Boss
(
10.5k
points)

62
views
ipv6
computernetworks
madeeasytestseries
0
votes
0
answers
27
TestsSeries Question
PS : This question is similar to GATE200482, but different, so plz donot close it with duplicate Note, and help in answering
asked
Jan 31
in
Algorithms
by
Salazar
Active
(
1.1k
points)

63
views
programminginc
madeeasytestseries
0
votes
0
answers
28
Made Easy Mock 1
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front ... Ο(n) time. Both the statements are true. HOW? Kindly provide a detailed explanation. I am unable to solve such questions.
asked
Jan 31
in
DS
by
_jerry
(
353
points)

94
views
madeeasytestseries
datastructure
stack
queues
0
votes
1
answer
29
made easy test
Assume that for a certain processor, main memory access time is 100 nanoseconds and cache memory access time is 20 nanoseconds. Suppose while running a program, it was observed that 25% of the processor’s requests result in a cache miss. What is the average access time in nanoseconds? A) 75 B) 80 C) 40 D) 45
asked
Jan 31
in
CO & Architecture
by
khedkar devidas
Junior
(
557
points)

38
views
madeeasytestseries
Page:
1
2
3
4
5
6
...
32
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IISc CSA and CDCS written test and interview Experince
IIIT Hyderabad Interview Experience
My failure, Oh wait SUCCESS journey
ALGORITHMS CHECKLIST:
A Failure who got into IISc
Follow @csegate
Gatecse
Recent questions tagged madeeasytestseries
Recent Blog Comments
Sir I didn't get an email for GO classroom, ...
any one with marks less than 125 selected?
Thank you @Arjun Sir, @NamitaAIR1, @Priyanka, ...
Your story is very inspiring for the boys like me ...
So you completed your Btech in 5 yrs? How could ...
36,194
questions
43,647
answers
124,088
comments
42,928
users