Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged madeeasytestseries
0
votes
0
answers
ME test series FLT
In Made Easy solution they have taken FetchDecode and Execute stage separately. But why they should consider that? I think their solution not correct. right??
asked
Feb 6
in
CO & Architecture
by
srestha
(
683
points)

48
views
madeeasytestseries
0
votes
0
answers
Made Easy FLT
If we do it with stirling approximation , then ans 301, but that is not correct according to ans key. But why cannot we solve it stirling approximation?? What is wrong in it??
asked
Feb 6
in
Mathematical Logic
by
srestha
(
683
points)

34
views
madeeasytestseries
0
votes
0
answers
Made aesy test series : BFS
Consider the following graph: The minimum size of queue required when performing BFS on above graph is ________. (Take size of queue as by maximum number of elements at any time). What will be the correct answer for the foolowing question?
asked
Feb 5
in
DS
by
vishal burnwal
(
135
points)

31
views
madeeasytestseries
0
votes
0
answers
Made Easy Test Series 2020 Computer Networks
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224, the decimal value of the last octet of last host of sixth subnet is ____?
asked
Feb 4
in
Computer Networks
by
rohit090893
(
10
points)

55
views
madeeasytestseries
computer_network
0
votes
0
answers
MADE EASY : DMA CYCLE STEALING
An $8Bit$ DMA Device is operating is Cycle Stealing Mode (Single Transfer Mode). Each DMA cycle is of $6$ clock states and DMA clock is $2$ $MHZ$. Intermediate CPU machine cycle takes $2 μs$, the DMA Data Transfer Rate is ?
asked
Feb 2
in
CO & Architecture
by
Debapaul
(
699
points)

39
views
madeeasytestseries
0
votes
1
answer
Algorithms, complexity
Assume we have n number of unsorted list is given. Each list containing m integers such that n>m. What will be the time to sort in a single list ? Ans given: O(m x nlogn)
asked
Feb 2
in
Algorithms
by
dhairya16
(
6
points)

36
views
algorithms
timecomplexity
madeeasytestseries
0
votes
0
answers
Made Easy Test Series Discrete Mathematics
Let a graph G has 5 vertices and here are 3 vertices of degree 2 , one vertex of degree 1 and remaining vertex of degree 3. The complement of G is: Connected Disconnected Either (a) or (b) None of the above
asked
Feb 2
in
Mathematical Logic
by
rohit090893
(
10
points)

52
views
madeeasytestseries
0
votes
0
answers
MADE EASY: COMBINATORICS
The number of ways can $5$ letter be put in $3$ boxes $A$,$B$,$C$, such that $A$ contains atleast $2$ letters is __________ ?
asked
Jan 30
in
Combinatory
by
Debapaul
(
699
points)

49
views
madeeasytestseries
+1
vote
0
answers
MADE EASY: FRAGMENTATION
In the given network, station $A$ wish to sends a payload of $1600B$ from its $network$ $layer$ to station $B$. If fragmentation is done then, the actual data size to be transmitted is? My approach, the first network has an MTU of $1500B$ therefore ... arrive at $B$ and each has a header of $20B$, so total data size is $1700B$ Is my understanding and explanation correct?
asked
Jan 30
in
Computer Networks
by
Debapaul
(
699
points)

34
views
madeeasytestseries
0
votes
0
answers
made easytest series
can some give explain why option B is correct?
asked
Jan 29
in
Algorithms
by
v.singhal7040
(
7
points)

16
views
madeeasytestseries
madeeasymock12020
algorithms
0
votes
0
answers
Mathematics ME Test series
Ques: What is the number of partition of X = {a, b, c, d, e, f} where a and c are always in same block?  15  52  203  None of these
asked
Jan 29
in
Set Theory & Algebra
by
kashyap02
(
26
points)

20
views
discrete_maths
madeeasytestseries
0
votes
0
answers
Made Easy test series CN
Consider two nodes A and C at a distance 2000m. Suppose station A starts sending a long frame at time t1=0; station C starts sending a long frame at time t2= 3 microseconds. Find the number of bits station A has sent before detecting the collision? Assume, data rate as 10 Mbps and propagation speed 2*10^8 m/s. A) 70 bits B) 65 bits C) 130 bits D) 140 bits
asked
Jan 28
in
Computer Networks
by
Rishav_Bhatt
(
16
points)

52
views
madeeasytestseries
computernetworks
0
votes
0
answers
Made Easy Testseries CD
asked
Jan 28
in
Compiler Design
by
Dheeraj Varma
(
22
points)

22
views
madeeasytestseries
compilerdesign
0
votes
0
answers
Find Number of Tokens
Anyone please clarify.
asked
Jan 27
in
Compiler Design
by
Shivateja MST
(
113
points)

37
views
compilerdesign
lexical_analysis
madeeasytestseries
0
votes
0
answers
Made Easy Test OS
Can a process have bounded waiting and progress even if it has a possibility of deadlock?
asked
Jan 27
in
Operating System
by
tamaldeepmaity
(
17
points)

11
views
madeeasytestseries
#operatingsystem
deadlock
0
votes
0
answers
Made Easy test series computer network window size
asked
Jan 27
in
Computer Networks
by
Ram Swaroop
(
305
points)

22
views
madeeasytestseries
#computernetwork
slidingwindowprotocols
0
votes
0
answers
Madeeasy test series  Number of strings present
asked
Jan 26
in
Theory of Computation
by
luc_Bloodstone
(
36
points)

26
views
madeeasytestseries
theoryofcomputation
prefixproperty
0
votes
0
answers
Made Easy test series algorithm complexity occurance of element more than 2n/3 times
asked
Jan 26
in
Algorithms
by
Ram Swaroop
(
305
points)

29
views
madeeasytestseries
timecomplexity
algorithms
#array
0
votes
0
answers
Made Easy test series graph theory
A graph G with n vertices is said to be a void graph if and only if there’s no edge between any pair of vertices belonging to G. Let X be a void graph on 2^k + 1 vertices. Then if it is known that the minimum number of edge insertions required in the best case in order to make it connected is equal to 512, then the value of k^1/2 is equal ...
asked
Jan 25
in
Graph Theory
by
Ram Swaroop
(
305
points)

29
views
madeeasytestseries
discrete_maths
graphtheory
0
votes
0
answers
Madeeasy testseries TOC
asked
Jan 25
in
Theory of Computation
by
Dheeraj Varma
(
22
points)

56
views
madeeasytestseries
pumpinglength
0
votes
0
answers
FULL SYLLABUS TEST6 (ADVANCE LEVEL) GATE 2020 question 61
asked
Jan 25
in
Programming
by
Pratyush Priyam Kuan
(
804
points)

25
views
madeeasytestseries
data_structure
trees
0
votes
0
answers
Made easy OS full length
How no mutual exclusion occurs?
asked
Jan 25
in
Operating System
by
Jyoti Kumari97
(
27
points)

19
views
madeeasytestseries
#gatepreparation
#operatingsystem
deadlock
0
votes
0
answers
made easy testseries DB
How to solve this question?
asked
Jan 25
in
Databases
by
Dheeraj Varma
(
22
points)

21
views
madeeasytestseries
database
0
votes
0
answers
Self Doubt: MADE EASY TLB
The virtual address generated by a CPU is $36 bits$, the Translation Lookaside Buffer (TLB) can hold $512$ $entries$ and a $8way$ set associative, page size is $4 KB$ the size of the TLB tag is ________. Though I have solved the above ... ans $18$. But I have confusion regarding the above questions that I have asked. It will be very helpful if the reader can help.
asked
Jan 24
in
CO & Architecture
by
Debapaul
(
699
points)

40
views
madeeasytestseries
0
votes
0
answers
Made Easy test series algorithm complexity
Given an array S containing n real numbers, and a real number We want to find any two elements p and q in the array such that their sum is greater than the real number What is the best possible time complexity to find p and q ? O(1) O(n) O(n log n) O(n^2logn)
asked
Jan 24
in
Algorithms
by
Ram Swaroop
(
305
points)

20
views
madeeasytestseries
timecomplexity
algorithms
0
votes
1
answer
Made easy test series, DLDCounters
How is it mod5 counter?please explain
asked
Jan 24
in
Digital Logic
by
Dheeraj Varma
(
22
points)

60
views
madeeasytestseries
digitallogic
+1
vote
0
answers
Made Easy Test series Algorithms
How to solve this question?
asked
Jan 24
in
Algorithms
by
Dheeraj Varma
(
22
points)

31
views
madeeasytestseries
algorithms
dag
0
votes
0
answers
Made easy test series : Pipelining stages
Two processors, M5 and M7, implement the same instruction set. Processor M5 uses a 5stage pipeline and a clock cycle of 10 nanoseconds. Processor M7 uses a 7stage pipeline and a clock cycle of 7.5 nanoseconds. Consider the following ... on M5. The number of the true statements(s) is/are ________. What will be the correct answer for above question?
asked
Jan 23
in
CO & Architecture
by
vishal burnwal
(
135
points)

31
views
madeeasytestseries
0
votes
0
answers
Made easy test series : C programming
Consider the following program: Which of the following statement is true? I. It results 9 II. Runtime error III. Compilation error Assume all the header files and function definition correctly done. How to identify which error will be generated?
asked
Jan 23
in
Programming
by
vishal burnwal
(
135
points)

31
views
madeeasytestseries
0
votes
1
answer
made easy test series CN
is the ans 13 or 14?
asked
Jan 23
in
Computer Networks
by
Dheeraj Varma
(
22
points)

35
views
madeeasytestseries
computernetworks
0
votes
0
answers
made easy test series DPDA doubt
asked
Jan 23
in
Theory of Computation
by
Dheeraj Varma
(
22
points)

13
views
madeeasytestseries
#toc
#pda
0
votes
0
answers
made easy test series DPDA doubt
Why II. is invalid??
asked
Jan 23
in
Theory of Computation
by
Dheeraj Varma
(
22
points)

14
views
madeeasytestseries
#toc
#pda
0
votes
1
answer
Made easy full length
asked
Jan 22
in
Operating System
by
Jyoti Kumari97
(
27
points)

65
views
madeeasytestseries
#gatepreparation
#operatingsystem
#fork
0
votes
0
answers
Made Easy test series coa cache memory ft6
A byte addressable computer has a small data cache capable of holding 16 32bit words. Each cache block consist of four 32 bit words. For the following sequence of addresses (in hexadecimal). The miss ratio if 4way set associative LRU cache is used is ________. (Upto 1 decimal places) 100, 104, 108, 104, 107, 108, 105, 102, 108, 103
asked
Jan 22
in
CO & Architecture
by
Ram Swaroop
(
305
points)

9
views
madeeasytestseries
cachememory
computerarchitecture
0
votes
0
answers
Madeeasy test series  Retrieve address of element in matrix
asked
Jan 21
in
DS
by
luc_Bloodstone
(
36
points)

20
views
madeeasytestseries
data_structure
algorithms
0
votes
0
answers
Madeeasy test series  recurrence relation
asked
Jan 21
in
DS
by
luc_Bloodstone
(
36
points)

7
views
recurrencerelations
madeeasytestseries
timecomplexity
algorithms
0
votes
0
answers
Made Easy test series data structure binary search tree
asked
Jan 21
in
DS
by
Ram Swaroop
(
305
points)

26
views
madeeasytestseries
data_structure
bst
binary_search_tree
0
votes
0
answers
Made Easy test series discrete mathematics group theory
asked
Jan 21
in
Set Theory & Algebra
by
Ram Swaroop
(
305
points)

28
views
madeeasytestseries
discrete_maths
#group
0
votes
1
answer
Made Easy test series dbms maximum number of candidate key
asked
Jan 21
in
Databases
by
Ram Swaroop
(
305
points)

29
views
database
madeeasytestseries
candidatekeys
0
votes
0
answers
Made easy test series : KMap
How to solve above question when arrow is added in the Diagram?
asked
Jan 21
in
Digital Logic
by
vishal burnwal
(
135
points)

23
views
madeeasytestseries
Page:
1
2
3
4
...
7
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Apr 2020
Kushagra गुप्ता
36 Points
!KARAN
36 Points
Ram Swaroop
36 Points
sushmitagoswami
6 Points
ConnieSincla
5 Points
MelinaCundif
5 Points
Lolita04I641
5 Points
JackiBandy49
5 Points
skbansal97
5 Points
Rijusen
5 Points
3,522
questions
1,658
answers
10,465
comments
90,046
users