Recent questions without answers

0 votes

0 answers

1

Morris Mano
The binary numbers listed have a sign in the leftmost position and if negative, are in 2’s complement form. Perform the arithmetic operations indicated and verify: (a) 101011+ 111000 (b) 001110+110010 (c ) 111001-001010 (d) 101011-100110

lakshaymittal asked in CO and Architecture 22 hours ago

by lakshaymittal

14 views

0 votes

0 answers

2

Computer Organization, Instruction Set Architecture, Gateforum
Consider a system with 16 Registers(Ro,R1,...R8).An instruction SUB Ro,R1 , which is two bytes long,what is the space assigned to the opcode field (in bits) ?

Swarnava Bose asked in CO and Architecture 22 hours ago

by Swarnava Bose

11 views

0 votes

0 answers

3

Page Table Entries in page Table
In Page Table,page-frame address entries are static or Dynamic means whether they are changed or not??(Consider 1-level page table)

lalitver10 asked in Operating System 23 hours ago

11 views

0 votes

0 answers

4

Applied Test Series
The minimum number of literal obtained on simplifying the expression ABC + A’C + AB’C + A’BC are _______

LRU asked in Digital Logic 1 day ago

by LRU

17 views

0 votes

0 answers

5

Code optimization
Consider the following three address code t1 = t+e t2 = g+a t3 = t1*t2 t4 =t2+t2 t5 = t4+t3 How many minimum number of temporary variables required in the optimized three address code?

Anwesha_Mishra asked in Compiler Design 1 day ago

by Anwesha_Mishra

14 views

0 votes

0 answers

6

Computer Networks
How do we calculate the time in this scenario

Parshu gate asked in Computer Networks 2 days ago

24 views

0 votes

0 answers

7

#DBMS #E-R diagram
Can anyone verify this? What is the minimum number of tables required in the given situation? Assume there are two entities E1 containing attributes A1 and A2 and E2 containing attributes B1 and B2 attributes respectively, and between E1 and E2 relationship is R, which contains attribute C.

Crackca asked in Databases 2 days ago

34 views

0 votes

0 answers

8

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 3 days ago

by darshak_devani

44 views

0 votes

0 answers

9

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 4 days ago

24 views

0 votes

0 answers

10

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 4 days ago

by LRU

17 views

0 votes

0 answers

11

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 4 days ago

by LRU

23 views

0 votes

0 answers

12

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 5 days ago

23 views

1 vote

0 answers

13

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 5 days ago

31 views

0 votes

0 answers

14

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

Yusuf Rehman asked in Programming 5 days ago

by Yusuf Rehman

22 views

0 votes

0 answers

15

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 6 days ago

14 views

0 votes

0 answers

16

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 6 days ago

by person

25 views

0 votes

0 answers

17

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 6 days ago

by Aashay kaurav

42 views

0 votes

0 answers

18

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 6 days ago

14 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 Oct 15

by christ

16 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 Oct 13

by rayg

56 views

0 votes

0 answers

21

Theory of computation
Construct predictive parser for the following grammar and also check for the validity of the input string of your choice. bexpr → bexpr or bterm | bterm bterm → bterm and bfactor | bfactor bfactor → not bfactor | (bexpr) | true | false

Adaboina sushmitha asked in Theory of Computation Oct 11

by Adaboina sushmitha

27 views

0 votes

0 answers

22

Applied Test Series
A hypothetical system OSXZ_09 implements paging. Given LAS = 4 GB, PAS = 64 MB, Page size = 4 KB. A protection bit and a reference bit is also present in a page table entry. Then the size of the innermost page table is ____ B. Note : The memory is byte addressable.

LRU asked in Operating System Oct 11

by LRU

57 views

0 votes

0 answers

23

Construct compiler
Given the grammarS->XS | dS | ε ,X->Y | Zb | aY,Y->eZ,Z->e Construct the predictive parsing tableand show the moves made by the predictive parser on the input “dace

Adaboina sushmitha asked in Theory of Computation Oct 10

by Adaboina sushmitha

26 views

0 votes

0 answers

24

Differentiate between Conditional probability and Joint Probability
Hey all, I have a confusion regarding when to use P(A∩B) or P(A/B). Like in following question: A group consists of equal no of men and women .of this grp 20% of men and 50% of women are unemployed .If a ... is here, how to understand that 50% of women unemployed is P(Unemployed/Women) and not P(Women ∩ Unemployed) ? Thanks

Acejoy asked in Probability Oct 3

by Acejoy

23 views

1 vote

0 answers

25

4 Address Instruction
Where are 4 Address Instructions are used and how?

prashastinama asked in CO and Architecture Oct 3

by prashastinama

44 views

1 vote

0 answers

26

GATE ACADEMY TEST SERIES
Under a relational database if table A has a foreign key constraint referencing to another table B, then Each tuple in A is related to zero or one tuple of B. Each tuple in A is related to exactly one tuple of B. Each tuple of A is related to zero or more tuple of B. None of these.

LRU asked in Databases Sep 29

by LRU

51 views

0 votes

0 answers

27

TIFR2021-Maths-A: 1
For each positive integer $n$, let $s_n=\frac{1}{\sqrt{4n^2-1^2}}+\frac{1}{\sqrt{4n^2-2^2}}+\dots+\frac{1}{\sqrt{4n^2-n^2}}$ Then the $\displaystyle \lim_{n\rightarrow \infty}s_n$ equals $\pi/2$ $\pi/6$ $1/2$ $\infty$

soujanyareddy13 asked in Others Sep 27

by soujanyareddy13

51 views

0 votes

0 answers

28

TIFR2021-Maths-A: 2
The number of bijective maps $g:\mathbb{N}\rightarrow\mathbb{N}$ such that $\sum_{n=1}^\infty\frac{g(n)}{n^2}<\infty$ is $0$ $1$ $2$ $\infty$

soujanyareddy13 asked in Others Sep 27

by soujanyareddy13

29 views

0 votes

0 answers

29

TIFR2021-Maths-A: 3
The value of $\displaystyle\lim_{n\rightarrow\infty}\prod_{k=2}^{n}\left(1-\frac{1}{k^2}\right)$ is $1/2$ $1$ $1/4$ $0$

soujanyareddy13 asked in Others Sep 27

by soujanyareddy13

23 views

0 votes

0 answers

30

TIFR2021-Maths-A: 4
The set $S=\{x\in \mathbb{R}|x>0\text{ and } (1+x^2) \tan(2x)=x\}$ is empty nonempty but finite countably infinite uncountable

soujanyareddy13 asked in Others Sep 27

by soujanyareddy13

23 views

Page:

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

Follow @gateoverflow

GATE Overflow

Recent questions without answers

Search GATE Overflow