Recent questions without answers

Recent questions without answers

0 votes

0 answers

1

Applied Test Series
Options Given were:- A. During recovery, the log entry in line 4 will be redone. During recovery, the log entry in line 7 will be ignored. During recovery, the log entry in line 9 will be ignored. During recovery, the log entry in line 14 will be redone. can anybody tell me detailed soln for this as i am not used to checkpoint and commit type of questions

Sagar475 asked in Databases 17 hours ago

35 views

0 votes

0 answers

2

Applied Test Series
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple index. If the disk sector is 512 bytes, which is the closest option for maximum file size in this allocation scheme?

Sagar475 asked in Operating System 1 day ago

34 views

0 votes

0 answers

3

#selfdoubt
The time complexity of Build heap using linked list and Binary search tree construction using linked list????. Need some detailed explanation

Subbu. asked in Algorithms 2 days ago

by Subbu.

26 views

0 votes

0 answers

4

GeeksForGeeks AIM 2 - instruction format
Assume that the control memory is 32 bit wide. The micro-instruction format is divided into 3 fields. A micro operation field of 14 bits specifies the micro-operations to be performed. An address selection field specifies a condition based ... . How many bits are in address selection field, address field and the size of control memory in words respectively?

atulcse asked in CO and Architecture 2 days ago

20 views

0 votes

0 answers

5

Self made doubt
suppose we are given the congestion window 30KB and TO occurs than new th=15 and mss given =2 so when we start with slow start than sequence goes like:- 2 → 4 → 8 → 15 → 17 and so on or 2 → 4 → 8 → 14 → 16 → 18 and so on?

Sagar475 asked in Computer Networks 2 days ago

17 views

0 votes

0 answers

6

Propositional Logic | Made Easy Full Syllabus Test
How is B a tautology?

palashbehra5 asked in Mathematical Logic 3 days ago

by palashbehra5

61 views

0 votes

0 answers

7

made easy test series - cache addressing
Consider a 4-way set associative cache of 64 KB used in a 32-bit CPU, organized into 32-word blocks. System supports 64 GB RAM. Cache is designed with a write back protocol to handle the updation issues. In each line a valid bit is present to specify the status of a block. What is the size (in bits) of a tag directly in the cache controller?

atulcse asked in CO and Architecture 4 days ago

63 views

0 votes

0 answers

8

made easy test series - linear algebra
If 2 and -4 are the eigenvalues of a non-singular matrix A and |A| = -8, then the eigenvalues of adj(A) are x and -y. What is the value of x+y?

atulcse asked in Linear Algebra 4 days ago

33 views

0 votes

0 answers

9

Multi-level Paging
In paging , giving more bits to the innermost table as compared to the outermost page table results in using less physical memory space. Is this statement true always?

ankit3009 asked in Operating System 5 days ago

56 views

0 votes

0 answers

10

#aktu university
Draw the operator precedence table

Nitesh_Yadav asked in Compiler Design 6 days ago

by Nitesh_Yadav

16 views

0 votes

0 answers

11

#aktu university
Solve this question

Nitesh_Yadav asked in Theory of Computation 6 days ago

by Nitesh_Yadav

18 views

0 votes

0 answers

12

NIELIT 2021 Dec Scientist A - Section B: 43
Let the predicates $D(x,y)$ mean team $x$ defeated team $y$ and $P(x,y)$ mean team $x$ has played team $y$ ... $ \forall y \exists x (P(x,y) \rightarrow D(x,y))$ $\exists x \forall y (D(x,y) \rightarrow P(x,y))$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

31 views

0 votes

0 answers

13

NIELIT 2021 Dec Scientist A - Section B: 45
More than one word is put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the option

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

17 views

0 votes

0 answers

14

NIELIT 2021 Dec Scientist A - Section B: 47
Suppose a binary search tree has been constructed from the following sequence of numbers in the order in which they arrive : $6, 2, 10, 1, 5, 7, 11, 3, 9, 4, 8.$ Consider the following piece of code : Show(root) $ \{ \text { if (root != NULL)}$ ... $6, 10, 11, 7, 9, 8, 2, 5, 3, 4, 1$ $6, 10, 2, 11, 7, 9, 8, 5, 3, 4, 1$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

15 views

0 votes

0 answers

15

NIELIT 2021 Dec Scientist A - Section B: 48
The addressing mode/s, which uses the $\text{PC}$ instead of a general-purpose register is : Indexed with offset Relative Direct Both Indexed with offset and direct

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

12 views

0 votes

0 answers

16

NIELIT 2021 Dec Scientist A - Section B: 50
A microprogrammed control unit : is faster than hardwired control unit allows easy implementation of new instructions is useful when small programs are to be run none of the options

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

8 views

0 votes

0 answers

17

NIELIT 2021 Dec Scientist A - Section B: 51
Which open addressing technique is free from Clustering problems? Linear probing Quadratic probing Double hashing Rehashing

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

10 views

0 votes

0 answers

18

NIELIT 2021 Dec Scientist A - Section B: 52
Which of the following Boolean algebra rules is correct ? $ A. \overline{\rm A} = 1$ $ A + AB = A + B $ $ A(A+B) = B $ $ A+ \overline{\rm A}B = A + B $

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

8 views

0 votes

0 answers

19

NIELIT 2021 Dec Scientist A - Section B: 53
The largest number of faces in a simple connected maximal planar graph with $100$ vertices is : $200$ $198$ $196$ $96$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

8 views

0 votes

0 answers

20

NIELIT 2021 Dec Scientist A - Section B: 54
One of the purposes of using intermediate code in compilers is to: make parsing and semantic analysis simpler improve error recovery and error reporting increase the chances of reusing the machine – independent code optimizer in other compilers improve the register allocation

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

10 views

0 votes

0 answers

21

NIELIT 2021 Dec Scientist A - Section B: 55
If a hash table is implemented as a search tree, the expected time required to enter $\text{n}$ names and make $\text{m}$ searches is proportional to : $\text{(n+m)} \log_{2} \text{n}$ $\text{(n+m)} \log_{2} \text{m}$ $\text{mn} \log_{2} \text{n}$ $\text{mn} \log_{2} \text{m}$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

7 views

0 votes

0 answers

22

NIELIT 2021 Dec Scientist A - Section B: 56
A demultiplexer is used to : Route the data from single input to one of many outputs Perform serial to parallel conversion Both $\text{(A)}$ and $\text{(B)}$ Select data from several inputs and route it to single output

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

6 views

0 votes

0 answers

23

NIELIT 2021 Dec Scientist A - Section B: 57
Consider a relation $\text{R}$ with attributes $\{ \text{A, B, C} \}$ and functional dependency set $\text {S= \{ A} \rightarrow \text{B, } \text{A} \rightarrow \text{C} \; \}.$ Then relation $\text{R}$ ... None of the above

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

8 views

0 votes

0 answers

24

NIELIT 2021 Dec Scientist A - Section B: 58
Non leaf nodes of $\text{B+}$ tree structure from $\text{a}$ : Multilevel sparse indices Multilevel dense indices Sparse indices Multilevel clustered indices

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

8 views

0 votes

0 answers

25

NIELIT 2021 Dec Scientist A - Section B: 59
Let $\text{C} (n, \; r) = \binom{n}{r}.$ The value of $ \sum_{k=0}^{20}(2k+1) \text{C} (41, 2k+1),$ is : $40 (2)^{40}$ $40 (2)^{39}$ $41 (2)^{40}$ $41 (2)^{39}$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

9 views

0 votes

0 answers

26

NIELIT 2021 Dec Scientist A - Section B: 60
If $\text{R}$ and $\text{D}$ are the radius and diameter of the graph $\text{K}_{4,7}$, then the ordered pair $\text{(R, D)}$ is equal to : $(2,2)$ $(1,2)$ $(2,4)$ $(1,3)$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

10 views

0 votes

0 answers

27

NIELIT 2021 Dec Scientist A - Section B: 61
Let $\text{T(n)}$ be the number of different binary search trees on $\text{n}$ distinct elements-then $\text{T(n)} = \displaystyle{\sum_{k=1}^{n}} \text{T(K-1)} \; T(x)$ where $x$ is: $\text{ n – k + 1}$ $\text{ n – k}$ $\text{ n – k – 1}$ $\text{ n – k – 2}$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

10 views

0 votes

0 answers

28

NIELIT 2021 Dec Scientist A - Section B: 62
What is the annual change in traffic of software with $1 \; \text{million}$ lines of code with $30\%$ lines added and $10 \%$ lines are deleted ? $0.25$ $0.15$ $0.4$ $0.6$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

11 views

0 votes

0 answers

29

NIELIT 2021 Dec Scientist A - Section B: 63
The Cyclomatic complexity of two modules $\text{A}$ and $\text{B}$ are $10$ and $15$ respectively : What is the cyclomatic complexity of sequential integration of $\text{A}$ and $\text{B}$ ? $19$ $21$ $24$ $25$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

10 views

0 votes

0 answers

30

NIELIT 2021 Dec Scientist A - Section B: 64
Energy of power signal is : Finite Zero Infinite $1$

soujanyareddy13 asked in Others Jan 9

by soujanyareddy13

6 views

Page:

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

Follow @gateoverflow

GATE Overflow

Recent questions without answers

Search GATE Overflow