Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
This Combine all questions from Made Easy booklet
Recent questions tagged made-easy-booklet
1
vote
1
answer
1
MadeEasy Workbook | MUX
abhinowKatore
asked
in
Digital Logic
Nov 3
by
abhinowKatore
74
views
multiplexer
digital-logic
made-easy-booklet
1
vote
1
answer
2
Digital Logic | 2's complement Question | MadeEasy Workbook question
abhinowKatore
asked
in
Digital Logic
Oct 24
by
abhinowKatore
108
views
digital-logic
number-representation
made-easy-booklet
1
vote
0
answers
3
MADEEASYWORKBOOK 2019
Suppose Host A sends over a TCP connection to Host B one segment sequence number 38 and 4 bytes of data.What will be acknowledgements number for subsequent segment. 38 39 42 54
pra2u3
asked
in
Computer Networks
Aug 14
by
pra2u3
113
views
made-easy-booklet
0
votes
1
answer
4
#made easy workbook questions
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heap b. Binary max heap c. AVL tree (height balanced bst)
Shraddha dwevedi
asked
in
Algorithms
Nov 25, 2021
by
Shraddha dwevedi
168
views
made-easy-booklet
data-structures
huffman-code
0
votes
1
answer
5
Made easy workbook question
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue? a. Binary heap b. Height balanced binary tree. c. Sorted array
Shraddha dwevedi
asked
in
DS
Nov 25, 2021
by
Shraddha dwevedi
191
views
made-easy-booklet
data-structures
priority-queue
2
votes
3
answers
6
Made easy Workbook 2020
Question: $T(1)=1$ $T(n) = 2 T(n - 1) + n$ evaluates to? Can anyone solve it by substitution method? Given answer $T(n) = 2^{n+1} - (n+2)$ How?
Jyoti Kumari97
asked
in
Algorithms
May 25, 2019
by
Jyoti Kumari97
5.5k
views
time-complexity
algorithms
recurrence-relation
made-easy-booklet
0
votes
1
answer
7
Madeeasy workbook algorithm time complexity
Finding the running time of the following algorithm. $Procedure$ $A(n)$ $\textrm{ if (n}<=\textrm{2) then return 1 ;}$ $else$ $Return(A(\left \lceil \sqrt{n} \right \rceil))$
Sachdev aprajita
asked
in
Algorithms
May 23, 2019
by
Sachdev aprajita
322
views
made-easy-booklet
algorithms
time-complexity
0
votes
0
answers
8
Made Easy Booklet-Databases
Question 79
Junaed Siddiquee
asked
in
Databases
Apr 14, 2019
by
Junaed Siddiquee
176
views
made-easy-booklet
1
vote
0
answers
9
Made Easy Workbook Database
Junaed Siddiquee
asked
in
Databases
Apr 14, 2019
by
Junaed Siddiquee
430
views
made-easy-booklet
0
votes
0
answers
10
How to find precedence?
Shubham_Kr
asked
in
Compiler Design
Apr 12, 2019
by
Shubham_Kr
165
views
made-easy-booklet
1
vote
2
answers
11
Made easy question of compiler design
Find the number of tokens in the following C code$:$ main() { int x = 10 , *P ; int y = x ++ ; char * q ; P = & x ; q = 'A' ; if(*P>=10) { *P = x + 100; } else { printf("%d" , x); /*comment*/ } }
Shubham_Kr
asked
in
Compiler Design
Apr 12, 2019
by
Shubham_Kr
1.4k
views
compiler-design
lexical-analysis
compiler-tokenization
made-easy-booklet
numerical-answers
0
votes
2
answers
12
Made Easy Workbook
Suppose that you are running Dijkstra’s algorithm on the edge-weighted diagram below, starting from vertex A. The Table gives ‘Distance’ and ‘Parent’ entry of each vertex after vertex E has been deleted from the priority queue and relaxed. Vertex Distance Parent A 0 Null B 2 A C 13 F D 23 A E 11 F F 7 B G 36 F H 19 E What could be the possible value of expression x+y?
noob_coder
asked
in
Algorithms
Mar 10, 2019
by
noob_coder
1.5k
views
algorithms
graph-algorithms
dijkstras-algorithm
numerical-answers
made-easy-booklet
0
votes
1
answer
13
MadeEasy WorkBook: Thoery of Computation - Finite Automata
Jyoti Kumari97
asked
in
Theory of Computation
Feb 16, 2019
by
Jyoti Kumari97
525
views
made-easy-booklet
theory-of-computation
finite-automata
0
votes
2
answers
14
MadeEasy WorkBook: Theory of Computation - Regular Expression
Given answer is option c. Can anyone tell me how?
Jyoti Kumari97
asked
in
Theory of Computation
Feb 16, 2019
by
Jyoti Kumari97
821
views
regular-expression
theory-of-computation
made-easy-booklet
0
votes
1
answer
15
MadeEasy WorkBook: Programming & DS - Programming in C
for(i=10;i<10;++i) printf("%d" i&1) prints (a) 0101010101 (b) 0111111111 (c) 0000000000 (d) 1111111111
Jyoti Kumari97
asked
in
Programming
Jan 28, 2019
by
Jyoti Kumari97
436
views
made-easy-booklet
programming
programming-in-c
3
votes
2
answers
16
MadeEasy WorkBook: Algorithms - Sorting
Consider the following array with 7 elements for insertion sort? 25, 15, 30, 9, 99, 20, 26 In how many passes, the given sequence will be sorted? (a) 4 pass (b) 5 pass (c) 6 pass (d) More than 6 pass Answer is 6 passes. Can anyone explain it step by step.
Jyoti Kumari97
asked
in
Algorithms
Jan 26, 2019
by
Jyoti Kumari97
2.1k
views
made-easy-booklet
algorithms
sorting
1
vote
1
answer
17
MadeEasy Workbook: Databases - Database Normalization
Find the highest normal form. AB - - > CE E - - >AB C-->D Doubt AB, E are the candidate key. The answer given is 2NF In 2NF, there should be no partial dependency which is PRIME ATTRIBUTE - - >NON PRIME ATTRIBUTE But it is there in AB-->CE, I think CE is non prime attribute. Or bcoz of E we consider them as prime attribute.
Jyoti Kumari97
asked
in
Databases
Jan 25, 2019
by
Jyoti Kumari97
399
views
made-easy-booklet
databases
database-normalization
1
vote
1
answer
18
MadeEasy Workbook: Databases - Database Normalization
Jyoti Kumari97
asked
in
Databases
Jan 23, 2019
by
Jyoti Kumari97
520
views
databases
made-easy-booklet
database-normalization
0
votes
1
answer
19
MadeEasy Workbook: Calculus - Maxima Minima
chanchala3993
asked
in
Calculus
Jan 19, 2019
by
chanchala3993
485
views
engineering-mathematics
calculus
maxima-minima
made-easy-booklet
0
votes
0
answers
20
MadeEasy Workbook: Operating System - Page Replacement
Assume there are 5 frames and consider the following reference string find the number of page faults using NRU page replacement algorithm. 3,2,3, 0,8,4,2,5,0,9,8,3,2
Jyoti Kumari97
asked
in
Operating System
Jan 15, 2019
by
Jyoti Kumari97
280
views
made-easy-booklet
operating-system
page-replacement
0
votes
0
answers
21
MadeEasy Workbook: Operating System - Inter Process Commmunication
Consider the following sequential code which is executed in a multiprogramming mode by assuming that each statement can execute independently to achieve the concurrency. If any statement dependent on other statements then those statements will be ... and S2 d)S2 and S4 Given answer is option c but according to me answer should be d
Jyoti Kumari97
asked
in
Operating System
Jan 14, 2019
by
Jyoti Kumari97
203
views
operating-system
inter-process-communication
made-easy-booklet
0
votes
2
answers
22
MadeEasy Workbook: Operating System - Resource Allocation
Jyoti Kumari97
asked
in
Operating System
Jan 14, 2019
by
Jyoti Kumari97
548
views
operating-system
resource-allocation
made-easy-booklet
0
votes
1
answer
23
MadeEasy Workbook: Operating System - Resource Allocation
A. X=40,Y=20 B.X=50,Y=10 C.X=30,Y=20 D. X=20,Y=30
Jyoti Kumari97
asked
in
Operating System
Jan 14, 2019
by
Jyoti Kumari97
449
views
operating-system
resource-allocation
made-easy-booklet
0
votes
0
answers
24
MadeEasy Workbook: Operating System - Precedence Graph
How to solve this question?
Jyoti Kumari97
asked
in
Operating System
Jan 11, 2019
by
Jyoti Kumari97
391
views
operating-system
precedence-graph
made-easy-booklet
0
votes
0
answers
25
MadeEasy Workbook: Operating System - Process Schedule
How to solve this question?
Jyoti Kumari97
asked
in
Operating System
Jan 11, 2019
by
Jyoti Kumari97
318
views
operating-system
process-scheduling
made-easy-booklet
0
votes
0
answers
26
Madeeasy Workbook
Prove that : ∀x(P(x) => Q(x)) ==> ( ∃x(P(x)) => ∃x(Q(x)) ) Why it does not holds?
Kartik jain 1
asked
in
Study Resources
Jan 8, 2019
by
Kartik jain 1
159
views
discrete-mathematics
mathematical-logic
propositional-logic
made-easy-booklet
0
votes
0
answers
27
MadeEasy Workbook: General Aptitude - Sets
How to solve this type of questions? Let S be the set of integers such that 1. 100<=x<=200 2. x is odd 3. x is divisible by 3 but not by 7 How many elements does S contain?
Jyoti Kumari97
asked
in
Quantitative Aptitude
Jan 2, 2019
by
Jyoti Kumari97
700
views
general-aptitude
quantitative-aptitude
made-easy-booklet
0
votes
1
answer
28
MadeEasy Workbook: Digital Logic - Digital Counter
How to solve this?
Jyoti Kumari97
asked
in
Digital Logic
Jan 1, 2019
by
Jyoti Kumari97
466
views
digital-logic
digital-counter
made-easy-booklet
0
votes
1
answer
29
MadeEasy Workbook: Digital Logic - Shift Registers
How to solve this question?
Jyoti Kumari97
asked
in
Digital Logic
Dec 31, 2018
by
Jyoti Kumari97
498
views
digital-logic
shift-registers
made-easy-booklet
0
votes
2
answers
30
MadeEasy Workbook: Digital Logic - Shift Registers
a 4 bit serial in parallel out shift register is used with a feedback as shown in figure below the shifting sequences q3 - >q2-> q1- > q0. if the output is initially 0000, the no of clock pulses after which t the output will repeat itself is
Jyoti Kumari97
asked
in
Digital Logic
Dec 31, 2018
by
Jyoti Kumari97
1.2k
views
digital-logic
shift-registers
made-easy-booklet
Page:
1
2
3
4
5
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged made-easy-booklet
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...