menu
Recent questions tagged made-easy-test-series
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged made-easy-test-series
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged made-easy-test-series
0
votes
0
answers
51
views
made easy test series
which of the following statement is /are correct for deadlock avoidance algorithm? (a) every unsafe system leads to deadlock (b) every deadlock system implies unsafe © safe system at some point of time can lead to deadlock (d) unsafe system at some point of time can never result in safe state
omshiv
asked
in
Operating System
Dec 23, 2021
by
omshiv
5
points
51
views
made-easy-test-series
0
votes
0
answers
33
views
made easy test series
consider a disk has 150 cylinders numbered from 0 to 149. currently the disk arm is at 80 and moving towards higher cylinders. there is disk access requests for cylinders are 30, 78, 96, 123, 141 ,15, 13, 68. what will be the absolute difference traversed by R/w head whwn CSCAN and CLOOK is used?
omshiv
asked
in
Operating System
Dec 23, 2021
by
omshiv
5
points
33
views
made-easy-test-series
test-series
operating-system
0
votes
0
answers
32
views
made easy test series
consider a disk has 150 cylinders numbered from 0 to 149. currently the disk arm is at 80 and moving towards higher cylinders. there is disk access requests for cylinders are 30, 78, 96, 123, 141 ,15, 13, 68. what will be the absolute difference traversed by R/w head whwn CSCAN and CLOOK is used?
omshiv
asked
in
Operating System
Dec 23, 2021
by
omshiv
5
points
32
views
made-easy-test-series
test-series
operating-system
0
votes
0
answers
85
views
MadeEasy 2022 OS question on concept of semaphores.
neel19
asked
in
Operating System
Dec 3, 2021
by
neel19
9
points
85
views
made-easy-test-series
operating-system
semaphores
test-series
0
votes
0
answers
65
views
made easy test series
In which cases we can apply strength reduction, for example can i apply strength reductio on : for(i=0 to n) { z=5*(i+1) }
Pankaj_Kumar
asked
in
Compiler Design
Dec 2, 2021
by
Pankaj_Kumar
5
points
65
views
made-easy-test-series
compiler-design
0
votes
1
answer
102
views
made easy test series compiler design
I have a doubt in statement number 2 , why we can’t compute the strength reduction in 2nd statement
Pankaj_Kumar
asked
in
Compiler Design
Dec 2, 2021
by
Pankaj_Kumar
5
points
102
views
made-easy-test-series
compiler-design
0
votes
0
answers
84
views
Made Easy 2022 test series, CD-1 question
Consider the following syntax directed definition: What type of SDT is this? S-attributed L-attributed Neither Both Due to production #2 and #3, it should not be L-attributed as parent is taking value from its child. Also, as semantic rules are written anywhere in the RHS of the production, it is not S-attributed. Given answer in test series : L-attributed
Naman9495
asked
in
Compiler Design
Sep 5, 2021
by
Naman9495
5
points
84
views
made-easy-test-series
test-series
0
votes
0
answers
37
views
#COA #TEST-SERIES
A particular parallel program computation require 200 seconds when it is executed on a single processor. If 40% of this computation is “inherently sequential” then what are the theoretically best elapsed time for this program running with 2 and 4 processors respectively? A.80 and 120 seconds B.90 and 60 seconds C.140 and 110 seconds D.100 and 80 seconds
Abhishek tarpara
asked
in
CO & Architecture
Sep 4, 2021
by
Abhishek tarpara
13
points
37
views
made-easy-test-series
co-and-architecture
multi-processor
0
votes
0
answers
46
views
#Madeeasy #COA #page-replacement #cache-memory
Consider a direct mapped cache with 16 blocks with block size of 16 bytes. Initially the cache is empty. The following sequence of access of memory blocks: Ox80000, Ox80008, Ox80010, Ox80018, Ox30010 is repeated 10 times. Which of the following represents ... = 3 and conflict = 18 C.Compulsory = 4 and conflict = 16 D.Compulsory = 2 and conflict = 20
Abhishek tarpara
asked
in
CO & Architecture
Sep 4, 2021
by
Abhishek tarpara
13
points
46
views
made-easy-test-series
co-and-architecture
page-replacement
cache-memory
0
votes
0
answers
42
views
lattice made easy test series doubt
A L be the the set of lattice [s,#],where S is the set and # is the relation defined on s .if for every subset A of S [A,#] is a lattice then the L must be? 1 total order set 2 distributive lattice 3 boolean lattice 4 complete lattice
jugnu1337
asked
in
Mathematical Logic
Aug 23, 2021
by
jugnu1337
5
points
42
views
made-easy-test-series
0
votes
0
answers
59
views
made easy test series
if F is a bool. functio in four variable x.y,z,w f(x,y,z,w)= sum (0,1,4,11,12,13,15) then expension for dual of f is…………..
jugnu1337
asked
in
Digital Logic
Aug 23, 2021
by
jugnu1337
5
points
59
views
made-easy-test-series
0
votes
0
answers
71
views
#testseries
Given AVL tree is originally balanced. If a node is added to T1 so that height of T1 becomes h + 1 from h and z is the first node which is now imbalanced. Then find the height of T3? h h+1 h+2 h+3
Abhishek tarpara
asked
in
DS
Aug 21, 2021
by
Abhishek tarpara
13
points
71
views
made-easy-test-series
trees
data-structures
0
votes
0
answers
29
views
test series
@bikram @arjun sir please help with this question. I tried to sort the jobs according to their start time but was unable to find any time unit which was free . Please assist
rish1602
asked
in
Algorithms
Aug 19, 2021
by
rish1602
9
points
29
views
algorithms
greedy-algorithms
made-easy-test-series
0
votes
0
answers
36
views
Made easy test 2021
Consider the following statements in reference to sort the array of numbers. S1 : Asymptotic running time of selection sort is Ο(n). S2 : Asymptotic running time of insertion sort is Ο(n) is best case. S3 : Asymptotic running time of merge sort is θ(n2) ... S4 : Asymptotic running time of quick sort is Ο(n logn) is worst case. The number of the correct statements is/are _____.
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
36
views
made-easy-test-series
0
votes
0
answers
26
views
Made easy Test series 2021
Suppose three matrices A, B and C are given where the dimension of A is 10 × 100, B is 100 × 20 and C is 20 × 100. The minimum number of matrix multiplication required to find the product of A × B × C using basic matrix multiplication method is _______.
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
26
views
made-easy-test-series
0
votes
0
answers
15
views
Made easy Test series 2021
Two list of size x and y are available .The time complexity in term of number of comrison for the merging of the two list to make sorted list will be A) O(x+y) B) O(log x^2 +y ) C) O(log x+log y) D) O(xlog x+ylog y)
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
15
views
made-easy-test-series
0
votes
0
answers
35
views
Made easy Test Series 2021
Consider the two languages L1 and L2 where L1 is regular and L2 is DCFL. Then the language L3 = (L1 ∩ L2*)’ is/are true about L3? CSL CFL Recursive Recursively enumerable
DKY123
asked
in
Theory of Computation
Aug 13, 2021
by
DKY123
15
points
35
views
made-easy-test-series
0
votes
0
answers
121
views
Made easy Test Series 2021
Consider a Language L1 which is Regular and L2 which is DCFL. We perform the following operations on these languages. The resultant language we get in L7 is/are (choose all possible options) Regular DCFL CFL CSL
DKY123
asked
in
Theory of Computation
Aug 13, 2021
by
DKY123
15
points
121
views
made-easy-test-series
0
votes
0
answers
52
views
Made easy Test Series 2021
Let L1 be the language corresponding to the regular expression (0 + 1)* 001* and L2 be the language corresponding to the regular expression 110(1 + 0)*. Which of the following is the regular expression corresponding to the language L1 ∩ L2? (0 + 1)* 00110(1 – 10)* 110(1 + 0)* 001* 110001* None of the above
DKY123
asked
in
Theory of Computation
Aug 13, 2021
by
DKY123
15
points
52
views
made-easy-test-series
0
votes
0
answers
21
views
Made easy Test Series 2021
Consider the regular expression: R=(ab|abb)*bbab Which of the following string in not in the set denoted by R? abbabbbab abbababbbab abababababababababab ababababbab
DKY123
asked
in
Theory of Computation
Aug 13, 2021
by
DKY123
15
points
21
views
made-easy-test-series
0
votes
0
answers
57
views
COA Test Series
A byte addressable computer has a small data cache capable of holding sixteen 32 bit words. Each cache block consist of four 32 bit words. For the following sequence of addresses (in hexadecimal). The miss ratio if 4 way set associative LRU cache is used is ________. (Upto 1 decimal places) 100, 104, 108, 104, 107, 108, 105, 102, 108, 103
Abhishek tarpara
asked
in
CO & Architecture
Jul 18, 2021
by
Abhishek tarpara
13
points
57
views
co-and-architecture
made-easy-test-series
0
votes
0
answers
24
views
made easy cbt
answer given is 27 how to approach these kind of questions? what forulas will be used here?
Sharma9999999
asked
in
Mathematical Logic
Jul 10, 2021
by
Sharma9999999
5
points
24
views
discrete-mathematics
made-easy-test-series
0
votes
0
answers
36
views
#digital-logic
Suppose we are using 4-bit carry lookahead adder modules to built a 64-bit adder with a 2- level carry lookahead with ripple carry between the modules. if the delay of base gate(AND OR NOT) is 2 ns , then the worst case delay of 64 bit adder will be _______ ns?
Abhishek tarpara
asked
in
Digital Logic
Jul 5, 2021
by
Abhishek tarpara
13
points
36
views
digital-logic
delay
made-easy-test-series
numerical-answers
0
votes
0
answers
64
views
#testseries #digitallogic #kmap
Which of the following statements are correct? All prime implicants are minterms but all minterms are not prime implicants(PI). If a literal is deleted from a PI then it is no longer remains an implicant. in the k-map, cube corresponding to a prime implicant may be covered by larger cube. Essential prime implicant are those which are appear in final answer.
Abhishek tarpara
asked
in
Digital Logic
Jul 5, 2021
by
Abhishek tarpara
13
points
64
views
digital-logic
multiple-selects
kmap
made-easy-test-series
0
votes
0
answers
36
views
#Made Easy Test Series 2022 #Algorithms-I
Assume a scenario in which min-max heap has the following property: An almost complete binary tree where each node at an even level in the tree is less than all of its descendants and each of the node at an odd level in the tree is greater than all of its ... (d) Ο(n) for max and Ο(log n) for min or Ο(n) for min and Ο(log n) for max respectively
Sibu08
asked
in
DS
Jun 29, 2021
by
Sibu08
5
points
36
views
made-easy-test-series
algorithms
0
votes
0
answers
28
views
Made easy test series #algorithm #graph #DFS
Did not understand answer of this question plz help me to resolve problem.
taatya bichhu
asked
in
Algorithms
Jun 26, 2021
by
taatya bichhu
5
points
28
views
made-easy-test-series
algorithms
graph-algorithms
dfs
0
votes
0
answers
68
views
MadeEasy TOC question
hi, this is MadeEasy TOC question. It mentions to eliminate X first and then Y. How can this be done, I mean how can we eliminate X and Y since even after subsitution they will be repeating. I know here we have to use arden’s theorem but unable to understand how to reduce. Please help…....….
rish1602
asked
in
Theory of Computation
Jun 25, 2021
by
rish1602
9
points
68
views
ardens-theorem
theory-of-computation
made-easy-test-series
regular-expressions
0
votes
0
answers
47
views
MADE EASY TEST SERIES DBMS 2022
I cannot understand why is option D) incorrect? Can anyone give an example of how in option D) first one can contain duplicate values and second one cannot ? Kindly help me. Thanks in advance
KUSHAL CHAKRABORTY
asked
in
Databases
Jun 12, 2021
by
KUSHAL CHAKRABORTY
5
points
47
views
made-easy-test-series
0
votes
1
answer
152
views
Made Easy COA Subject Wise
Consider a two level cache memory organization. L1 has an accessing time 30 ns and main memory access time 200 ns. Assume the hit ratio for read operation is 0.65 and 45% reference are for the write operation. The average access time for system(in ns) if it uses write through technique __________.
Ollie
asked
in
CO & Architecture
Sep 8, 2020
by
Ollie
525
points
152
views
made-easy-test-series
computer-organisation-and-architechture
0
votes
1
answer
260
views
Made Easy Subject Wise COA
Consider 2 MBPS I/O device interfaced to 64 bit CPU in a programmed I/O mode. Data transmission between the CPU and I/O in word wise. interrupt overhead is 3 μ sec. What is the performance gain when the device is operating under interrupt I/O over programmed I/O mode? (Please suggest some resource also to study for this topic)
Ollie
asked
in
CO & Architecture
Sep 8, 2020
by
Ollie
525
points
260
views
made-easy-test-series
computer-organisation-and-architechture
computer-architecture
0
votes
1
answer
118
views
Made Easy Test Series - OS: Memory Management
I think the answer should be B). S1 is incorrect. This is because TLB needs to be saved on a context switch. TLB stores frame numbers of frequently referred pages and therefore it has to be updated on a context switch between the process. We cannot simply flush it for a process going out. Please clarify. Thanks!
sankalpmittal
asked
in
Operating System
Sep 8, 2020
by
sankalpmittal
41
points
118
views
operating-system
memory-management
made-easy-test-series
tlb
0
votes
1
answer
67
views
Made Easy Test Series - OS: Paging
I think the answer should be 22 MB. We get Page Table Entry size = (22/8) B Page table size = 2^23 * 22/8 B = 22 MB. Why have they rounded 22/8 as 3B? Answer should be 22 MB and not 24 MB. Please clarify. Thanks!
sankalpmittal
asked
in
Operating System
Sep 8, 2020
by
sankalpmittal
41
points
67
views
operating-system
made-easy-test-series
memory-management
paging
0
votes
0
answers
42
views
Made Easy Test Series: OS - Process Scheduling
How is the answer LIFO? If I take the following example: Process Arrival Time Burst Time Priority P0 0 3 1 P1 0 5 1 P2 3 3 1 P3 6 4 1 Now we know that the priority is dynamic and so if we draw the Gantt chart: P0 P1 P0 ... (first out) but it is the first to arrive. LIFO is clearly not being followed. Can someone clairify how the answer is LIFO? Thanks!
sankalpmittal
asked
in
Operating System
Sep 7, 2020
by
sankalpmittal
41
points
42
views
made-easy-test-series
operating-system
process-scheduling
0
votes
1
answer
76
views
Made Easy Test Series - OS: Process Scheduling
I think the answer should be 65%. They say 8 processes arrive in 60 seconds. That means the first process will arrive at the time instant t = 7.5s. Now at the time t = 60s, 8th process will be arriving. However till this mark, 7 processes are ... 39s % of time CPU is idle = (39/60) * 100 = 65% Please clarify once if I am correct or not. Thanks!
sankalpmittal
asked
in
Operating System
Sep 6, 2020
by
sankalpmittal
41
points
76
views
made-easy-test-series
operating-system
process-scheduling
0
votes
1
answer
94
views
Made Easy Test Series - Operating Systems: Threads
sankalpmittal
asked
in
Operating System
Sep 6, 2020
by
sankalpmittal
41
points
94
views
made-easy-test-series
operating-system
1
vote
0
answers
52
views
Made easy test series
Assume that the original machine is an 8-stage pipeline with a 1 ns clock cycle. The second machine is 12 stage pipeline with 0.75 ns clock cycle. The 8-stage pipeline experiences a stall due to data hazard for every 5 instructions, ... be this time I get right solution by chance. Thankyou in advance. Reference question: https://gateoverflow.in/138662/test-series-pipelining
Scion_of_fire
asked
in
CO & Architecture
Sep 6, 2020
by
Scion_of_fire
49
points
52
views
made-easy-test-series
computer-organisation-and-architechture
0
votes
1
answer
53
views
Made-easy testseries coa
Consider the type addressable memory unit of a computer has 64 K words of 16 bit each. The computer has an instruction format with 4 fields namely opcode, mode field specify 9-addressing modes, register address field with 50 registers and a memory address field. If an instruction is 32 bits long then the number of different instructions are
Scion_of_fire
asked
in
CO & Architecture
Sep 6, 2020
by
Scion_of_fire
49
points
53
views
made-easy-test-series
computer-organisation-and-architechture
co-and-architecture
0
votes
1
answer
319
views
Made Easy Practice Questions
Which of the following is not involved in a memory write operation? a) MAR b) PC c) MDR d) Data bus
himali15
asked
in
CO & Architecture
Sep 6, 2020
by
himali15
5
points
319
views
made-easy-test-series
co-and-architecture
0
votes
1
answer
81
views
Made easy Workbook, Self doubt in Minimum Spanning Tree
sarthakdarji
asked
in
Algorithms
Sep 5, 2020
by
sarthakdarji
11
points
81
views
made-easy-test-series
algorithms
minimumspanningtree
1
vote
1
answer
923
views
Made Easy Subject wise COA
Consider a computer system has a main memory consisting of 2M 16 bit words. It also has a 8k word cache organized in the block set associative manner, with 4 blocks per set and 32 words per block. What is the number of bits in each of the TAG, SET and word field of main memory address format?
Ollie
asked
in
CO & Architecture
Sep 5, 2020
by
Ollie
525
points
923
views
made-easy-test-series
computer-architecture
computer-organisation-and-architechture
Page:
1
2
3
4
...
10
next »
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts