Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nielit2016mar-scientistc
2
votes
2
answers
31
NIELIT 2016 MAR Scientist C - Section C: 31
A full binary tree with $n$ non-leaf nodes contains $\log_ 2 n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
admin
784
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
binary-tree
+
–
2
votes
1
answer
32
NIELIT 2016 MAR Scientist C - Section C: 32
Two finite state machines are said to be equivalent if they have same number of states have same number of edges have same number of states and edges recognize same set of tokens
Two finite state machines are said to be equivalent if theyhave same number of stateshave same number of edgeshave same number of states and edgesrecognize same set of to...
admin
863
views
admin
asked
Apr 2, 2020
Theory of Computation
nielit2016mar-scientistc
theory-of-computation
finite-automata
+
–
1
votes
1
answer
33
NIELIT 2016 MAR Scientist C - Section C: 33
In networking terminology UTP means Unshielded Twisted pair Ubiquitious Teflon port Uniformly Terminating port Unshielded T- connector port
In networking terminology UTP meansUnshielded Twisted pairUbiquitious Teflon portUniformly Terminating portUnshielded T- connector port
admin
534
views
admin
asked
Apr 2, 2020
Computer Networks
nielit2016mar-scientistc
computer-networks
+
–
1
votes
2
answers
34
NIELIT 2016 MAR Scientist C - Section C: 34
Given the following relation instance: $\begin{array}{ccc} X & Y & Z \\ \hline 1 & 4 & 2 \\ 1 & 5 & 3 \\ 1 & 6 & 3 \\ 3 & 2 & 2 \end{array}$ Which of the following functional dependencies are ... $YZ \rightarrow X \text{ and } X \rightarrow Z$ $XZ \rightarrow Y \text{ and } Y \rightarrow X$
Given the following relation instance:$\begin{array}{ccc} X & Y & Z \\ \hline 1 & 4 & 2 \\ 1 & 5 & 3 \\ 1 & 6 & 3 \\ 3 & 2 & 2 \end{array}$Which of the following function...
admin
742
views
admin
asked
Apr 2, 2020
Databases
nielit2016mar-scientistc
databases
data-dependency
+
–
1
votes
1
answer
35
NIELIT 2016 MAR Scientist C - Section C: 35
Consider the schema $R=(\text{S T U V})$ and the dependencies $ S \rightarrow T, T \rightarrow U, U \rightarrow V$, and $V \rightarrow S.$ If $R=(R1 \text{ and } R2)$ be a decomposition such that $R1 \cap R2= \phi$ ... $\text{3 NF}$ in $\text{3 NF}$ but not in $\text{2 NF}$ in both $\text{2 NF}$ and $\text{3 NF}$
Consider the schema $R=(\text{S T U V})$ and the dependencies $ S \rightarrow T, T \rightarrow U, U \rightarrow V$, and $V \rightarrow S.$ If $R=(R1 \text{ and } R2)$ be...
admin
806
views
admin
asked
Apr 2, 2020
Databases
nielit2016mar-scientistc
databases
data-dependency
+
–
1
votes
1
answer
36
NIELIT 2016 MAR Scientist C - Section C: 36
Odd parity of word can be conveniently tested by OR gate AND gate NOR gate XOR gate
Odd parity of word can be conveniently tested by OR gateAND gateNOR gateXOR gate
admin
1.7k
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
+
–
2
votes
1
answer
37
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$
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 i...
admin
1.2k
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
sequential-circuit
+
–
1
votes
2
answers
38
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$
How many bits are required to encode all twenty six letters, ten symbols, and ten numerals?$5$$6$$7$$46$
admin
742
views
admin
asked
Apr 2, 2020
Computer Networks
nielit2016mar-scientistc
computer-networks
network-security
+
–
1
votes
3
answers
39
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
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
admin
1.2k
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
sequential-circuit
+
–
1
votes
2
answers
40
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
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-flopT type flip-flopS-R flip-flopToggle switch
admin
716
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
flip-flop
+
–
1
votes
1
answer
41
NIELIT 2016 MAR Scientist C - Section C: 41
To build a mod-$19$ counter the number of flip-flop required is $3$ $5$ $7$ $8$
To build a mod-$19$ counter the number of flip-flop required is$3$$5$$7$$8$
admin
1.8k
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
flip-flop
+
–
0
votes
0
answers
42
NIELIT 2016 MAR Scientist C - Section C: 42
A stable multivibrator are used as comparator circuit squaring circuit frequency to voltage converter voltage to frequency converter
A stable multivibrator are used as comparator circuitsquaring circuitfrequency to voltage convertervoltage to frequency converter
admin
332
views
admin
asked
Apr 2, 2020
Digital Signal Processing
nielit2016mar-scientistc
non-gate
+
–
0
votes
0
answers
43
NIELIT 2016 MAR Scientist C - Section C: 43
The astable multivibrator has two quasi stable states two stable states one stable and one quasi-stable state none of these
The astable multivibrator hastwo quasi stable statestwo stable statesone stable and one quasi-stable statenone of these
admin
229
views
admin
asked
Apr 2, 2020
Digital Signal Processing
nielit2016mar-scientistc
non-gate
+
–
1
votes
1
answer
44
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
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
admin
849
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
flip-flop
+
–
0
votes
2
answers
45
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
An instruction used to set the carry flag in a computer can be classified asdata transferprocess controllogicalprogram control
admin
2.0k
views
admin
asked
Apr 2, 2020
CO and Architecture
nielit2016mar-scientistc
co-and-architecture
machine-instruction
+
–
0
votes
2
answers
46
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
Micro program is the name of source program in micro computersthe set of instructions indicating the primitive operations in a systemprimitive form of macros used in asse...
admin
1.4k
views
admin
asked
Apr 2, 2020
CO and Architecture
nielit2016mar-scientistc
co-and-architecture
microprogramming
+
–
0
votes
1
answer
47
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
If a processor does not have any stack pointer register, thenit cannot have subroutine call instructionit can have subroutine call instruction, but no nested subroutine c...
admin
634
views
admin
asked
Apr 2, 2020
CO and Architecture
nielit2016mar-scientistc
co-and-architecture
+
–
0
votes
1
answer
48
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
In a microprocessor, WAIT states are used to make the processor wait during a DMA operation make the processor wait during a power interrupt processingmake the processor ...
admin
595
views
admin
asked
Apr 2, 2020
Digital Signal Processing
nielit2016mar-scientistc
non-gate
microprocessors
+
–
1
votes
1
answer
49
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})$
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 (\lo...
admin
685
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
binary-heap
+
–
1
votes
1
answer
50
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.
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...
admin
824
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
binary-search-tree
+
–
3
votes
2
answers
51
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)$
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...
admin
897
views
admin
asked
Apr 2, 2020
Algorithms
nielit2016mar-scientistc
algorithms
time-complexity
+
–
3
votes
1
answer
52
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$ ... $\Theta(n\log _{2} \log_2 n)$ $\Theta (n)$ $\Theta(n\log _{2}n)$
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 ...
admin
1.9k
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
binary-search
time-complexity
binary-heap
+
–
0
votes
3
answers
53
NIELIT 2016 MAR Scientist C - Section C: 53
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves in linear time ... the array solves it using divide and conquer in time $\theta (n\log n)$ solves it in time $\theta (n^{2})$
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an arraysolves it in...
admin
1.6k
views
admin
asked
Apr 2, 2020
Algorithms
nielit2016mar-scientistc
algorithms
array
+
–
1
votes
2
answers
54
NIELIT 2016 MAR Scientist C - Section C: 54
In a circularly linked list organization, insertion of a record involves the modification of no pointer $1$ pointer $2$ pointers $3$ pointers
In a circularly linked list organization, insertion of a record involves the modification ofno pointer$1$ pointer$2$ pointers$3$ pointers
admin
892
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
linked-list
+
–
3
votes
1
answer
55
NIELIT 2016 MAR Scientist C - Section C: 55
To sort many large objects or structures, it would be most efficient to place them in an array and sort the array pointers to them in an array and sort the array them in a linked list and sort the linked list references to them in an array and sort the array
To sort many large objects or structures, it would be most efficient to placethem in an array and sort the arraypointers to them in an array and sort the arraythem in a l...
admin
1.4k
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
array
+
–
2
votes
2
answers
56
NIELIT 2016 MAR Scientist C - Section C: 56
The average search time of hashing, with linear probing will be less if the load factor is far less than one equals one is far greater than one none of these
The average search time of hashing, with linear probing will be less if the load factoris far less than oneequals oneis far greater than onenone of these
admin
856
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
hashing
+
–
2
votes
1
answer
57
NIELIT 2016 MAR Scientist C - Section C: 57
If initialization is a part of declaration of a structure, then storage class can be automatic register static anything
If initialization is a part of declaration of a structure, then storage class can beautomaticregisterstaticanything
admin
1.9k
views
admin
asked
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
2
votes
1
answer
58
NIELIT 2016 MAR Scientist C - Section C: 58
For $x$ and $y$ are variables as declared below $\textit{double }x=0.005, \: y = – 0.01;$ What is the value of $\text{ceil }(x+y)$, where $\text{ceil }$ is a function to compute ceiling of a number? $1$ $0$ $0.005$ $0.5$
For $x$ and $y$ are variables as declared below $\textit{double }x=0.005, \: y = – 0.01;$ What is the value of $\text{ceil }(x+y)$, where $\text{ceil }$ is a function t...
admin
825
views
admin
asked
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
1
votes
3
answers
59
NIELIT 2016 MAR Scientist C - Section C: 59
In C programming language, if the first and the second operands of operator $+$ are of types int and float, respectively, the result will be of type int float char long int
In C programming language, if the first and the second operands of operator $+$ are of types int and float, respectively, the result will be of type intfloatcharlong int
admin
1.1k
views
admin
asked
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
1
votes
1
answer
60
NIELIT 2016 MAR Scientist C - Section C: 60
What will be the value of $x$ and $y$ after execution of the following statement(C language) n = 5; x = n++; y = -x; $5,-4$ $6,-5$ $6,-6$ $5,-5$
What will be the value of $x$ and $y$ after execution of the following statement(C language) n = 5; x = n++; y = -x;$5,-4$$6,-5$$6,-6$$5,-5$
admin
1.3k
views
admin
asked
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register