# Recent activity by Abhisek Tiwari 4

1
An array is said to be random if for every index i such that 1<=i<=n-2 (array start with 0) every 2nd element from start is greater than from its left and right adjacent elements.if input is almost sorted what is time complexity to get random Array. A.O(n) B.O(logn) C.O(nlogn) D.O(n2) What is mean by “Almost sorted“ what is its significance here.
2
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$? $O(\text{lg } n)$ $O(n)$ $O(n\text { lg }n)$ $O(n^2)$
3
In relational databases, if relation R is in BCNF, then which of the following is true about relation R? R is in 4NF R is not in 1NF R is in 2NF and not in 3NF R is in 2NF and 3NF
4
The ability to inject packets into the Internet with a false source address is known as Man-in-the-middle attack IP phishing IP sniffing IP spoofing
5
What percentage $(\%)$ of the IPv4, IP address space do all class C addresses consume? $12.5 \%$ $25 \%$ $37.5 \%$ $50 \%$
6
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by page size physical size of memory the instruction set architecture number of processes in memory
7
What is the name of the protocol that allows a client to send a broadcast message with its MAC address and receive an IP address in reply? ARP DNS RARP ICMP
8
Which of the following is application of depth-first search? Only topological sort Only strongly connected components Both topological sort and strongly connected components Neither topological sort nor strongly connected components
9
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is $O(n \text{lg}n)$. Like $P$, but unlike $Q$, heapsort sorts in place where $(P,Q)$ is equal to Merge sort, Quick sort Quick sort, insertion sort Insertion sort, Quick sort Insertion sort, Merge sort
10
A processor can support a maximum memory of $4$ GB where memory is word addressable and a word is $2$ bytes. What will be the size of the address bus of the processor? At least $28$ bits At least $2$ bytes At least $31$ bits Minimum $4$ bytes
11
A computer has six tape drives with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $5$ $4$ $3$ $6$
12
At a particular time of computation, the value of a counting semaphore is $7$. Then $20 \ P$ (wait) operations and $15 \ V$ (signal) operations are completed on this semaphore. What is the resulting value of the semaphore? $28$ $12$ $2$ $42$
13
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in the following sequences: $4, 34, 10, 7, 19, 73, 2, 15, 6, 20$ Assuming that the head is currently at cylinder $50$, what is the time taken to satisfy all requests if it takes $1$ ms to move from the cylinder to adjacent one and the shortest seek time first policy is used? $357$ ms $238$ ms $276$ ms $119$ ms
14
Consider that a process has been allocated $3$ frames and has a sequence of page referencing as $1, 2, 1, 3, 7, 4, 5, 6, 3, 1$. What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string? $2$ $0$ $1$ $3$
15
Match List-I with List-II: ... from those given below: a-i; b-ii; c-iii; d-iv a-iii; b-i; c-iv; d-ii a-ii; b-i; c-iv; d-iii a-ii; b-iv; c-iii; d-i
16
Which of the following statements are DML statements? Update [tablename] Set [columnname]=VALUE Delete [tablename] Select * from [tablename] a and b a and d a, b and c b and c
17
In relational database management, which of the following is/are property/properties of candidate key? P: Uniqueness Q: Irreducibility P only Q only Both P and Q Neither P nor Q
18
With respect to relational algebra, which of the following operations are included from mathematical set theory? Join Intersection Cartisian product Project a and d b and c c and d b and d
19
Which of the following has same expressive power with regard to relational query language? Rational algebra and domain relational calculus Relational algebra and tuples relational calculus Relational algebra and domain relational calculus restricted to safe expression Relational algebra and tuples relational calculus restricted to safe expression a and b only c and d only a and c only b and d only
20
Which type of addressing mode, less number of memory references are required? Immediate Implied Register Indexed
21
Consider the set of integers $\{1,2,3,\ldots,5000\}.$ The number of integers that is divisible by neither $3$ nor $4$ is $:$ $1668$ $2084$ $2500$ $2916$
22
23
24