Recent questions and answers in Others - GATE Overflow

0 votes

1 answer

1

NIELIT 2016 DEC Scientist B (CS) - Section B: 39
External Interrupt may not arise because of illegal or erroneous use of an instruction. a timing device. external source. I/O devices.

answered 1 day ago in Others by Mohit Kumar 6 Active | 13 views

0 votes

1 answer

2

NIELIT 2016 DEC Scientist B (CS) - Section B: 17
$T1$ carrier system is used: For delta modulation Industrial noise For frequency modulated signals None of the above

answered 1 day ago in Others by Mohit Kumar 6 Active | 14 views

0 votes

2 answers

3

UGCNET-Jan2017-II: 1
Consider a sequence $F_{00}$ defined as : $F_{00}\left ( 0 \right )= 1, F_{00}\left ( 1 \right )= 1\\$ $F_{00}\left ( n \right )= \frac{10 * F_{00}\left ( n-1 \right )+100}{F_{00}\left ( n-2 \right )} \text{ for }n\geq 2 \\$ Then what shall be the set ... $\left ( 1,110, 600,1200 \right )$ $\left ( 1, 2, 55, 110, 600, 1200 \right )$ $\left ( 1, 55, 110, 600, 1200 \right )$

answered 2 days ago in Others by Mohit Kumar 6 Active | 29 views

0 votes

1 answer

4

NIELIT 2016 MAR Scientist C - Section C: 48
In a microprocessor, WAIT states are used to make the processor wait during a DMA operation make the processor wait during a power interrupt processing make the processor wait during a power shutdown interface slow peripherals to the processor

answered May 19 in Others by Mohit Kumar 6 Active | 17 views

0 votes

3 answers

5

NIELIT 2017 DEC Scientist B - Section B: 38
Which of the following is false? The smallest and fastest computer imitating brain working is called quantum computer. A computer with a speed of around $100$ million instructions per second with the word length of around $64$ bits is known as super computer. The term Exa-byte = 1024 Tera Bytes. None of the options.

answered May 19 in Others by Hradesh patel Loyal | 16 views

0 votes

1 answer

6

NIELIT 2016 MAR Scientist C - Section C: 45
An instruction used to set the carry flag in a computer can be classified as data transfer process control logical program control

answered May 19 in Others by Mohit Kumar 6 Active | 16 views

0 votes

1 answer

7

NIELIT 2016 MAR Scientist C - Section C: 15
The defining language for developing a formalism in which language definitions can be stated, is called syntactic meta language decidable language intermediate language high level language

answered May 19 in Others by Mohit Kumar 6 Active | 33 views

0 votes

1 answer

8

NIELIT 2016 MAR Scientist C - Section C: 6
Memory mapped displays are utilized for high resolution graphics such as maps uses ordinary memory to store the display data in character form stores the display data as individual bits are associated with electromechanical teleprinters

answered May 19 in Others by Mohit Kumar 6 Active | 45 views

0 votes

2 answers

9

UGCNET-Nov2017-III: 06
A micro-instruction format has micro-ops field which is divided into three subfields F1, F2, F3 each having seven distinct micro operations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field ADF. The address space ... locations. The size of micro-instruction is : (1) 17 bits (2) 20 bits (3) 24 bits (4) 32 bits

answered May 14 in Others by IITB2020 | 391 views

0 votes

1 answer

10

NIELIT 2017 July Scientist B (IT) - Section B: 51
In digital logic, if $A\oplus B=C$, then which one of the following is true? $A\oplus C=B$ $B\oplus C=A$ $A\oplus B\oplus C=0$ Both A and B

answered May 10 in Others by Mohit Kumar 6 Active | 21 views

0 votes

1 answer

11

NIELIT 2017 July Scientist B (IT) - Section B: 21
The relation $\{(1,2),(1,3)(3,1),(1,1),(3,3),(3,2),(1,4),(4,2),(3,4)\}$ is Reflexive Transitive Symmetric Asymmetric

answered May 9 in Others by Mohit Kumar 6 Active | 23 views

0 votes

1 answer

12

NIELIT 2016 DEC Scientist B (IT) - Section B: 3
An object can have which of the following multiplicities? Zero More than one One All of the above

answered May 9 in Others by kpc | 30 views

0 votes

1 answer

13

UGCNET-Dec2004-II: 8
An example of a connective which is not associative is : AND OR EX-OR NAND

answered May 5 in Others by Mohit Kumar 6 Active | 12 views

0 votes

1 answer

14

UGCNET-June2005-II: 48
Which interim standard describes inter-switching networking? $IS- 54$ $IS-95$ $DS-45$ $ANSI-41$

answered May 5 in Others by Mohit Kumar 6 Active | 10 views

0 votes

1 answer

15

UGCNET-June2005-II: 39
Which is the correct definition of a valid process transition in an operating system ? Wake up : Ready $\rightarrow$ Running Dispatch: Ready $\rightarrow$ Running Block : Ready $\rightarrow$ Running Timer run out: Ready $\rightarrow$ Blocked

answered May 5 in Others by Mohit Kumar 6 Active | 17 views

0 votes

1 answer

16

UGCNET-June2007-II: 37
Window is a _______ operating system: Non-preemptive Preemptive Multi-user Real time

answered May 5 in Others by Mohit Kumar 6 Active | 9 views

0 votes

1 answer

17

UGCNET-June2007-II: 25
Application of data structure is queue is: Level wise printing of tree. Implementation of priority queues. Function call implementation Depth first search in a graph.

answered May 5 in Others by Mohit Kumar 6 Active | 12 views

0 votes

1 answer

18

UGCNET-June2007-II: 21
The time required to find the shortest path in a graph with $n$ vertices and $e$ edges is: $O(e)$ $P(n)$ $O(e^{2})$ $O(n^{2})$

answered May 5 in Others by Mohit Kumar 6 Active | 11 views

0 votes

1 answer

19

UGCNET-June2007-II: 19
A Relation $R=${$A,B,C,D,E,F$} is given with following set of functional dependencies: $F=${$A\rightarrow B, AD\rightarrow C,B\rightarrow F,A\rightarrow E$} $A$ $AC$ $AD$ None of these

answered May 5 in Others by Mohit Kumar 6 Active | 11 views

0 votes

1 answer

20

UGCNET-June2007-II: 11
The following loop in $’C’$: int $i=0$; While $(i++<0)i--$; will terminate will go into an infinite loop will give compilation error will never be executed

answered May 5 in Others by Mohit Kumar 6 Active | 19 views

0 votes

1 answer

21

UGCNET-June2007-II: 34
Symbol table can be used for: Checking type campability Suppressing duplication of error message Storage allocation All of these above

answered May 5 in Others by Mohit Kumar 6 Active | 14 views

0 votes

1 answer

22

UGCNET-June2007-II: 31
The parsing technique that avoids back tracking is: Top-down parsing Recursive-descent parsing Predicative Syntax tree

answered May 5 in Others by Mohit Kumar 6 Active | 16 views

0 votes

1 answer

23

UGCNET-June2007-II: 32
A Top-down Parse generates: Right-most derivation. Right-most derivation, in reverse. Left-most derivation. Left-most derivation, in reverse.

answered May 4 in Others by Mohit Kumar 6 Active | 18 views

0 votes

1 answer

24

NIELIT 2016 MAR Scientist C - Section C: 52
Consider the process of inserting an element into a $Max\ Heap$, where the $Max\ Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ ... is $\Theta(\log _{2}n)$ $\Theta(n\log _{2}n)$ $\Theta n$ $\Theta(n\log _{2}n)$

answered May 3 in Others by Mohit Kumar 6 Active | 15 views

0 votes

1 answer

25

NIELIT 2016 MAR Scientist C - Section C: 51
The most efficient algorithm for finding the number of connected components in a $n$ undirected graph on $n$ vertices and $m$ edges has time complexity $\Theta (n)$ $\Theta (m)$ $\Theta (m+n)$ $\Theta (mn)$

answered May 3 in Others by Mohit Kumar 6 Active | 18 views

0 votes

1 answer

26

NIELIT 2016 MAR Scientist C - Section C: 50
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1,2,\dots,n.$ You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient ... $\Theta(n)$ $\Theta(n \log n)$ None of the above, as the tree cannot be uniquely determined.

answered May 3 in Others by Mohit Kumar 6 Active | 16 views

0 votes

1 answer

27

NIELIT 2016 MAR Scientist C - Section C: 49
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$

answered May 3 in Others by Mohit Kumar 6 Active | 19 views

0 votes

1 answer

28

NIELIT 2016 MAR Scientist C - Section C: 47
If a processor does not have any stack pointer register, then it cannot have subroutine call instruction it can have subroutine call instruction, but no nested subroutine calls nested subroutine calls are possible, but interrupts are not all sequences of subroutine calls and also interrupts are possible

answered May 3 in Others by Mohit Kumar 6 Active | 14 views

0 votes

1 answer

29

NIELIT 2016 MAR Scientist C - Section C: 46
Micro program is the name of source program in micro computers the set of instructions indicating the primitive operations in a system primitive form of macros used in assembly language programming program of very small size

answered May 3 in Others by Mohit Kumar 6 Active | 17 views

0 votes

1 answer

30

NIELIT 2016 MAR Scientist C - Section C: 44
Which of the following conditions must be met to avoid race around problem? $\Delta t< t_{p}< T$ $T>\Delta t> t_{p}$ $2t_{p}< \Delta t< T$ none of these

answered May 3 in Others by Mohit Kumar 6 Active | 14 views

0 votes

1 answer

31

NIELIT 2016 MAR Scientist C - Section C: 40
If the input $\text{J}$ is connected through $\text{K}$ input of $\text{J-K}$, then flip-flop will behave as a D type flip-flop T type flip-flop S-R flip-flop Toggle switch

answered May 3 in Others by Mohit Kumar 6 Active | 18 views

0 votes

1 answer

32

NIELIT 2016 MAR Scientist C - Section C: 39
If a clock with time period $“T”$ is used with $n$ stage shift register, then output of final stage will be delayed by $nT$ sec $(n-1)T$ sec $n/T$ sec $(2n-1)T$ sec

answered May 3 in Others by Mohit Kumar 6 Active | 16 views

0 votes

1 answer

33

NIELIT 2016 MAR Scientist C - Section C: 38
How many bits are required to encode all twenty six letters, ten symbols, and ten numerals? $5$ $6$ $7$ $46$

answered May 3 in Others by Mohit Kumar 6 Active | 15 views

0 votes

1 answer

34

NIELIT 2016 MAR Scientist C - Section C: 37
A sequential circuit outputs a $\text{ONE}$ when an even number$(>0)$ of one’s are input; otherwise the output is $\text{ZERO}.$ The minimum number of states required is $0$ $1$ $2$ $3$

answered May 3 in Others by Mohit Kumar 6 Active | 16 views

0 votes

1 answer

35

NIELIT 2016 MAR Scientist C - Section C: 30
A hash table with $10$ buckets with one slot per bucket is depicted. The symbols, $S1$ to $S7$ are initially emerged using a hashing function with linear probing. Maximum number of comparisons needed in searching an item that is not present is $6$ $5$ $4$ $3$

answered May 3 in Others by Mohit Kumar 6 Active | 30 views

0 votes

1 answer

36

NIELIT 2016 MAR Scientist C - Section C: 25
Which of the following is FALSE? $Read\ \wedge as\ AND, \vee\ as\ OR, \sim as\ NOT, \rightarrow$ as one way implication and $\leftrightarrow$ as two way implication? $((x\rightarrow y)\wedge x)\rightarrow y$ $((\sim x\rightarrow y)\wedge (\sim x\wedge \sim y))\rightarrow x$ $(x\rightarrow (x\vee y))$ $((x\vee y)\leftrightarrow (\sim x\vee \sim y))$

answered May 3 in Others by Mohit Kumar 6 Active | 25 views

0 votes

1 answer

37

NIELIT 2016 MAR Scientist C - Section C: 10
Relocation bits used by relocating loader are specified by Relocating loader itself Linker Assembler Macro processor

answered May 2 in Others by Mohit Kumar 6 Active | 34 views

0 votes

1 answer

38

I want to buy go pdf hardcopy for gate 2020,how can i get that

answered Apr 29 in Others by vipin.gautam1906 | 513 views

0 votes

1 answer

39

NIELIT 2016 DEC Scientist B (IT) - Section B: 18
Which of the following is a fundamental operation in relational algebra? Set intersection Assignment Natural Join None of the above

answered Apr 29 in Others by vadivel112 | 12 views

0 votes

1 answer

40

KPGCET-CSE-2019-4
The schema for the entire database is designed using Data definitional language Structured query language Data manipulation language Schema structure language

answered Apr 28 in Others by DIBAKAR MAJEE Active | 22 views

To see more, click for all the questions in this category.

Recent questions and answers in Others

52,218 questions

59,856 answers

201,052 comments

118,108 users