Recent questions

0 votes

0 answers

1

Applied Practice test
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns PFST = 500,000 ns 50% of the pages are dirty OS uses a single level page table What is the approximated effective access time (EAT) if we assume the page fault rate is 10%? Assume the cost to update the TLB, the page table, and the frame table (if needed) is negligible.

darshak_devani asked in Operating System 12 hours ago

by darshak_devani

16 views

0 votes

1 answer

2

operating system
Can cache hit happen in case of TLB miss or one should directly jump to page table in case of TLB miss?

Pankaj_Kumar asked in Operating System 1 day ago

by Pankaj_Kumar

25 views

0 votes

0 answers

3

mtech admission
I have lost my 1st sem marksheet,now i came to know that marksheets of each and every sem are required for admission I have applied for a duplicate one but it will take more than a year.

ankur12587 asked in Written Exam 1 day ago

17 views

0 votes

1 answer

4

Applied Test Series
Let S be a binary semaphore variable. Let S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed. 5 P, 7 V, 10 P, 13 V, 17 P The number of blocked processes at the end are _________.

LRU asked in Operating System 1 day ago

by LRU

15 views

0 votes

0 answers

5

Applied Test Series
It is given that in a system, processes P and C communicate by means of 3 semaphores and one buffer. The buffer size is given as 10. A semaphore M is used to implement mutual exclusion. Initial value of M is 1. The value of M is decremented by any process ... = 1, E = 7, F = 0 Out of the four combinations given above, the total number of combinations which cannot exist is ____

LRU asked in Operating System 1 day ago

by LRU

10 views

1 vote

1 answer

6

Applied Test Series
Consider the following statements : Satisfies Mutual exclusion Satisfies Progress Satisfies Bounded wait Suffers from deadlock The number of above statements that is correct about disable interrupt for a uniprocessor system is ___.

LRU asked in Operating System 1 day ago

by LRU

7 views

0 votes

0 answers

7

Applied Test Series
The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion (B) Satisfies Progress (C) Satisfies Bounded wait (D) Suffers from deadlock

LRU asked in Operating System 1 day ago

by LRU

14 views

0 votes

0 answers

8

TestBook test series: Database
Consider two relations $R$ and $S$ of size $1200$ bytes and $1000$ bytes respectively. The size of a tuple in both relations is $20$ bytes. The block size of the system is $100$ Bytes. How many extra block transfers would be required, in the worst case, if nested loop join is used instead of block nested loop join technique to compute the natural join?

Nishisahu asked in Databases 1 day ago

15 views

1 vote

0 answers

9

Gate cse pyq
L={xy | x,y€(a+b)* , |x| =|y| , x != y} How L is cfl? How can I make PDA for this?

Bikram Das asked in Theory of Computation 1 day ago

25 views

0 votes

0 answers

10

Gate applied Test Series
Can anyone help explain the concept of enums through this question,please?

Yusuf Rehman asked in Programming 2 days ago

by Yusuf Rehman

15 views

0 votes

0 answers

11

conflict serializable
Find Total no of conflict serializable and view serializable T1: R1(A) W1(A) R1(B) W1(B) T2: R2(A) W2(A) R2(B) W2(B)

sambey4 asked in Databases 2 days ago

11 views

0 votes

0 answers

12

Introduction to Modern Cryptography
Let $\varepsilon>0$ be a constant. Say an encryption scheme is $\varepsilon$-perfectly secret if for every adversary $\mathcal{A}$ ... scheme that is $\varepsilon$-perfectly secret must have $|\mathcal{K}| \geq(1-2 \varepsilon) \cdot|\mathcal{M}| $

person asked in Computer Networks 2 days ago

by person

12 views

0 votes

0 answers

13

Made Easy Test series
Consider the following language : P1 : {<M, x, k>| M is a TM and M does not halt on x within k steps} P2 : {<M>| M is TM and L(M) = $\phi$} P3 : {<M>| M is a TM and L(M) = finite language} The number of problems which are not RE is/are _______ ?

Aashay kaurav asked in Theory of Computation 2 days ago

by Aashay kaurav

28 views

0 votes

1 answer

14

view serializable
Find View Serializable T1 : R1(A) , R1(B) , W1(B) T2 : R2(A) , R2(B) , W2(B)

sambey4 asked in Databases 3 days ago

18 views

0 votes

0 answers

15

#self doubt #lossy or lossless decomposition #DBMS
How the candidate key B can help relation R(A,B,C,D) decomposition into two relations R1(A,B) and R2(B,C,D) to be lossless decomposition?

jayadev asked in Databases 3 days ago

13 views

0 votes

0 answers

16

Self doubt
Given an NFA N, whether there is a PDA P such that N and P accept the same language. It is decidable or not

samarpita asked in Theory of Computation 3 days ago

11 views

2 votes

1 answer

17

Applied Test Series
Consider an array contains n integers, each integer belongs to {0, 1, 2}. What is the best case time complexity to sort an array?

LRU asked in Algorithms 3 days ago

by LRU

44 views

0 votes

1 answer

18

Applied Test Series
A Professor tells 3 Jokes in his maths class each year. How large a set of jokes does the professor need in order never to repeat the exact same triple of jokes over a period of 12 years?_________

LRU asked in Combinatory 3 days ago

by LRU

20 views

0 votes

0 answers

19

assignment
2. Propose a mechanism that virtual circuit switches might use so that if one switch loses all its state regarding connections then a sender of packets along a path through that switch is informed of the failure.

christ asked in Computer Networks 4 days ago

by christ

14 views

0 votes

0 answers

20

BARC 2020 CS interview question
In a program, you build a tree(non-empty) according to some inputs in the program. Now you have to shutdown your computer and the next day you need to work on this already build tree(do not build the tree again from scratch). How would ... something else to get the already build tree? The tree can be binary or non-binary but non-empty. Give a detailed explanation.

rayg asked in DS 5 days ago

by rayg

53 views

Page:

1
2
3
4
5
6
...
1000
next »

Follow @gateoverflow

GATE Overflow

Recent questions

Search GATE Overflow