Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by smsubham
0
votes
41
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 3
By open domain CASE tools we mean tools available in open domain software packages which can be downloaded from the internet software packages to aid each phase of the systems analysis and design which can be downloaded free of cost from the internet source codes of CASE tools
By open domain CASE tools we meantools available in open domainsoftware packages which can be downloaded from the internetsoftware packages to aid each phase of the syste...
1.3k
views
answered
Apr 2, 2020
IS&Software Engineering
nielit2017oct-assistanta-it
is&software-engineering
+
–
0
votes
42
UGC NET CSE | January 2017 | Part 3 | Question: 8
Which one is correct w.r.t. RDBMS? primary key $\subseteq$ super key $\subseteq$ candidate key primary key $\subseteq$ candidate key $\subseteq$ super key super key $\subseteq$ candidate key $\subseteq$ primary key super key $\subseteq$ primary key $\subseteq$ candidate key
Which one is correct w.r.t. RDBMS?primary key $\subseteq$ super key $\subseteq$ candidate keyprimary key $\subseteq$ candidate key $\subseteq$ super key super key $\subse...
2.8k
views
answered
Apr 1, 2020
Databases
ugcnetcse-jan2017-paper3
database-normalization
candidate-key
+
–
0
votes
43
UGC NET CSE | January 2017 | Part 3 | Question: 5
In $8085$ microprocessor, the digit $5$ indicates that the microprocessor needs $-5$ volts, $+5$ volts supply $+5$ volts supply only $-5$ volts supply only $5$ MHz clock
In $8085$ microprocessor, the digit $5$ indicates that the microprocessor needs$-5$ volts, $+5$ volts supply$+5$ volts supply only$-5$ volts supply only$5$ MHz clock
954
views
answered
Apr 1, 2020
CO and Architecture
ugcnetcse-jan2017-paper3
co-and-architecture
microprocessors
+
–
2
votes
44
NIELIT 2016 DEC Scientist B (CS) - Section B: 24
Given two DFA's $M1$ and $M2$. They are equivalent if $M1$ and $M2$ has the same number of states $M1$ and $M2$ accepts the same language i.e $L(M1)=L(M2)$ $M1$ and $M2$ has the same number of final states None of the above
Given two DFA's $M1$ and $M2$. They are equivalent if$M1$ and $M2$ has the same number of states$M1$ and $M2$ accepts the same language i.e $L(M1)=L(M2)$$M1$ and $M2$ has...
1.5k
views
answered
Apr 1, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
finite-automata
+
–
2
votes
45
NIELIT 2016 DEC Scientist B (CS) - Section B: 22
The structure or format of data is called Syntax Struct Semantic none of the above
The structure or format of data is calledSyntaxStructSemanticnone of the above
1.6k
views
answered
Apr 1, 2020
Compiler Design
nielit2016dec-scientistb-cs
compiler-design
+
–
2
votes
46
NIELIT 2016 DEC Scientist B (CS) - Section B: 20
Bluetooth is an example of: Personal area network Virtual private network Local area network None of the above
Bluetooth is an example of:Personal area networkVirtual private networkLocal area networkNone of the above
705
views
answered
Apr 1, 2020
Computer Networks
nielit2016dec-scientistb-cs
computer-networks
+
–
1
votes
47
NIELIT 2016 DEC Scientist B (CS) - Section B: 19
Communication between a computer and a keyboard involves ___________ transmission Simplex Half-Duplex Automatic Full-Duplex
Communication between a computer and a keyboard involves ___________ transmissionSimplexHalf-DuplexAutomaticFull-Duplex
975
views
answered
Apr 1, 2020
Computer Networks
nielit2016dec-scientistb-cs
computer-networks
+
–
0
votes
48
NIELIT 2016 DEC Scientist B (CS) - Section B: 18
Which of the following is not defined in a good Software Requirement Specification(SRS) document? Functional requirement Goals of implementation Nonfunctional requirement Algorithm for software implementation
Which of the following is not defined in a good Software Requirement Specification(SRS) document?Functional requirementGoals of implementationNonfunctional requirementAlg...
9.9k
views
answered
Apr 1, 2020
IS&Software Engineering
nielit2016dec-scientistb-cs
non-gate
is&software-engineering
+
–
0
votes
49
NIELIT 2016 DEC Scientist B (CS) - Section B: 16
Two main measures for the efficiency of an algorithm are: Processor and Memory Complexity and Capacity Time and Space Data and Space
Two main measures for the efficiency of an algorithm are:Processor and MemoryComplexity and CapacityTime and SpaceData and Space
84.5k
views
answered
Apr 1, 2020
Algorithms
nielit2016dec-scientistb-cs
algorithms
time-complexity
+
–
3
votes
50
NIELIT 2016 DEC Scientist B (CS) - Section B: 13
What will be output if you will compile and execute the following C code? void main() { printf("%d",sizeof(5.2)); } $4$ $8$ $2$ $16$
What will be output if you will compile and execute the following C code? void main() { printf("%d",sizeof(5.2)); }$4$$8$$2$$16$
2.6k
views
answered
Apr 1, 2020
Programming in C
nielit2016dec-scientistb-cs
programming-in-c
output
+
–
3
votes
51
NIELIT 2016 DEC Scientist B (CS) - Section B: 12
The running time of Quick sort algorithm depends heavily on the selection of: No. of inputs Arrangement of elements in an array Size of elements Pivot Element
The running time of Quick sort algorithm depends heavily on the selection of:No. of inputsArrangement of elements in an arraySize of elementsPivot Element
15.3k
views
answered
Apr 1, 2020
Algorithms
nielit2016dec-scientistb-cs
algorithms
sorting
quick-sort
+
–
0
votes
52
NIELIT 2016 DEC Scientist B (CS) - Section B: 11
A sinusoidal signal is analog signal, because: it can have a number of values between the negative and positive peaks it is negative for one half cycle it is positive for one half cycle it has positive as well as negative values
A sinusoidal signal is analog signal, because:it can have a number of values between the negative and positive peaksit is negative for one half cycleit is positive for on...
1.6k
views
answered
Apr 1, 2020
Information Theory
nielit2016dec-scientistb-cs
non-gate
+
–
0
votes
53
NIELIT 2016 DEC Scientist B (CS) - Section B: 10
The noise due to random behavior of charge carriers is: Partition noise Industrial noise Shot noise Flicker noise
The noise due to random behavior of charge carriers is:Partition noiseIndustrial noiseShot noiseFlicker noise
2.5k
views
answered
Apr 1, 2020
Information Theory
nielit2016dec-scientistb-cs
non-gate
+
–
2
votes
54
NIELIT 2016 DEC Scientist B (CS) - Section B: 9
The first Network: ARPANET. NFSNET. CNNET. ASAPNET.
The first Network:ARPANET.NFSNET.CNNET.ASAPNET.
724
views
answered
Apr 1, 2020
Computer Networks
nielit2016dec-scientistb-cs
computer-networks
+
–
1
votes
55
NIELIT 2016 DEC Scientist B (CS) - Section B: 7
The Knapsack problem belongs to which domain of problems? Optimization NP complete Linear Solution Sorting
The Knapsack problem belongs to which domain of problems?OptimizationNP completeLinear SolutionSorting
8.6k
views
answered
Apr 1, 2020
Algorithms
nielit2016dec-scientistb-cs
algorithms
knapsack-problem
algorithm-design-technique
+
–
1
votes
56
NIELIT 2016 DEC Scientist B (CS) - Section B: 6
Which of the following is wrong? Turing machine is a simple mathematical model of general purpose computer Turing machine is more powerful than finite automata Turing Machine can be simulated by a general purpose computer All of these
Which of the following is wrong?Turing machine is a simple mathematical model of general purpose computerTuring machine is more powerful than finite automataTuring Machin...
9.6k
views
answered
Apr 1, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
turing-machine
+
–
2
votes
57
NIELIT 2016 DEC Scientist B (CS) - Section B: 5
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to: $3$ $4$ $5$ $6$
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the...
1.3k
views
answered
Apr 1, 2020
Graph Theory
nielit2016dec-scientistb-cs
discrete-mathematics
graph-theory
graph-planarity
+
–
2
votes
58
NIELIT 2016 DEC Scientist B (CS) - Section B: 4
The Circuit is equivalent to: $OR$ Gate $NOR$ Gate $AND$ Gate $EX-OR$ Gate
The Circuit is equivalent to:$OR$ Gate$NOR$ Gate$AND$ Gate$EX-OR$ Gate
1.1k
views
answered
Apr 1, 2020
Digital Logic
nielit2016dec-scientistb-cs
digital-logic
combinational-circuit
+
–
2
votes
59
NIELIT 2016 DEC Scientist B (CS) - Section B: 3
If $L1$ is CFL and $L2$ is regular language which of the following is false? $L1-L2$ is not Context free $L1$ intersection $L2$ is Context free $\sim L1$ is Context free Both (A) and (C)
If $L1$ is CFL and $L2$ is regular language which of the following is false?$L1-L2$ is not Context free$L1$ intersection $L2$ is Context free$\sim L1$ is Context freeBoth...
767
views
answered
Apr 1, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
context-free-language
+
–
2
votes
60
NIELIT 2016 DEC Scientist B (CS) - Section B: 2
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as: normalization of data. denomination of data. isolation of data. de-normalization of data.
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as:normalization of data.denomination of data.isolatio...
3.9k
views
answered
Apr 1, 2020
Databases
nielit2016dec-scientistb-cs
databases
database-normalization
+
–
1
votes
61
NIELIT 2016 DEC Scientist B (CS) - Section B: 15
Which of the following need not be a binary tree? Search tree Heap AVL tree B tree
Which of the following need not be a binary tree?Search treeHeapAVL treeB tree
1.6k
views
answered
Apr 1, 2020
DS
nielit2016dec-scientistb-cs
data-structures
binary-tree
+
–
0
votes
62
UGC NET CSE | December 2007 | Part 2 | Question: 6
A $WFF$ that is equivalent to the $WFF$ $x=> y$ is : $y=>x$ ~$y=>x$ ~$y=>$ ~$x$ $y=>$ ~$x$
A $WFF$ that is equivalent to the $WFF$ $x= y$ is :$y=>x$~$y=>x$~$y=>$ ~$x$$y=>$ ~$x$
266
views
answered
Apr 1, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
63
UGC NET CSE | December 2007 | Part 2 | Question: 3
A context free grammar is : type $0$ type $1$ type $2$ type $3$
A context free grammar is :type $0$type $1$type $2$type $3$
551
views
answered
Apr 1, 2020
Theory of Computation
ugcnetcse-dec2007-paper2
+
–
2
votes
64
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 2
Which of the following is not a form of main memory? Instruction cache Instruction register Instruction opcode Translation look-aside buffer
Which of the following is not a form of main memory?Instruction cacheInstruction registerInstruction opcodeTranslation look-aside buffer
888
views
answered
Apr 1, 2020
CO and Architecture
nielit2017oct-assistanta-cs
co-and-architecture
memory-management
+
–
1
votes
65
NIELIT 2017 DEC Scientific Assistant A - Section B: 6
Which of the following statements is true ? Melay and Moore machines are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.
Which of the following statements is true ?Melay and Moore machines are language acceptors.Finite State automata is language translator.NPDA is more powerful than DPDA.Me...
1.1k
views
answered
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
dpda
npda
+
–
1
votes
66
NIELIT 2017 DEC Scientific Assistant A - Section B: 5
Concatenation Operation refers to which of the following set operations : Union Dot Kleene None of the options
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
3.7k
views
answered
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
2
votes
67
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
Complement of a $DFA$ can be obtained by : making starting state as final state. make final as a starting state. making final states non-final and non-final as final. None of the options
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
1.6k
views
answered
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
1
votes
68
NIELIT 2017 DEC Scientific Assistant A - Section B: 3
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$ $DFA$ $NFA - 1$ All of the options
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
1.7k
views
answered
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
2
votes
69
NIELIT 2017 DEC Scientific Assistant A - Section B: 2
In binary search tree which traversal is used for getting ascending order values ? Inorder Preorder Postorder None of the options
In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options
956
views
answered
Mar 31, 2020
DS
nielit2017dec-assistanta
data-structures
binary-search-tree
tree-traversal
+
–
5
votes
70
NIELIT 2017 July Scientist B (IT) - Section B: 32
Output of following program #include<stdio.h> int main() { int i=5; printf("%d %d %d", i++,i++,i++); return 0; } $7\:6\:5$ $5\:6\:7$ $7\:7\:7$ Compiler Dependent
Output of following program#include<stdio.h int main() { int i=5; printf("%d %d %d", i++,i++,i++); return 0; }$7\:6\:5$$5\:6\:7$$7\:7\:7$Compiler Dependent
1.1k
views
answered
Mar 30, 2020
Programming in C
nielit2017july-scientistb-it
programming-in-c
output
+
–
Page:
« prev
1
2
3
4
5
6
7
...
12
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register