Recent questions tagged nielit2016mar-scientistc

1
The advantage of better testing in software development is in waterfall model prototyping iterative all of these
2
The file manager is responsible for naming files saving files deleting files all of these
3
Every Boyce-Codd Normal Form (BCNF) decomposition is dependency preserving not dependency preserving need be dependency preserving none of these
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$
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
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
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
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}$
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
10
11
The most powerful parser is $\text{SLR}$ $\text{LALR}$ Canonical $\text{LR}$ Operator-precedence
12
$\text{YACC}$ builds up $\text{SLR}$ parsing table Canonical $\text{LR}$ parsing table $\text{LALR}$ parsing table None of these
13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (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
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
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
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\}$
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$
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
20
Start and stop bits are used in serial communication for error detection error correction synchronization slowing down the communication
21
Repeaters function in Physical layer Data link layer Network layer Both (A) and (B)
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
23
The graph theoretic concept will be useful in software testing is Cyclomatic number Hamiltonian circuit Eulerian cycle None of these
24
In testing phase, the effort distribution is upto $10\%$ $20\%$ $40\%$ $50\%$
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))$
1 vote
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
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
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
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$