Recent questions in Others

Recent questions in Others

0 votes

1 answer

1

Hello sir, If I subscribe to GO Combined Test series. Can I also get the access of all the test of ISRO,TIFR, UGC-Net, etc. ?

TusharKumar asked in Others Jun 6

27 views

0 votes

0 answers

2

Preparation strategy
After doing a lot of numerical and understanding the concepts well I am not be able to find out the accurate answer within a certain amount of time plz suggest me something what should i do ?

Vaishnavi Gadhe asked in Study Resources May 30

by Vaishnavi Gadhe

276 views

0 votes

1 answer

3

How to prepare for GATE 2023 CSE along with a job and only self-study?
I am a past student of Made Easy and got AIR 7500 in GATE 2022. I would like to get suggestions.

Deucalion_sash asked in Others May 26

by Deucalion_sash

94 views

0 votes

1 answer

4

Can i write the exams any time after successful payment or only on the specified date?

AthiraBtk asked in Others May 7

40 views

0 votes

1 answer

5

Made easy vs [email protected]
I Am planning to procure study material for Gate . Which should I Choose Between Made easy and [email protected]?

adityatejas562 asked in Others May 5

by adityatejas562

88 views

0 votes

1 answer

6

GATEOVERFLOW QUESTION
what is join circle request in GO site and what is the advantage of this and what is the use of this and if i sent circle request to anyone ort accept the request from anyone what does means ?

ykrishnay asked in Others Apr 20

95 views

0 votes

0 answers

7

The most relevant nptel courses for GATE and Technical Interview preparation
Hello everyone! I am looking for resources to study the gate subjects in some depth such that it helps in gate as well as psu/mtech interview preparation. Well of course, no course is bad or good, it all adds to your ... So if any of you have any links to share kindly share it. Thanks and all the best for your preparation!

begonethots asked in Study Resources Apr 12

105 views

1 vote

0 answers

8

NIELIT 2022 Jan Scientist B | Section B | Question: 45
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63).$ Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and ... number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

63 views

1 vote

0 answers

9

NIELIT 2022 Jan Scientist B | Section B | Question: 46
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000 \; \text{bytes}$ and the transmission rate at the sender is $80 \; \text{Kbps (1 Kbps = 1000 bits/second)}.$ ... $\text{bytes/second}.$ $2500$ $2000$ $1500$ $500$

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

38 views

1 vote

1 answer

10

NIELIT 2022 Jan Scientist B | Section B | Question: 49
Let $\text{R (A, B, C, D)}$ be a relational schema with the following functional dependencies: $\text{A} \rightarrow \text{B, B} \rightarrow \text{C}$ $\text{C} \rightarrow \text{D}$ ... dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

51 views

1 vote

0 answers

11

NIELIT 2022 Jan Scientist B | Section B | Question: 50
Match the following: ... $\text{(I)}$ $\text{(II)}$ $\text{(III)}$ $\text{(IV)}$

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

40 views

1 vote

0 answers

12

NIELIT 2022 Jan Scientist B | Section B | Question: 51
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices $\text{S}$ and $\text{T}$. Which one will be reported by Dijkstra's shortest path algorithm? Assume that, in any iteration, the shortest path to ... path to $\text{v}$ is discovered. $\text{SDT}$ $\text{SBDT}$ $\text{SACDT}$ $\text{SACET}$

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

36 views

1 vote

0 answers

13

NIELIT 2022 Jan Scientist B | Section B | Question: 52
Consider the expression $(a-1) * (((b+c) / 3)) + d))$. Let $\text{X}$ be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which only load and ... can have only register or immediate operands. The value of $\text{X}$ is _____________ . $2$ $1$ $4$ $3$

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

21 views

1 vote

0 answers

14

NIELIT 2022 Jan Scientist B | Section B | Question: 53
What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle? ... $\text{(P) - (2), (Q) - (3), (R) - (4), (S) - (1)}$

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

17 views

1 vote

1 answer

15

NIELIT 2022 Jan Scientist B | Section B | Question: 54
The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies: name, courseNo, $\rightarrow$ grade rollNo, courseNo $\rightarrow$ grade name $\rightarrow$ rollNo rollNo $\rightarrow$ name The ... form of this relation scheme is $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$ $\text{4NF}$

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

33 views

1 vote

0 answers

16

NIELIT 2022 Jan Scientist B | Section B | Question: 55
Flat top sampling of low pass signals __________ gives rise to aperture effect implies oversampling lead to aliasing introducing delay distortion

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

14 views

1 vote

0 answers

17

NIELIT 2022 Jan Scientist B | Section B | Question: 56
Consider these two functions and two statements $\text{S1}$ and $\text{S2}$ about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2] - 3; } int work2(int *a, int i, int j) { int t1 = i+2; int ... false and $\text{S2}$ is true $\text{S1}$ is true and $\text{S2}$ is false $\text{S1}$ is true and $\text{S2}$ is true

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

29 views

1 vote

0 answers

18

NIELIT 2022 Jan Scientist B | Section B | Question: 57
Consider the following two phase locking protocol. Suppose a transaction $\text{T}$ ... guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

28 views

1 vote

0 answers

19

NIELIT 2022 Jan Scientist B | Section B | Question: 58
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by ... is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

20 views

1 vote

0 answers

20

NIELIT 2022 Jan Scientist B | Section B | Question: 59
Let $\text{T}$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $\text{T}$ are: The height of a tree with a single node is $0$. $4$ and $15$ respectively $3$ and $14$ respectively $4$ and $14$ respectively $3$ and $15$ respectively

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

27 views

Page:

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

Follow @gateoverflow

Recent questions in Others

Search GATE Overflow for GATE CSE