# Recent questions in Others

1
Micro program is the name of source program in micro computers the set of instructions indicating the primitive operations in a system primitive form of macros used in assembly language programming program of very small size
2
If a processor does not have any stack pointer register, then it cannot have subroutine call instruction it can have subroutine call instruction, but no nested subroutine calls nested subroutine calls are possible, but interrupts are not all sequences of subroutine calls and also interrupts are possible
3
In a microprocessor, WAIT states are used to make the processor wait during a DMA operation make the processor wait during a power interrupt processing make the processor wait during a power shutdown interface slow peripherals to the processor
4
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$
5
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1,2,\dots,n.$ You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm for doing this? $\Theta(\log n)$ $\Theta(n)$ $\Theta(n \log n)$ None of the above, as the tree cannot be uniquely determined.
6
The most efficient algorithm for finding the number of connected components in a $n$ undirected graph on $n$ vertices and $m$ edges has time complexity $\Theta (n)$ $\Theta (m)$ $\Theta (m+n)$ $\Theta (mn)$
7
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves in linear time using a right to left pass of the array solves it using divide and conquer in time $\theta (n\log n)$ solves it in time $\theta (n^{2})$
8
In a circularly linked list organization, insertion of a record involves the modification of no pointer $1$ pointer $2$ pointers $3$ pointers
1 vote
9
To sort many large objects or structures, it would be most efficient to place them in an array and sort the array pointers to them in an array and sort the array them in a linked list and sort the linked list references to them in an array and sort the array
1 vote
10
The average search time of hashing, with linear probing will be less if the load factor is far less than one equals one is far greater than one none of these
11
In C programming language, if the first and the second operands of operator $+$ are of types int and float, respectively, the result will be of type int float char long int
12
What will be the value of $x$ and $y$ after execution of the following statement(C language) n = 5; x = n++; y = -x; $5,-4$ $6,-5$ $6,-6$ $5,-5$
13
Microprogramming is a technique for writing small programs effectively programming output/input routines programming the microprocessors programming the control steps of a computer
14
The excess $3$ code is also called cyclic redundancy code weighted code self complimenting code algebraic code
15
The range of the numbers which can be stored in an eight bit register is $-128$ to $+127$ $-128$ to $+128$ $-999999+ \: +999999$ none of these
16
How many flip-flop are needed to divide the input frequency by $64$? $4$ $5$ $6$ $8$
In propositional logic, which of the following is equivalent to $p \rightarrow q$? $\sim p\rightarrow q$ $\sim p \vee q$ $\sim p \vee \sim q$ $p\rightarrow \sim q$