Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for made-easy-test-series
1
votes
1
answer
1
Test Series: Aptitude question --> "Counting cubes" Can somebody please explain the approach behind such questions? I often spend a lot of time in them.
tishhaagrawal
655
views
tishhaagrawal
asked
Nov 28, 2023
Spatial Aptitude
made-easy-test-series
test-series
gate-preparation
general-aptitude
spatial-aptitude
counting
+
–
0
votes
1
answer
2
Made Easy Mock Test 2
Rohit Chakraborty
271
views
Rohit Chakraborty
asked
Jan 11
Mathematical Logic
graph-theory
made-easy-test-series
engineering-mathematics
+
–
0
votes
1
answer
3
Made Easy Test Series 2024
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k). For each u in V, we wish to compute a corresponding list in(u) =such that in E ... take to construct the lists in(u), u in V, from the lists out(u), u in V? T(n) =O(n+m) B. T(n)= O(n(m+n))
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1,...
Ray Tomlinson
542
views
Ray Tomlinson
asked
Aug 9, 2023
Algorithms
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithms
+
–
0
votes
2
answers
4
how is the minimum number of NOR gates required is 5?
pcla
221
views
pcla
asked
Jan 27
Digital Logic
digital-logic
made-easy-test-series
+
–
6
votes
3
answers
5
What is the time complexity of job sequencing with deadline using greedy algorithm?
What is the time complexity of job sequencing with deadline using greedy algorithm? O(n) O(log n) O(n log n) O(n2) Made Easy Full Syllabus Test-6 : Basic Level : Practice Test-14 Q 19 Please give reference for this answer to this algorithm.
What is the time complexity of job sequencing with deadline using greedy algorithm?O(n)O(log n)O(n log n)O(n2)Made EasyFull Syllabus Test-6 : Basic Level : Practice Test-...
Akash Kanase
23.9k
views
Akash Kanase
asked
Dec 1, 2015
Algorithms
greedy-algorithm
activity-selection
made-easy-test-series
+
–
1
votes
3
answers
6
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
434
views
Shaikh727
asked
Jan 24
CO and Architecture
co-and-architecture
made-easy-test-series
addressing-modes
+
–
0
votes
4
answers
7
Made Easy Probability - Let X be a set containing n elements. Three subsets A,B, C of X are chosen at random. The probability that A, B, C are pairwise disjoint is? (What do they mean by pairwise disjoint? and how should I approach this question?)
tishhaagrawal
1.1k
views
tishhaagrawal
asked
Dec 4, 2023
Probability
probability
combinatory
counting
made-easy-test-series
gate-preparation
test-series
engineering-mathematics
self-doubt
bad-question
+
–
1
votes
1
answer
8
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
416
views
gvinay
asked
Jan 28
Computer Networks
made-easy-test-series
+
–
1
votes
1
answer
9
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
244
views
abhiyodayapandey
asked
Jan 21
Theory of Computation
theory-of-computation
made-easy-test-series
+
–
0
votes
3
answers
10
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
267
views
Mrityudoot
asked
Jan 20
DS
made-easy-test-series
data-structures
+
–
0
votes
1
answer
11
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
161
views
Rohit Chakraborty
asked
Jan 15
Set Theory & Algebra
test-series
functions
discrete-mathematics
gate-preparation
made-easy-test-series
+
–
0
votes
1
answer
12
Why is L1 not DCFL?
pcla
110
views
pcla
asked
Jan 27
Theory of Computation
theory-of-computation
made-easy-test-series
+
–
1
votes
1
answer
13
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
194
views
nihal_chourasiya
asked
Jan 7
Combinatory
self-doubt
made-easy-test-series
+
–
1
votes
1
answer
14
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
200
views
practicalmetal
asked
Jan 9
Programming in C
programming-in-c
made-easy-test-series
+
–
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
119
views
Rohit Chakraborty
asked
Jan 11
Programming in C
made-easy-test-series
programming
+
–
1
votes
1
answer
16
made-easy
Rohit Chakraborty
158
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
time-complexity
functions
multiple-selects
+
–
0
votes
1
answer
17
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
347
views
Rohit Chakraborty
asked
Jan 16
Computer Networks
made-easy-test-series
computer-networks
subnetting
+
–
1
votes
0
answers
18
Made Easy: Counting number of subgraphs of the given graph. How should I approach this question?
tishhaagrawal
543
views
tishhaagrawal
asked
Dec 16, 2023
Graph Theory
gate-preparation
test-series
made-easy-test-series
self-doubt
counting
graph-theory
discrete-mathematics
graph-connectivity
+
–
0
votes
1
answer
19
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
146
views
Mrityudoot
asked
Jan 12
Databases
made-easy-test-series
databases
functional-dependency
+
–
1
votes
1
answer
20
Made Easy Mock Test
Rohit Chakraborty
226
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
programming-in-c
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register