search
Log In

Recent questions tagged nielit2016dec-scientistb-it

0 votes
1 answer
1
0 votes
3 answers
2
0 votes
1 answer
5
Two alternative packages $A$ and $B$ are available for processing a database having $10k$ records. Package $A$ requires $0.0001n2$ time units and package $B$ requires $10 n \log 10n$ 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$
asked Mar 31, 2020 in Computer Networks Lakshman Patel RJIT 250 views
0 votes
1 answer
6
0 votes
1 answer
7
What is the type of the algorithm used in solving the $4$ Queens problem? Greedy Branch and Bound Dynamic Backtracking
asked Mar 31, 2020 in Algorithms Lakshman Patel RJIT 292 views
0 votes
3 answers
8
0 votes
1 answer
9
0 votes
1 answer
10
The maximum combined length of the command-line arguments including the spaces between adjacent arguments is: $128$ characters $256$ characters $67$ characters It may very from one Operating System to another
asked Mar 31, 2020 in Programming Lakshman Patel RJIT 194 views
2 votes
2 answers
11
What is the meaning of following declaration? int(*p[7])(); $p$ is pointer to function $p$ is pointer to such function which return type is array $p$ is array of pointer to function $p$ is pointer to array of function
asked Mar 31, 2020 in Programming Lakshman Patel RJIT 273 views
1 vote
2 answers
12
2 votes
1 answer
13
0 votes
1 answer
14
Normalization from which is based on transitive dependency is classified as: First normal form. Second normal form. Fourth normal form. Third normal form.
asked Mar 31, 2020 in Databases Lakshman Patel RJIT 213 views
1 vote
4 answers
15
A ________ is a linear list in which insertions and deletions are made to from either end of the structure. Circular queue. Priority queue. Stack. Dequeue.
asked Mar 31, 2020 in DS Lakshman Patel RJIT 392 views
0 votes
1 answer
16
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is: $T(n)=2T(n-2)+2$ $T(n)=2T(n/2)+1$ $T(n)=2T(n-1)+n$ $T(n)=2T(n-1)+1$
asked Mar 31, 2020 in DS Lakshman Patel RJIT 394 views
0 votes
2 answers
17
0 votes
1 answer
18
0 votes
1 answer
20
0 votes
1 answer
21
Consider the set $S=\{1,\omega,\omega ^2​\}$, where $\omega$ and $\omega^2​$ are cube roots of unity. If $*$ denotes the multiplication operation, the structure $(S,*)$ forms: A group A ring An integral domain A field
asked Mar 31, 2020 in Set Theory & Algebra Lakshman Patel RJIT 143 views
0 votes
1 answer
22
1 vote
1 answer
25
3 votes
2 answers
27
Complexity of Kruskal's algorithm for finding minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is: $O(mn)$ $O(m)$ $O(m+n)$ $O(n)$
asked Mar 31, 2020 in Algorithms Lakshman Patel RJIT 406 views
0 votes
2 answers
29
1 vote
1 answer
30
...