Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged made-easy-test-series
1
votes
1
answer
1
TCP
A TCP segment consisting of 1500 bits of data and 160 bits of header is send to the IP layer ,which appends another 160 bits of header. This is then transmitted through two network,each of which uses 24-bit packet header. The destination network has a maximum packet size of 800 bits. How many bits,including headers,are delivered to the network layer protocol at the destination??
A TCP segment consisting of 1500 bits of data and 160 bits of header is send to the IP layer ,which appends another 160 bits of header. This is then transmitted through t...
gvinay
340
views
gvinay
asked
Jan 28
Computer Networks
made-easy-test-series
+
–
0
votes
1
answer
2
Why is L1 not DCFL?
pcla
118
views
pcla
asked
Jan 27
Theory of Computation
theory-of-computation
made-easy-test-series
+
–
0
votes
1
answer
3
how is the minimum number of NOR gates required is 5?
pcla
173
views
pcla
asked
Jan 27
Digital Logic
digital-logic
made-easy-test-series
+
–
1
votes
3
answers
4
MADE EASY TEST SERIES 2024 #COA
Consider 16 bit CPU with 4 GB RAM supports 2 Address Instruction with Address 1 uses direct addressing mode Address2 uses indirect addressing mode. Opcode is designed as ADD operation with Address 1 used as Source1 and Destination, Address2 used ... operation consumes 4 cycles. Memory reference consumes 6 cycles. Time required to complete the instruction is in (ns).
Consider 16 bit CPU with 4 GB RAM supports 2 Address Instruction with Address 1 uses direct addressing mode Address2 uses indirect addressing mode. Opcode is designed as ...
Shaikh727
393
views
Shaikh727
asked
Jan 24
CO and Architecture
co-and-architecture
made-easy-test-series
addressing-modes
+
–
1
votes
1
answer
5
Gate CSE Made Easy Test Series
Construct a minimal finite state automation that accepts the language over {0, 1} of all strings that contain neither the substring 00 nor the substring 11. What is the number of states in this machine? For this question when we draw the DFA there ... and NFA contains 3 states minimum. So according to question what shall be the answer for this question? 3 or 4? Why?
“Construct a minimal finite state automation that accepts the language over {0, 1} of all strings that contain neither the substring 00 nor the substring 11. What is th...
abhiyodayapandey
228
views
abhiyodayapandey
asked
Jan 21
Theory of Computation
theory-of-computation
made-easy-test-series
+
–
0
votes
3
answers
6
Made Easy Test Series
In a max heap of n elements, the time complexity to find 10th largest element is: a)Θ(n log n) b)Θ(n) c)Θ(1) d)Θ(log n) I personally think it should be Θ(n), as the 10th largest element can be anywhere in the heap, all the elements need to be traversed once to decide that.
In a max heap of n elements, the time complexity to find 10th largest element is:a)Θ(n log n)b)Θ(n)c)Θ(1)d)Θ(log n) I personally think it should be Θ(n), as the 10th...
Mrityudoot
233
views
Mrityudoot
asked
Jan 20
DS
made-easy-test-series
data-structures
+
–
0
votes
1
answer
7
This question is from Made easy and the chapter is Computer Networks
Please give the full solution to this
Please give the full solution to this
Rohit Chakraborty
348
views
Rohit Chakraborty
asked
Jan 16
Computer Networks
made-easy-test-series
computer-networks
subnetting
+
–
0
votes
0
answers
8
Madeeasy test 45, question 48
Can anyone please explain the statements II and III?
Can anyone please explain the statements II and III?
VinayBhojwani
148
views
VinayBhojwani
asked
Jan 15
Mathematical Logic
2-marks
engineering-mathematics
made-easy-test-series
+
–
0
votes
0
answers
9
madeeasy
Proof for 2nd equality?
Proof for 2nd equality?
nihal_chourasiya
100
views
nihal_chourasiya
asked
Jan 15
Theory of Computation
made-easy-test-series
+
–
0
votes
0
answers
10
madeeasy
Proof for 2nd equality?
Proof for 2nd equality?
nihal_chourasiya
69
views
nihal_chourasiya
asked
Jan 15
Theory of Computation
made-easy-test-series
+
–
0
votes
1
answer
11
Made easy mock test question from Compiler Design
Please show the procedure for the given question.
Please show the procedure for the given question.
Rohit Chakraborty
140
views
Rohit Chakraborty
asked
Jan 15
Compiler Design
compiler-design
parsing
made-easy-test-series
+
–
0
votes
1
answer
12
Made easy mock test questions from Functions
Can you explain the procedure and if possible can you share some links to any youtube playlist from where I can study this particular subject(Functions).
Can you explain the procedure and if possible can you share some links to any youtube playlist from where I can study this particular subject(Functions).
Rohit Chakraborty
154
views
Rohit Chakraborty
asked
Jan 15
Set Theory & Algebra
test-series
functions
discrete-mathematics
gate-preparation
made-easy-test-series
+
–
0
votes
0
answers
13
Made easy
In it’s solution how are they obtaining x with the given operation? Should we not have 1 more register to keep x separate?
In it’s solution how are they obtaining x with the given operation? Should we not have 1 more register to keep x separate?
Mrityudoot
130
views
Mrityudoot
asked
Jan 14
CO and Architecture
made-easy-test-series
test-series
co-and-architecture
+
–
0
votes
1
answer
14
Made Easy Test Series
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
Mrityudoot
142
views
Mrityudoot
asked
Jan 12
Databases
made-easy-test-series
databases
functional-dependency
+
–
0
votes
1
answer
15
Made easy Test series
Can you please explain the whole working of the code
Can you please explain the whole working of the code
Rohit Chakraborty
126
views
Rohit Chakraborty
asked
Jan 11
Programming in C
made-easy-test-series
programming
+
–
0
votes
0
answers
16
Made Easy Mock Test 2
Rohit Chakraborty
232
views
Rohit Chakraborty
asked
Jan 11
Mathematical Logic
graph-theory
made-easy-test-series
engineering-mathematics
+
–
1
votes
1
answer
17
Programming
Which of the following is TRUE? A Scope of static variable is within the body of function where it is declared. B Same variable can be declared multiple times within the same function only if it is extern storage class. C Malloc always returns base address of block of memory allocated. D None of the above This is a multiple select question
Which of the following is TRUE?A Scope of static variable is within the body of function where it is declared.B Same variable can be declared multiple times within the sa...
practicalmetal
170
views
practicalmetal
asked
Jan 9
Programming in C
programming-in-c
made-easy-test-series
+
–
0
votes
1
answer
18
made easy test series
Can anyone explain how the answer is 10?
Can anyone explain how the answer is 10?
tulsidas.bhu
172
views
tulsidas.bhu
asked
Jan 8
Databases
algorithms
topological-sort
made-easy-test-series
numerical-answers
+
–
1
votes
1
answer
19
Made Easy Mock Test
Rohit Chakraborty
232
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
programming-in-c
+
–
0
votes
1
answer
20
Made Easy Test Series Mock Test
How to calculate the third option?
How to calculate the third option?
Rohit Chakraborty
214
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
digital-logic
adder
multiple-selects
+
–
1
votes
1
answer
21
made-easy
Rohit Chakraborty
159
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
time-complexity
functions
multiple-selects
+
–
1
votes
1
answer
22
selfdoubt combinatory
In how many ways can you distribute 4 different choclates to 3 people such that each gets atleast 1 choclate.
In how many ways can you distribute 4 different choclates to 3 people such that each gets atleast 1 choclate.
nihal_chourasiya
201
views
nihal_chourasiya
asked
Jan 7
Combinatory
self-doubt
made-easy-test-series
+
–
0
votes
1
answer
23
selfdoubt testseries toc
isn’t this language regular? it’s nfa according to me
isn’t this language regular?it’s nfa according to me
nihal_chourasiya
104
views
nihal_chourasiya
asked
Jan 6
Theory of Computation
self-doubt
made-easy-test-series
+
–
0
votes
1
answer
24
made-easy
Rohit Chakraborty
117
views
Rohit Chakraborty
asked
Jan 6
Databases
made-easy-test-series
databases
test-series
+
–
0
votes
0
answers
25
Made Easy Test Series
alankrit01
148
views
alankrit01
asked
Jan 2
Compiler Design
compiler-design
made-easy-test-series
+
–
0
votes
1
answer
26
MADE EASY TEST SERIES
Pls solve it
Pls solve it
Dadu
194
views
Dadu
asked
Jan 2
Set Theory & Algebra
discrete-mathematics
made-easy-test-series
+
–
0
votes
1
answer
27
Made Easy Test Series Question
Consider the following C code: d=a+b e=a-b f=c+d g=c-e a=f+g b=f-g c=d+e The minimum number of total variables required to convert the above code segment to static single assignment form is? Ans given is 7 but how
Consider the following C code:d=a+be=a-bf=c+dg=c-ea=f+gb=f-gc=d+eThe minimum number of total variables required to convert the above code segment to static single assignm...
yashss2001
219
views
yashss2001
asked
Jan 1
Compiler Design
compiler-design
made-easy-test-series
+
–
0
votes
1
answer
28
Made easy, computer architecture and orgnaization advance level Q60
RahulVerma3
183
views
RahulVerma3
asked
Jan 1
CO and Architecture
pipelining
computer-architecture
made-easy-test-series
+
–
0
votes
1
answer
29
Made Easy Test Series : Consider an open addressing hashing scheme with m slots and n keys. Assuming uniform hashing, the expected number of empty slots in the hash table for m=7 and n=3 is equal to ____________(Round off to two decimal places)
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
tishhaagrawal
310
views
tishhaagrawal
asked
Dec 16, 2023
Programming in C
hashing
uniform-hashing
data-structures
doubt
made-easy-test-series
+
–
Page:
1
2
3
4
5
6
...
57
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register