Recent questions tagged made-easy-test-series / GATE Overflow for GATE CSE

4 votes

1 answer

151

Multilevel paging
The below question is from made easy test series: Consider a 32 bit virtual address as follows: 10 8 6 8 P1 P2 P3 Offset System uses 3 level paging and the bits for the respective levels are as indicated above. Then the size of page table for a process which requires 256 KB of ... $\frac{2^{8}} {2} $ = 2$^{7}$ pages. I don't know what I am getting wrong. Please correct me.

The below question is from made easy test series:Consider a 32 bit virtual address as follows: 10 8 6 8 P1 P2 P3 ...

Chaitanya Kale

1.4k views

Chaitanya Kale asked Dec 3, 2022

0 votes

0 answers

152

Made easy Theory of Computation
Which of them are not regular- (a) L={a^m b^n | n>=2023, m<=2023} (b) L={a^n b^m c^l | n=2023, m>2023, l>m} according made easy (b) is the answer but can we do like this- Let L1= {a^n |n=2023} ... ) and so L2 is regular L=L1.L2 (regular lang are closed under concatenation) therefore L is regular.this makes option (b) regular is it right approach ?

Which of them are not regular-(a) L={a^m b^n | n>=2023, m<=2023}(b) L={a^n b^m c^l | n=2023, m>2023, l>m}according made easy (b) is the answer but can we do like this-Let...

Shreya2002

310 views

Shreya2002 asked Dec 1, 2022

0 votes

0 answers

153

#CompilerDesign #made-easy-test-series
what should be the ans?? according to me answer should be 7 nodes, 8 edges but 5 nodes, 6 edges is given in the answer key! please tell me what am i doing wrong.

what should be the ans??according to me answer should be 7 nodes, 8 edges but 5 nodes, 6 edges is given in the answer key!please tell me what am i doing wrong.

jay03

494 views

jay03 asked Nov 28, 2022

1 votes

0 answers

154

Madeasy Test series

vishnu777

301 views

vishnu777 asked Nov 23, 2022

0 votes

1 answer

155

Made Esy Test Series 2022 | COA | Subject wise Q.no 17
** MSQ ** Consider the following sequence of micro-operations (μO) on a system used for instruction fetch: Where MAR is memory address register, PC is program counter, MBR is memory buffer register and IR is instruction register. And ... the following μO's can execute parallely without conflict. μO2 and μO3 μO1 and μO3 μO4 and μO3 μO2 and μO4

MSQ Consider the following sequence of micro-operations (μO) on a system used for instruction fetch:Where MAR is memory address register, PC is program counter, MBR i...

Souvik33

592 views

Souvik33 asked Nov 23, 2022

0 votes

2 answers

156

mde esy test series
Which of the following statements is/are true? A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree. B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same ... is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).

Which of the following statements is/are true?A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree.B. In a label...

Himanshu555

636 views

Himanshu555 asked Nov 8, 2022

0 votes

1 answer

157

Token bucket
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 10 megabyte and the maximum output rate is 20 megabytes per second. Tokens arrive at a rate to sustain output at a rate of 10 megabytes per second. ... megabytes So it will take 100megabytes/10 MBps = 10 sec So total time = 1 + 10 = 11 seconds Please verify my solution

For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 10 megabyte and the maximum output rate is 20 megabytes...

Chaitanya Kale

1.4k views

Chaitanya Kale asked Nov 6, 2022

0 votes

0 answers

158

Madeasy Test series 2023 Discrete Maths

vishnu777

252 views

vishnu777 asked Nov 2, 2022

0 votes

1 answer

159

Normalisation
Consider a relation R with more than two attributes. Let A and B are sets of attributes from R and A$\cap$B = $\phi$. Functional dependency A → B holds on R. Which one of the following can be a correct possible situation for R? A and B contain prime and non-prime ... do we need to assume that all the functional dependencies holding on R are of type A → B such that A$\cap$B = $\phi$?

Consider a relation R with more than two attributes. Let A and B are sets of attributes from R and A$\cap$B = $\phi$. Functional dependency A → B holds on R. Which one ...

Chaitanya Kale

645 views

Chaitanya Kale asked Nov 1, 2022

0 votes

1 answer

160

Madeeasy Algorithm
How to solve this recurrence relation T(n)= T(0.09n) + T(0.91n) + cn where c is constant and T(1)=1 options are-

How to solve this recurrence relationT(n)= T(0.09n) + T(0.91n) + cnwhere c is constant and T(1)=1options are-

Shreya2002

1.1k views

Shreya2002 asked Oct 27, 2022

0 votes

0 answers

161

made easy test series
Caption

Caption

Himanshu555

404 views

Himanshu555 asked Oct 24, 2022

0 votes

0 answers

162

File System, Operating System
In case of Indexed Allocation Technique in File System of OS does the last address of the index file actually points to the address of the next Index file. If so then should we remove 1 from the total number of addresses possible in ... concept where this last address of the Index file is also considered while calculating the File Size. Can someone please clarify?

In case of Indexed Allocation Technique in File System of OS does the last address of the index file actually points to the address of the next Index file. If so then sho...

royS96

346 views

royS96 asked Oct 24, 2022

1 votes

1 answer

163

Madeeasy Test Series 2023
Answer: 1.098

Answer: 1.098

SKMAKM

517 views

SKMAKM asked Oct 20, 2022

0 votes

0 answers

164

made easy test series

Neelu Lalchandani

356 views

Neelu Lalchandani asked Oct 16, 2022

0 votes

1 answer

165

made easy test series
When a process create a child, which of the following is/are correct possibility/situation? A) Parent process can execute parallely with children. B) Parent process can wait until some or all of its children have terminated. C)Child process can only be the duplicate of parent process. D) Child process can only loaded with program other than parent program.

When a process create a child, which of the following is/are correct possibility/situation?A) Parent process can execute parallely with children.B) Parent process can wai...

viral8702

990 views

viral8702 asked Oct 12, 2022

3 votes

1 answer

166

Made easy test series
Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are possible for a process P with more than one user-level threads in above system? A)P is in running ... than one threads of P are in running state. D)P is in ready state and a thread of P is in running state. .

Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are po...

viral8702

595 views

viral8702 asked Oct 12, 2022

0 votes

0 answers

167

Data Structure
Not able to understand the last option.

Not able to understand the last option.

Overflow04

307 views

Overflow04 asked Oct 2, 2022

0 votes

1 answer

168

Programming
I am getting 5 as output, but the answer is 4, please verify

I am getting 5 as output, but the answer is 4, please verify

Overflow04

364 views

Overflow04 asked Oct 2, 2022

0 votes

2 answers

169

Programming and DS
#include <stdio.h> int main(){ int a[] = {5,3,7,2,4}; int *p = &a[3]; p -= *p; printf("%d ",*p); return 0; } output is 3. Why 2 * sizeof(int) is doene.?

#include <stdio.h int main(){ int a[] = {5,3,7,2,4}; int *p = &a[3]; p -= *p; printf("%d ",*p); return 0; } output is 3.Why 2 * sizeof(int) is doene.?

Overflow04

358 views

Overflow04 asked Oct 2, 2022

1 votes

2 answers

170

made easy test series
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will store f(11) in stack. But if we call f(12) we wont be able to store it as overflow will occur.

How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will...

Neelu Lalchandani

602 views

Neelu Lalchandani asked Sep 30, 2022

0 votes

1 answer

171

DMA
The below question is from Made Easy Test series The diagram shows single bus detached DMA configuration for a system. How many times system bus is used for single data transfer using DMA(Consider only data transfer, not command or status transfer) 1 2 3 0 Here answer ... My Doubt: In DMA their is direct data transfer from i/o to memory so system bus is accessed only once. Is this correct?

The below question is from Made Easy Test seriesThe diagram shows single bus detached DMA configuration for a system. How many times system bus is used for single data tr...

Chaitanya Kale

1.4k views

Chaitanya Kale asked Sep 24, 2022

0 votes

1 answer

172

made easy test series
supernet mask of class c is given 255.255.224.0 .the number of networks that can be joined are 16 32 64 none

supernet mask of class c is given 255.255.224.0 .the number of networks that can be joined are163264none

JAINchiNMay

884 views

JAINchiNMay asked Sep 18, 2022

1 votes

1 answer

173

Made Easy Test Series 2021: Operating System
Consider the following segment: Note : Assume the count = count + 1; will execute in 3' different instructions. Where, m[count] refers to memory value of count variable. Preemption can occur while executing the above instructions. Each of the tally function has a separate ... 15 b) Min = 2, Maximum = 15 c) Min = 1, Maximum = 15 d) Min = 15, Maximum = 15

Consider the following segment:Note : Assume the count = count + 1; will execute in ‘3’ different instructions.Where, m[count] refers to memory value of count variabl...

DebRC

1.1k views

DebRC asked Sep 12, 2022

1 votes

1 answer

174

made easy test series
which of the following is false? In ethernet, each nodes physical address is guaranteed to be globally unique. the single parity check can detect any odd no of bit error in a transmitted codeword. in ethernet , a node wishing to transmit might never be allowed to access the channel. none of these.

which of the following is false?In ethernet, each nodes physical address is guaranteed to be globally unique.the single parity check can detect any odd no of bit error in...

JAINchiNMay

895 views

JAINchiNMay asked Sep 11, 2022

0 votes

0 answers

175

Operating System
1. Write clearly the dinning philosopher and reader-writer classical problem of process synchronization

1. Write clearly the dinning philosopher and reader-writer classical problem of process synchronization

kidussss

259 views

kidussss asked Sep 1, 2022

0 votes

2 answers

176

Made easy Test Series 2022
I am getting ans 6 and given ans is 8

I am getting ans 6 and given ans is 8

SKMAKM

555 views

SKMAKM asked Aug 30, 2022

1 votes

1 answer

177

Made easy || Database
Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.

Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.

Shreya2002

1.6k views

Shreya2002 asked Aug 9, 2022

1 votes

1 answer

178

Made easy || Operating system
Consider a process P running on a system with non-preemptive Kernel design. Consider following actions by P : (i) A blocking system call. (ii) Servicing a timer interrupt. (iii) Exit system call. (iv) Servicing a disk interrupt, that results in another blocked process being marked as ready. Which of the above actions always result in context-switch of P?

Consider a process P running on a system with non-preemptive Kernel design. Consider following actions by P :(i) A blocking system call.(ii) Servicing a timer interrupt.(...

Shreya2002

1.6k views

Shreya2002 asked Aug 5, 2022

0 votes

2 answers

179

Made easy || Operating system
While of the following is incorrect? (a) if a system uses preemptive CPU scheduler then deadlock is not possible in system (b) Deadlock state is an unsafe state. (c) If a system has total ordering of all resource types ... disabled) therefore deadlock should not possible in preemptive scheduling then how can this statement could be incorrect. please clarify the doubt

While of the following is incorrect?(a) if a system uses preemptive CPU scheduler then deadlock is not possible in system(b) Deadlock state is an unsafe state.(c) If a sy...

Shreya2002

1.3k views

Shreya2002 asked Aug 5, 2022

0 votes

1 answer

180

Madeasy test Series
Please explain how 2?

Please explain how 2?

SKMAKM

335 views

SKMAKM asked Jul 29, 2022

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