Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged made-easy-test-series
591
views
1
answers
1
votes
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 ... many bits,including headers,are delivered to the network layer protocol at the destination??
gvinay
591
views
gvinay
asked
Jan 28
Computer Networks
made-easy-test-series
+
–
135
views
1
answers
0
votes
Why is L1 not DCFL?
pcla
135
views
pcla
asked
Jan 27
Theory of Computation
theory-of-computation
made-easy-test-series
+
–
286
views
2
answers
0
votes
how is the minimum number of NOR gates required is 5?
pcla
286
views
pcla
asked
Jan 27
Digital Logic
digital-logic
made-easy-test-series
+
–
587
views
3
answers
1
votes
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 ... consumes 6 cycles. Time required to complete the instruction is in (ns).
Shaikh727
587
views
Shaikh727
asked
Jan 24
CO and Architecture
co-and-architecture
made-easy-test-series
addressing-modes
+
–
334
views
1
answers
1
votes
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 ... to question what shall be the answer for this question? 3 or 4? Why?
abhiyodayapandey
334
views
abhiyodayapandey
asked
Jan 21
Theory of Computation
theory-of-computation
made-easy-test-series
+
–
350
views
3
answers
0
votes
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 ... can be anywhere in the heap, all the elements need to be traversed once to decide that.
Mrityudoot
350
views
Mrityudoot
asked
Jan 20
DS
made-easy-test-series
data-structures
+
–
395
views
1
answers
0
votes
This question is from Made easy and the chapter is Computer Networks
Please give the full solution to this
Rohit Chakraborty
395
views
Rohit Chakraborty
asked
Jan 16
Computer Networks
made-easy-test-series
computer-networks
subnetting
+
–
218
views
0
answers
0
votes
Madeeasy test 45, question 48
Can anyone please explain the statements II and III?
VinayBhojwani
218
views
VinayBhojwani
asked
Jan 15
Mathematical Logic
2-marks
engineering-mathematics
made-easy-test-series
+
–
133
views
0
answers
0
votes
madeeasy
Proof for 2nd equality?
nihal_chourasiya
133
views
nihal_chourasiya
asked
Jan 15
Theory of Computation
made-easy-test-series
+
–
108
views
0
answers
0
votes
madeeasy
Proof for 2nd equality?
nihal_chourasiya
108
views
nihal_chourasiya
asked
Jan 15
Theory of Computation
made-easy-test-series
+
–
171
views
1
answers
0
votes
Made easy mock test question from Compiler Design
Please show the procedure for the given question.
Rohit Chakraborty
171
views
Rohit Chakraborty
asked
Jan 15
Compiler Design
compiler-design
parsing
made-easy-test-series
+
–
204
views
1
answers
0
votes
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).
Rohit Chakraborty
204
views
Rohit Chakraborty
asked
Jan 15
Set Theory & Algebra
test-series
functions
discrete-mathematics
gate-preparation
made-easy-test-series
+
–
155
views
0
answers
0
votes
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?
Mrityudoot
155
views
Mrityudoot
asked
Jan 14
CO and Architecture
made-easy-test-series
test-series
co-and-architecture
+
–
180
views
1
answers
0
votes
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?
Mrityudoot
180
views
Mrityudoot
asked
Jan 12
Databases
made-easy-test-series
databases
functional-dependency
+
–
144
views
1
answers
0
votes
Made easy Test series
Can you please explain the whole working of the code
Rohit Chakraborty
144
views
Rohit Chakraborty
asked
Jan 11
Programming in C
made-easy-test-series
programming
+
–
311
views
1
answers
0
votes
Made Easy Mock Test 2
Rohit Chakraborty
311
views
Rohit Chakraborty
asked
Jan 11
Mathematical Logic
graph-theory
made-easy-test-series
engineering-mathematics
+
–
252
views
1
answers
1
votes
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 ... block of memory allocated.D None of the aboveThis is a multiple select question
practicalmetal
252
views
practicalmetal
asked
Jan 9
Programming in C
programming-in-c
made-easy-test-series
+
–
220
views
1
answers
0
votes
made easy test series
Can anyone explain how the answer is 10?
tulsidas.bhu
220
views
tulsidas.bhu
asked
Jan 8
Databases
algorithms
topological-sort
made-easy-test-series
numerical-answers
+
–
273
views
1
answers
1
votes
Made Easy Mock Test
Rohit Chakraborty
273
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
programming-in-c
+
–
282
views
1
answers
0
votes
Made Easy Test Series Mock Test
How to calculate the third option?
Rohit Chakraborty
282
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
digital-logic
adder
multiple-selects
+
–
198
views
1
answers
1
votes
made-easy
Rohit Chakraborty
198
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
time-complexity
functions
multiple-selects
+
–
236
views
1
answers
1
votes
selfdoubt combinatory
In how many ways can you distribute 4 different choclates to 3 people such that each gets atleast 1 choclate.
nihal_chourasiya
236
views
nihal_chourasiya
asked
Jan 7
Combinatory
self-doubt
made-easy-test-series
+
–
134
views
1
answers
0
votes
selfdoubt testseries toc
isn’t this language regular?it’s nfa according to me
nihal_chourasiya
134
views
nihal_chourasiya
asked
Jan 6
Theory of Computation
self-doubt
made-easy-test-series
+
–
142
views
1
answers
0
votes
made-easy
Rohit Chakraborty
142
views
Rohit Chakraborty
asked
Jan 6
Databases
made-easy-test-series
databases
test-series
+
–
182
views
0
answers
0
votes
Made Easy Test Series
alankrit01
182
views
alankrit01
asked
Jan 2
Compiler Design
compiler-design
made-easy-test-series
+
–
228
views
1
answers
0
votes
MADE EASY TEST SERIES
Pls solve it
Dadu
228
views
Dadu
asked
Jan 2
Set Theory & Algebra
discrete-mathematics
made-easy-test-series
+
–
262
views
1
answers
0
votes
Made Easy Test Series Question
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 assignment form is?Ans given is 7 but how
yashss2001
262
views
yashss2001
asked
Jan 1
Compiler Design
compiler-design
made-easy-test-series
+
–
215
views
1
answers
0
votes
Made easy, computer architecture and orgnaization advance level Q60
RahulVerma3
215
views
RahulVerma3
asked
Jan 1
CO and Architecture
pipelining
co-and-architecture
made-easy-test-series
+
–
446
views
1
answers
0
votes
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, ... wrong, can anyone explain, please! I am providing a screenshot of their solution below -
tishhaagrawal
446
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