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
Recent questions tagged made-easy-test-series
0
votes
2
answers
91
deadlocks and threads operating system
A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX (A B C) Allocated (A B C) P0 7 5 3 0 1 0 P1 3 2 2 2 0 0 P2 9 0 2 3 0 2 P3 2 ... these is a safe sequence in Question 13? P1, P3, P4 , P0, P2 only P2, P4, P3, P1, P0 only Both a and b None are safe sequences
roopkathaaa
asked
in
Operating System
Sep 2, 2023
by
roopkathaaa
1.4k
views
threads
operating-system
deadlock-prevention-avoidance-detection
minimal-state-automata
made-easy-test-series
0
votes
1
answer
92
deadlocks and threads operating system
State true or false. Deadlock detection is possible using the allocation and request matrices alone. A way to recover from deadlock is to take away the resource from one of the processes or to kill the process itself. Banker's algorithm is ... deadlocks by analyzing the unsafe states. True, True, False False, True, True True, False, True False, True, False
roopkathaaa
asked
in
Operating System
Sep 2, 2023
by
roopkathaaa
812
views
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
minimal-state-automata
0
votes
1
answer
93
daedlocks and threads operating system
Suppose we want to synchronize two concurrent process P and Q using binary semaphore S and T. Process P: Process Q: while(1){ while(1){ W: Y: print 0'; print 1'; print 0'; print 1'; X: Z: } Synchronization statements can be inserted only at points W,X,Y,Z. Which of the ... S = T= 1 d. W : P(S) X : V(S) Y : P(T) Z: V(T) and initially S = 1 and T= 0
roopkathaaa
asked
in
Operating System
Sep 2, 2023
by
roopkathaaa
296
views
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
0
votes
1
answer
94
made easy test series
Identify the number of leaders in the following code segment:
kaustubh7
asked
in
Compiler Design
Aug 29, 2023
by
kaustubh7
407
views
compiler-design
made-easy-test-series
0
votes
1
answer
95
COA | Branch Delays
Consider the following sequence of instructions for a pipelined processor with one branch delay slot: I1 LABEL: ADD R3 ← R3 + 1 I2 DIV R2 ← R2/R6 I3 SUB R1 ← R2-1 I4 If R1≤0 then BRANCH to LABEL I5 SUB R3 ← R3-R7 Which of the following is true after ... now label pointing to I3. C) I2 shifted to branch delay slot. D) I1 shifted to branch delay slot and now LABEL pointing to I2.
paarthsinghrathore
asked
in
CO and Architecture
Aug 18, 2023
by
paarthsinghrathore
345
views
made-easy-test-series
co-and-architecture
pipelining
branch-conditional-instructions
1
vote
1
answer
96
Made Easy Test Series 2024
Given data 10111100 Then P1, P2, P4, Pg parity bits that are attached to data to form codeword are Why they are taking parity bits from LHS in below question A 12 bit hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What could be ... not more than 1 bits in error. if we take parity bits in LHS AND RHS we get different result please anyone clarify it
Ray Tomlinson
asked
in
Computer Networks
Aug 16, 2023
by
Ray Tomlinson
728
views
made-easy-test-series
made-easy-booklet
computer-networks
hamming-code
error-detection
error-correction
0
votes
1
answer
97
Made Easy Test Series 2024
A large population of ALOHA users manages to generate 50 requests/sec, including both original and retransmission time is slotted in units of 40 msec. What is the change of success on the first attempt? A. $e^-1$ B. $e^-2$ C. $ e^-0.5$ D. $(1/2)*e^0.5$
Ray Tomlinson
asked
in
Computer Networks
Aug 16, 2023
by
Ray Tomlinson
475
views
made-easy-test-series
computer-networks
slotted-aloha
csma-cd
1
vote
2
answers
98
Made Easy Test Series 2024
Match the List-1 with List-II and select the correct answer using the codes given below the lists: List-I A. RST B. URG C. PSH D. FIN List-II 1. Sent from the receiver to the sender when a packet is sent to a particular host that was not expecting ... last packet. 4. When this flag is set then data may reach out of order. what will be the correct answer for ABCD =? (NAT)
Ray Tomlinson
asked
in
Computer Networks
Aug 16, 2023
by
Ray Tomlinson
428
views
made-easy-test-series
computer-networks
tcp
2
votes
1
answer
99
Made Easy Test Series 2024
Given ISP has a block $130.61.0.0/20$ . A Company request for ip address for $ 1000$ computers .. which of the elgible range of ip address can be assigned to a company(MSQ)? $A. 131.61.8.0/22$ $B. 131.61.28.0/22 $ $C. 131.61.12.0/22$ $D. None$ $of$ $these$
Ray Tomlinson
asked
in
Computer Networks
Aug 15, 2023
by
Ray Tomlinson
340
views
computer-networks
made-easy-test-series
ip-addressing
0
votes
0
answers
100
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))
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
511
views
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithm
0
votes
0
answers
101
Made easy test series
what they want to tell and it is true or false?
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
272
views
made-easy-test-series
made-easy-booklet
algorithms
bellman-ford
2
votes
1
answer
102
Made Easy Test Series
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6). What is the minimum number of jumps required to reach the end of the array?
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
855
views
made-easy-test-series
made-easy-booklet
algorithms
data-structures
array
algorithm-design
1
vote
1
answer
103
Made Easy Test Series 2024
Which of the following statement(s) is/are true? (a) Quicksort and merge sort are both examples of divide and conquer algorithms. (b) If we randomly choose a pivot element each time, quicksort will always terminate in time $O(n log n).$ (c) For every fixed ... in time $O(1)$, quicksort would have worst case complexity $O(n log n)$. plese give answer and explain it why ?
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
865
views
made-easy-test-series
made-easy-booklet
algorithms
divide-and-conquer
quick-sort
merge-sort
time-complexity
0
votes
1
answer
104
Made Easy Test Series 2024
Numerical Answer Type Que? (please Try to give some ahortcut trick also or important concept is there to solve that question )
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
519
views
made-easy-test-series
made-easy-booklet
algorithms
hashing
linear-probing
algorithm-design
0
votes
1
answer
105
Made Easy Test Series 2024
pls give all possible sequences possible for prims algo
Ray Tomlinson
asked
in
Algorithms
Aug 8, 2023
by
Ray Tomlinson
365
views
made-easy-test-series
made-easy-booklet
algorithms
prims-algorithm
minimum-spanning-tree
0
votes
1
answer
106
Permutations
Çșȇ ʛấẗẻ
asked
in
Mathematical Logic
Jul 28, 2023
by
Çșȇ ʛấẗẻ
238
views
discrete-mathematics
combinatory
mathematical-logic
made-easy-test-series
1
vote
1
answer
107
made easy ots 2024
The direct broadcast address of the IP address 203.42.239.178 with subnet mask 255.255.255.240 is 203.42.239.X what is value of X in decimal ________?
kaustubh7
asked
in
Computer Networks
Jul 28, 2023
by
kaustubh7
330
views
made-easy-test-series
computer-networks
0
votes
1
answer
108
MadeEasy Subjectwise test
Consider a subnet of class B network which has 160.24.223.255 as broadcast address. Consider the following subnet masks: M1: 255.255.208.0 M2: 255.255.224.0 M3: 255.255.240.0 Which of the above subnet masks can be the subnet mask of given subnet? How to solve such questions? What is the logic/process?
paarthsinghrathore
asked
in
Computer Networks
Jul 24, 2023
by
paarthsinghrathore
280
views
made-easy-test-series
computer-networks
0
votes
0
answers
109
Made Easy Digital Logic Combinational Circuits Gate
To design a binary subtractor circuit, 1’s complement procedure is better,because it uses less hardware. 2’s complement procedure is better,because it uses less hardware. Binary ‘0’ is having unique representation in sign 1’s complement notation. Binary ‘0’ is having unique representation in sign 2’s complement notation.
Sourin Kundu
asked
in
Digital Logic
May 4, 2023
by
Sourin Kundu
267
views
digital-logic
combinational-circuit
made-easy-test-series
0
votes
0
answers
110
Made Easy Digital Logic Combinational circuits Gate
A 4 bit binary adder is adding two BCD numbers and producing the sum output S3S2S1S0 along with the carry output C0.It is required to design a checking circuit such that the checking circuit output must be zero,whatever the Binary adder output is invalid BCD,the ... circuit is C0'S3'+C0'S2'S1' C0+S3S2+S2S1 (C0'+S0')(C0'+S2'+S1') None of the above
Sourin Kundu
asked
in
Digital Logic
May 4, 2023
by
Sourin Kundu
335
views
digital-logic
combinational-circuit
digital-circuits
made-easy-test-series
1
vote
1
answer
111
Made Easy Boolean Algebra,Logic Gates and K-Maps
Sourin Kundu
asked
in
Digital Logic
Apr 13, 2023
by
Sourin Kundu
605
views
digital-logic
k-map
boolean-algebra
made-easy-test-series
0
votes
5
answers
112
MadeEasy
Match List-l with List-|l and select the correct answer using the codes given below the lists: List-I List-II A. Regular grammar 1. Pushdown automaton B. Context free grammar 2. Linear bounded automaton C Unrestricted grammar 3. Deterministic finite . D. Context sensitive grammar 4. Turing machine Codes: A B C D (a) 3 1 2 4 (b) 3 1 4 2 Which of the options are correct and why?
Rohit Chakraborty
asked
in
Theory of Computation
Apr 9, 2023
by
Rohit Chakraborty
640
views
made-easy-test-series
finite-automata
0
votes
2
answers
113
MadeEasy
Consider the following deterministic finite automation Let S denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. Then which of the following strings is/are in S that are accepted by M. 01110111 01111010 10101010 01110110
Rohit Chakraborty
asked
in
Theory of Computation
Apr 9, 2023
by
Rohit Chakraborty
443
views
made-easy-test-series
theory-of-computation
number-of-dfa
0
votes
0
answers
114
Relative Addressing Mode
Consider 3-word long jump instruction designed with PC-relative addressing mode, stored in the memory with a starting address of (2000)$_{10}$. Address field of an instruction contains (4000)$_{10}.$ Which of the following statements are true in the instruction ... where operand is stored, then how we can we assign it to PC? PC should be 2003 at the end of execution right?
Chaitanya Kale
asked
in
CO and Architecture
Feb 13, 2023
by
Chaitanya Kale
611
views
addressing-modes
co-and-architecture
made-easy-test-series
2
votes
0
answers
115
MADEEASY
Why B is wrong?
DAWID15
asked
in
Computer Networks
Feb 1, 2023
by
DAWID15
422
views
computer-networks
subnetting
made-easy-test-series
0
votes
1
answer
116
#madeeasy
is it ok to mark both and at least option in the case of MSQ, on my view in this question first option will always be true so marking the second is correct?
Dknights
asked
in
Programming in C
Feb 1, 2023
by
Dknights
396
views
programming-in-c
made-easy-test-series
query
3
votes
1
answer
117
Made Easy test series
answer given is 33
TusharKumar
asked
in
Programming in C
Jan 31, 2023
by
TusharKumar
525
views
programming-in-c
output
made-easy-test-series
0
votes
1
answer
118
Operand forwarding Made Easy Question
Consider 4-stage (IF, ID, EX, WB) pipeline used to execute the following code. All instructions are spending are spending one cycle on all the stages but ALU instructions are spending 3 cycles on 3rd stage. I1: LOAD R0, ... Number of cycles are saved using operand forwarding over without operand forwarding is? Can someone please explain by drawing the diagram?
Chaitanya Kale
asked
in
CO and Architecture
Jan 30, 2023
by
Chaitanya Kale
947
views
pipelining
co-and-architecture
operand-forwarding
made-easy-test-series
0
votes
1
answer
119
Programming
Someone please explain. Function of ‘^’
Overflow04
asked
in
Programming in C
Jan 24, 2023
by
Overflow04
276
views
programming-in-c
made-easy-test-series
0
votes
2
answers
120
TOC | Made Easy mock
abhinowKatore
asked
in
Theory of Computation
Jan 24, 2023
by
abhinowKatore
437
views
made-easy-test-series
theory-of-computation
numerical-answers
test-series
Page:
« prev
1
2
3
4
5
6
7
8
9
...
57
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged made-easy-test-series
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...