Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged nielit2016mar-scientistb
8
votes
10
answers
1
NIELIT 2016 MAR Scientist B - Section C: 1
Which of the following logic expression is incorrect? $1\oplus0=1$ $1\oplus1\oplus0=1$ $1\oplus1\oplus1=1$ $1\oplus1=0$
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
2.3k
views
nielit2016mar-scientistb
digital-logic
boolean-algebra
3
votes
3
answers
2
NIELIT 2016 MAR Scientist B - Section C: 2
In which of the following adder circuits, the carry look ripple delay is eliminated? Half adder Full adder Parallel adder Carry-look ahead adder
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
3.9k
views
nielit2016mar-scientistb
digital-logic
combinational-circuit
adder
carry-generator
3
votes
2
answers
3
NIELIT 2016 MAR Scientist B - Section C: 3
The output of a sequential circuit depends on present inputs only past inputs only both present and past inputs present outputs only
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
1.0k
views
nielit2016mar-scientistb
digital-logic
sequential-circuit
3
votes
1
answer
4
NIELIT 2016 MAR Scientist B - Section C: 4
In a ripple counter using edge triggered $JK$ flip-flops, the pulse input is applied to the clock input of all flip-flops clock input of one flip-flop $J$ and $K$ inputs of all flip-flops $J$ and $K$ inputs of one flip flop
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
2.4k
views
nielit2016mar-scientistb
digital-logic
sequential-circuit
flip-flop
2
votes
2
answers
5
NIELIT 2016 MAR Scientist B - Section C: 5
A decimal number has $30$ digits. Approximately, how many digits would the binary representation have? $30$ $60$ $90$ $120$
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
3.9k
views
nielit2016mar-scientistb
digital-logic
number-system
2
votes
4
answers
6
NIELIT 2016 MAR Scientist B - Section C: 6
The result of the subtraction $FD_{16} - 88_{16}$ is $75_{16}$ $65_{16}$ $5E_{16}$ $10_{16}$
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
1.6k
views
nielit2016mar-scientistb
digital-logic
number-system
2
votes
2
answers
7
NIELIT 2016 MAR Scientist B - Section C: 7
How many RAM chips of size $(256K \times 1 \text{ bit})$ are required to build $1$M Byte memory? $8$ $10$ $24$ $32$
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
1.2k
views
nielit2016mar-scientistb
digital-logic
combinational-circuit
2
votes
2
answers
8
NIELIT 2016 MAR Scientist B - Section C: 8
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases. decreases. remains the same. either remains constant or decreases.
admin
asked
in
Operating System
Mar 31, 2020
by
admin
1.6k
views
nielit2016mar-scientistb
operating-system
disk
3
votes
5
answers
9
NIELIT 2016 MAR Scientist B - Section C: 9
A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor? Pointers. Arrays. Records. All of these.
admin
asked
in
CO and Architecture
Mar 31, 2020
by
admin
1.8k
views
nielit2016mar-scientistb
co-and-architecture
addressing-modes
2
votes
3
answers
10
NIELIT 2016 MAR Scientist B - Section C: 10
Disadvantage of dynamic RAM over static RAM is higher power consumption. variable speed. need to refresh the capacitor charge every once in two milliseconds. higher bit density.
admin
asked
in
Digital Logic
Mar 31, 2020
by
admin
1.3k
views
nielit2016mar-scientistb
digital-logic
combinational-circuit
3
votes
3
answers
11
NIELIT 2016 MAR Scientist B - Section C: 11
What is the correct way to round off $x$, $a$ $\text{float}$ to an $\text{int}$ value? $y=(\text{int})(x+0.5)$ $y=\text{int} (x+0.5)$ $y=(\text{int}) x+0.5$ $y=(\text{int})(\text{int})x+0.5)$
admin
asked
in
Programming in C
Mar 31, 2020
by
admin
1.8k
views
nielit2016mar-scientistb
programming-in-c
4
votes
11
answers
12
NIELIT 2016 MAR Scientist B - Section C: 12
Which of the following sorting algorithms does not have a worst case running time of $O(n^2)$? Insertion sort. Merge sort. Quick sort. Bubble sort.
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
15.5k
views
nielit2016mar-scientistb
algorithms
sorting
time-complexity
5
votes
6
answers
13
NIELIT 2016 MAR Scientist B - Section C: 13
What error would the following function give on compilation? f(int a, int b) { int a; a=20; return a; } Missing parenthesis is $\textit{return}$ statement. Function should be defined as $\text{int f(int a, int b)}$ Redeclaration of $a$. None of these.
admin
asked
in
Programming in C
Mar 31, 2020
by
admin
2.1k
views
nielit2016mar-scientistb
programming-in-c
4
votes
1
answer
14
NIELIT 2016 MAR Scientist B - Section C: 14
Prior to using a pointer variable it should be declared. initialized. both declared and initialized. none of these.
admin
asked
in
Programming in C
Mar 31, 2020
by
admin
2.0k
views
nielit2016mar-scientistb
programming-in-c
pointers
4
votes
1
answer
15
NIELIT 2016 MAR Scientist B - Section C: 15
Output of the following loop is for(putchar('c');putchar ('a');putchar('r')) putchar('t'); a syntax error. cartrt. catrat. catratratratrat...
admin
asked
in
Programming in C
Mar 31, 2020
by
admin
3.2k
views
nielit2016mar-scientistb
programming-in-c
output
2
votes
1
answer
16
NIELIT 2016 MAR Scientist B - Section C: 16
If space occupied by two strings $s_1$ and $s_2$ in 'C' are respectively $m$ and $n$, then space occupied by string obtained by concatenating $s_1$ and $s_2$ is always less than $m+n$ equal to $m+n$ greater than $m+n$ none of these
admin
asked
in
Programming in C
Mar 31, 2020
by
admin
1.1k
views
nielit2016mar-scientistb
programming-in-c
0
votes
2
answers
17
NIELIT 2016 MAR Scientist B - Section C: 17
A hash function $f$ defined as $f(\text{key})=\text{key mod }7$, with linear probing, insert the keys $37,38,72,48,98,11,56$ into a table indexed from $11$ will be stored in the location $3$ $4$ $5$ $6$
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
1.3k
views
nielit2016mar-scientistb
algorithms
hashing
2
votes
1
answer
18
NIELIT 2016 MAR Scientist B - Section C: 18
Traversing a binary tree first root and then left and right subtrees called ______ traversal. postorder. preorder. inorder. none of these.
admin
asked
in
DS
Mar 31, 2020
by
admin
1.4k
views
nielit2016mar-scientistb
data-structures
binary-tree
tree-traversal
1
vote
2
answers
19
NIELIT 2016 MAR Scientist B - Section C: 19
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is in P NP both (A) and (B) None of these
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
1.7k
views
nielit2016mar-scientistb
theory-of-computation
p-np-npc-nph
2
votes
3
answers
20
NIELIT 2016 MAR Scientist B - Section C: 20
A hash table has space for $100$ records. Then the probability of collision before the table is $10\%$ full, is $0.45$ $0.5$ $0.3$ $0.34$ (approximately)
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
1.3k
views
nielit2016mar-scientistb
algorithms
hashing
3
votes
1
answer
21
NIELIT 2016 MAR Scientist B - Section C: 21
A polynomial $p(x)$ is such that $p(0)=5, \: p(1)=4, \: p(2)=9$ and $p(3)=20$. The minimum degree it can have is $1$ $2$ $3$ $4$
admin
asked
in
Set Theory & Algebra
Mar 31, 2020
by
admin
771
views
nielit2016mar-scientistb
engineering-mathematics
functions
polynomials
1
vote
2
answers
22
NIELIT 2016 MAR Scientist B - Section C: 22
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by $\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \end{array}$ The order of this algorithm is $\log n$ $n$ $n^2$ $n^n$
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
1.4k
views
nielit2016mar-scientistb
algorithms
recurrence-relation
time-complexity
2
votes
1
answer
23
NIELIT 2016 MAR Scientist B - Section C: 23
If $S$ be an infinite set and $S_1\dots\dots ,S_n$ be sets such that $S_1 \cup S_2 \cup \dots \cup S_n =S$, then at least one of the set $S_i$ is a finite set. not more than one of the sets $S_i$ can be finite. at least one of the sets $S_i$ is an infinite set. not more than one of the sets $S_i$ can be infinite.
admin
asked
in
Set Theory & Algebra
Mar 31, 2020
by
admin
520
views
nielit2016mar-scientistb
discrete-mathematics
set-theory&algebra
set-theory
2
votes
2
answers
24
NIELIT 2016 MAR Scientist B - Section C: 24
Which of the following regular expressions denotes a language comprising all possible strings over the alphabet $\{a,b\}$? $a^*b^*$ $(a\mid b)^*$ $(ab)^+$ $(a\mid b^*)$
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
1.9k
views
nielit2016mar-scientistb
theory-of-computation
regular-expression
1
vote
2
answers
25
NIELIT 2016 MAR Scientist B - Section C: 25
Regarding power of recognition of language, which of the following statements is false? Non deterministic finite-state automata are equivalent to deterministic finite-state automata. Non-deterministic push-down automata are equivalent to ... to deterministic push-down automata. Multi-tape Turing Machines are equivalent to Single-tape Turing Machines.
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
1.3k
views
nielit2016mar-scientistb
theory-of-computation
identify-class-language
2
votes
4
answers
26
NIELIT 2016 MAR Scientist B - Section C: 26
If $L_1$ and $L_2$ are context free language and $R$ a regular set, then which one of the languages below is not necessarily a context free language? $L_1L_2$ $L_1\cap L_2$ $L_1\cap R$ $L_1\cup L_2$
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
900
views
nielit2016mar-scientistb
theory-of-computation
context-free-language
4
votes
4
answers
27
NIELIT 2016 MAR Scientist B - Section C: 27
If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ where $v\in L\}$, is a regular language. context-free language. context-sensitive language. recursive enumeration language
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
846
views
nielit2016mar-scientistb
theory-of-computation
regular-language
1
vote
4
answers
28
NIELIT 2016 MAR Scientist B - Section C: 28
Which of the following statements is correct? $A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular language Set $B$ of all strings of equal number of $a$'s and $b$'s defines a regular language $L(A^*B^*) \cap B$ gives the set $A$ None of these.
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
766
views
nielit2016mar-scientistb
theory-of-computation
regular-language
0
votes
1
answer
29
NIELIT 2016 MAR Scientist B - Section C: 29
The CFG $S \to aS\mid bS\mid a\mid b$ is equivalent to $(a+b)$ $(a+b)(a+b)^*$ $(a+b)(a+b)$ all of these
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
1.4k
views
nielit2016mar-scientistb
theory-of-computation
context-free-grammar
1
vote
1
answer
30
NIELIT 2016 MAR Scientist B - Section C: 30
Bounded minimalization is a technique for proving whether a promotive recursive function is turning computable or not proving whether a primitive recursive function is a total function or not generating primitive recursive functions generating partial recursive functions
admin
asked
in
Optimization
Mar 31, 2020
by
admin
1.1k
views
nielit2016mar-scientistb
non-gate
Page:
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged nielit2016mar-scientistb
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...