Dark Mode

Recent questions tagged nielit2016mar-scientistc

0 votes

1 answer

1

NIELIT 2016 MAR Scientist C - Section C: 1
The advantage of better testing in software development is in waterfall model prototyping iterative all of these

Lakshman Patel RJIT asked in IS&Software Engineering Apr 2, 2020

by Lakshman Patel RJIT

1.1k views

1 vote

6 answers

2

NIELIT 2016 MAR Scientist C - Section C: 2
The file manager is responsible for naming files saving files deleting files all of these

Lakshman Patel RJIT asked in Operating System Apr 2, 2020

by Lakshman Patel RJIT

1.3k views

2 votes

4 answers

3

NIELIT 2016 MAR Scientist C - Section C: 3
Every Boyce-Codd Normal Form (BCNF) decomposition is dependency preserving not dependency preserving need be dependency preserving none of these

Lakshman Patel RJIT asked in Databases Apr 2, 2020

by Lakshman Patel RJIT

1.6k views

2 votes

2 answers

4

NIELIT 2016 MAR Scientist C - Section C: 4
A functional dependency of the form $x\to y$ is trivial if $y\subseteq x$ $y\subset x$ $x\subseteq y$ $x\subset y\:\text{and}\:y\subset x$

Lakshman Patel RJIT asked in Databases Apr 2, 2020

by Lakshman Patel RJIT

4.2k views

1 vote

5 answers

5

NIELIT 2016 MAR Scientist C - Section C: 5
A primary key, if combined with a foreign key creates parent child relationship between the tables that connect them many-to-many relationship between the tables that connect them network model between the tables that connect them none of these

Lakshman Patel RJIT asked in Databases Apr 2, 2020

by Lakshman Patel RJIT

780 views

0 votes

2 answers

6

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

Lakshman Patel RJIT asked in Computer Graphics Apr 2, 2020

by Lakshman Patel RJIT

448 views

4 votes

4 answers

7

NIELIT 2016 MAR Scientist C - Section C: 7
In real-time operating systems, which of the following is the most suitable scheduling scheme? round-robin first-come-first-served preemptive random scheduling

Lakshman Patel RJIT asked in Operating System Apr 2, 2020

by Lakshman Patel RJIT

885 views

3 votes

2 answers

8

NIELIT 2016 MAR Scientist C - Section C: 8
If there are $32$ segments, each of size $1$ K byte, then the logical address should have $13 \text{ bits}$ $14 \text{ bits}$ $15 \text{ bits}$ $16 \text{ bits}$

Lakshman Patel RJIT asked in Operating System Apr 2, 2020

by Lakshman Patel RJIT

1.1k views

0 votes

1 answer

9

NIELIT 2016 MAR Scientist C - Section C: 9
Which of the following can be accessed by transfer vector approach of linking? External data segments External subroutines Data located in other procedure All of these

Lakshman Patel RJIT asked in Compiler Design Apr 2, 2020

by Lakshman Patel RJIT

556 views

0 votes

1 answer

10

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

Lakshman Patel RJIT asked in Compiler Design Apr 2, 2020

by Lakshman Patel RJIT

514 views

0 votes

1 answer

11

NIELIT 2016 MAR Scientist C - Section C: 11
The most powerful parser is $\text{SLR}$ $\text{LALR}$ Canonical $\text{LR}$ Operator-precedence

Lakshman Patel RJIT asked in Compiler Design Apr 2, 2020

by Lakshman Patel RJIT

1.2k views

0 votes

1 answer

12

NIELIT 2016 MAR Scientist C - Section C: 12
$\text{YACC}$ builds up $\text{SLR}$ parsing table Canonical $\text{LR}$ parsing table $\text{LALR}$ parsing table None of these

Lakshman Patel RJIT asked in Compiler Design Apr 2, 2020

by Lakshman Patel RJIT

792 views

0 votes

6 answers

13

NIELIT 2016 MAR Scientist C - Section C: 13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)

Lakshman Patel RJIT asked in Compiler Design Apr 2, 2020

by Lakshman Patel RJIT

4.5k views

1 vote

1 answer

14

NIELIT 2016 MAR Scientist C - Section C: 14
If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called decidable undecidable interpretive non-deterministic

Lakshman Patel RJIT asked in Theory of Computation Apr 2, 2020

by Lakshman Patel RJIT

1.1k views

0 votes

1 answer

15

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

Lakshman Patel RJIT asked in Theory of Computation Apr 2, 2020

by Lakshman Patel RJIT

409 views

1 vote

1 answer

16

NIELIT 2016 MAR Scientist C - Section C: 16
If $f:\{a,b\}^{\ast}\rightarrow \{a,b\}^{\ast }$ be given by $f(n)=ax$ for every value of $n\in \{a,b\}$, then $f$ is one to one not onto one to one and onto not one to one and not onto not one to one and onto

Lakshman Patel RJIT asked in Set Theory & Algebra Apr 2, 2020

by Lakshman Patel RJIT

424 views

1 vote

3 answers

17

NIELIT 2016 MAR Scientist C - Section C: 17
Regular expression $(a \mid b)(a \mid b)$ denotes the set $\{a,b,ab,aa\}$ $\{a,b,ba,bb\}$ $\{a,b\}$ $\{aa,ab,ba,bb\}$

Lakshman Patel RJIT asked in Theory of Computation Apr 2, 2020

by Lakshman Patel RJIT

512 views

1 vote

3 answers

18

NIELIT 2016 MAR Scientist C - Section C: 18
Two alternative package $A$ and $B$ are available for processing a database having $10^{k}$ records. Package $A$ requires $0.0001 n^{2}$ time units and package $B$ requires $10n\log _{10}n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$

Lakshman Patel RJIT asked in Algorithms Apr 2, 2020

by Lakshman Patel RJIT

467 views

0 votes

4 answers

19

NIELIT 2016 MAR Scientist C - Section C: 19
When a subroutine is called, then address of the instruction following the CAL instruction is stored in/on the Stack pointer Accumulator Program counter Stack

Lakshman Patel RJIT asked in CO and Architecture Apr 2, 2020

by Lakshman Patel RJIT

809 views

0 votes

1 answer

20

NIELIT 2016 MAR Scientist C - Section C: 20
Start and stop bits are used in serial communication for error detection error correction synchronization slowing down the communication

Lakshman Patel RJIT asked in Computer Networks Apr 2, 2020

by Lakshman Patel RJIT

366 views

0 votes

2 answers

21

NIELIT 2016 MAR Scientist C - Section C: 21
Repeaters function in Physical layer Data link layer Network layer Both (A) and (B)

Lakshman Patel RJIT asked in Computer Networks Apr 2, 2020

by Lakshman Patel RJIT

405 views

0 votes

1 answer

22

NIELIT 2016 MAR Scientist C - Section C: 22
What are the primary characteristics that distinguish a cell from a packet? cells are generally smaller that packets cells do not incorporate physical address all cells have the same fixed length packet cannot be switched

Lakshman Patel RJIT asked in Computer Networks Apr 2, 2020

by Lakshman Patel RJIT

283 views

0 votes

2 answers

23

NIELIT 2016 MAR Scientist C - Section C: 23
The graph theoretic concept will be useful in software testing is Cyclomatic number Hamiltonian circuit Eulerian cycle None of these

Lakshman Patel RJIT asked in IS&Software Engineering Apr 2, 2020

by Lakshman Patel RJIT

1.0k views

0 votes

1 answer

24

NIELIT 2016 MAR Scientist C - Section C: 24
In testing phase, the effort distribution is upto $10\%$ $20\%$ $40\%$ $50\%$

Lakshman Patel RJIT asked in IS&Software Engineering Apr 2, 2020

by Lakshman Patel RJIT

266 views

1 vote

2 answers

25

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))$

Lakshman Patel RJIT asked in Mathematical Logic Apr 2, 2020

by Lakshman Patel RJIT

451 views

1 vote

2 answers

26

NIELIT 2016 MAR Scientist C - Section C: 26
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms

Lakshman Patel RJIT asked in Operating System Apr 2, 2020

by Lakshman Patel RJIT

588 views

0 votes

1 answer

27

NIELIT 2016 MAR Scientist C - Section C: 27
The process of entering data into a storage location causes variation in its address number adds to the contents of the location is called a readout operation is destructive of previous contents

Lakshman Patel RJIT asked in CO and Architecture Apr 2, 2020

by Lakshman Patel RJIT

422 views

0 votes

1 answer

28

NIELIT 2016 MAR Scientist C - Section C: 28
Serial access memories are useful in applications where data consists of numbers short access time is required each stored word is processed differently data naturally needs to flow in and out in serial form

Lakshman Patel RJIT asked in CO and Architecture Apr 2, 2020

by Lakshman Patel RJIT

283 views

3 votes

1 answer

29

NIELIT 2016 MAR Scientist C - Section C: 29
An external variable is globally accessible by all functions has a declaration “extern” associated with it when declared within a function will be initialized to $0$ if not initialized all of these

Lakshman Patel RJIT asked in Programming Apr 2, 2020

by Lakshman Patel RJIT

1.0k views

1 vote

2 answers

30

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$

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

699 views

Page:

1
2
3
next »

Recent questions tagged nielit2016mar-scientistc