Register
Filter

Answers by vijaycs

9 votes
81
ISRO2011-22
A system is having $8\;\text{M}$ bytes of video memory for bit-mapped graphics with $64$-bit colour. What is the maximum resolution it can support? $800 \times 600$ $1024 \times 768$ $1280 \times 1024$ $1920 \times 1440$
A system is having $8\;\text{M}$ bytes of video memory for bit-mapped graphics with $64$-bit colour. What is the maximum resolution it can support?$800 \times 600$$1024 \...
1 votes
82
General Aptitude
The surface area of the surface cut from the paraboloid $x^2+y^2+z^2=2$ by the plane $y=0$ is equal to $2 \pi$ $2 \sqrt{2 \pi}$ $7 \pi / 3$ $13 \pi /3$
The surface area of the surface cut from the paraboloid $x^2+y^2+z^2=2$ by the plane $y=0$ is equal to$2 \pi$$2 \sqrt{2 \pi}$$7 \pi / 3$$13 \pi /3$
22 votes
83
ISRO2015-73
The output of the following program is main() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); } 1 2 3 3 5 5 7 8 1 2 3 4 5 6 7 8 8 7 6 5 4 3 2 1 1 2 3 5 4 6 7 8
The output of the following program ismain() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); }1 2 3 ...
7 votes
84
ISRO2015-75
The for loop for (i=0; i<10; ++i) printf("%d", i&1); prints 0101010101 0111111111 0000000000 1111111111
The for loopfor (i=0; i<10; ++i) printf("%d", i&1);prints0101010101011111111100000000001111111111
12 votes
85
ISRO2015-71
Consider the following program fragment i=6720; j=4; while (i%j)==0 { i=i/j; j=j+1; } On termination j will have the value 4 8 9 6720
Consider the following program fragmenti=6720; j=4; while (i%j)==0 { i=i/j; j=j+1; }On termination j will have the value4896720
7 votes
86
regular or CFL
u w wR v , uvw belongs to (0+1)+ is it regular or CFL ?
u w wR v , uvw belongs to (0+1)+ is it regular or CFL ?
3 votes
87
ISRO2009-20
Consider the following boolean function of four variables $f(w,x,y,z) = \Sigma(1,3,4,6,9,11,12,14)$, the function is Independent of one variable Independent of two variables Independent of three variables Dependent on all variables
Consider the following boolean function of four variables $f(w,x,y,z) = \Sigma(1,3,4,6,9,11,12,14)$, the function isIndependent of one variableIndependent of two variable...
15 votes
88
ISRO2007-20
If the bandwidth of a signal is $5$ kHz and the lowest frequency is $52$ kHz, what is the highest frequency $5$ kHz $10$ kHz $47$ kHz $57$ kHz
If the bandwidth of a signal is $5$ kHz and the lowest frequency is $52$ kHz, what is the highest frequency$5$ kHz$10$ kHz$47$ kHz$57$ kHz
1 votes
91
sets
0 votes
92
Calculate address
Consider 3 dimensional array A[90][30][40] stored in a linear array in column major order. If the base address starts at 10, what is the location of A[20][20][30]? Assume the first element us stored at A[1][1][1].
Consider 3 dimensional array A[90][30][40] stored in a linear array in column major order. If the base address starts at 10, what is the location of A[20][20][30]? Assume...
6 votes
94
ISRO2007-07
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is $1$ $k$ $k-1$ $k/2$
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$
4 votes
95
What is the size of stack?
Consider the following infix expression which is to be converted to postfix expression using stack. (((P+Q)*(R+S))/T)+(A*(B+C))
Consider the following infix expression which is to be converted to postfix expression using stack.(((P+Q)*(R+S))/T)+(A*(B+C))
3 votes
96
How to eliminate indirect left recursion ?
J -> Lx K -> Ly L -> J | K | f Whoever Answers Please Explain Methods solving such Questions .
J - Lx K - Ly L - J | K | fWhoever Answers Please Explain Methods solving such Questions .
1 votes
97
What is the time complexity of the function?
void fun(int n, int k) { for (int i=1; i<=n; i++) { int p = pow(i, k); for (int j=1; j<=p; j++) { // Some O(1) work } } }
void fun(int n, int k) { for (int i=1; i<=n; i++) { int p = pow(i, k); for (int j=1; j<=p; j++) { // Some O(1) work } }}
7 votes
98
ISI2014-PCB-CS-4b
Consider the following statement: $\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$ Is the above statement true? Justify your answer.
Consider the following statement:$\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$Is the above statement true? Just...
0 votes
99
TOC
Given Language L1 is DCFL and L2 is DCFL ? Then (L1$\cap$L2)c will be Regular DCFL CFL CSL but not CFL
Given Language L1 is DCFL and L2 is DCFL ? Then (L1$\cap$L2)c will beRegularDCFLCFLCSL but not CFL
3 votes
100
GATE1991-15,a
<p><span style="line-height: 1.6;">Show that the product of the least common multiple and the greatest common&nbsp;</span><span style="line-height: 1.6;">divisor of two positive integers $a$ and $b$ is $a\times b$.</span></p> <p>&nbsp; &nbsp; &nbsp; &nbsp;</p>
<p><span style="line-height: 1.6;">Show that the product of the least common multiple and the greatest common&nbsp;</span><span style="line-height: 1.6;">divisor of two p...
6 votes
101
train problem
Two, trains, one from Howrah to Patna and the other from Patna to Howrah, start simultaneously. After they meet, the trains reach their destinations after 9 hours and 16 hours respectively. The ratio of their speeds is ??
Two, trains, one from Howrah to Patna and the other from Patna to Howrah, start simultaneously. After they meet, the trains reach their destinations after 9 hours and 16 ...
7 votes
103
CMI2012-B-03b
Let $A$ be an array of $n$ integers, sorted so that $A[1] \leq A[2] \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there exist indices $k$ and $l$ such that $A[k]+A[l] = x$. Design an $O(n)$ algorithm for this problem.
Let $A$ be an array of $n$ integers, sorted so that $A \leq A \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there exist indices $k$ a...
12 votes
105
UGC NET CSE | June 2012 | Part 2 | Question: 30
In round robin CPU scheduling as time quantum is increased the average turn around time increases decreases remains constant varies irregularly
In round robin CPU scheduling as time quantum is increased the average turn around timeincreasesdecreasesremains constantvaries irregularly
11 votes
109
ISRO-2013-72
How many diagonals can be drawn by joining the angular points of an octagon? $14$ $20$ $21$ $28$
How many diagonals can be drawn by joining the angular points of an octagon?$14$$20$$21$$28$
1 votes
110
isro 2008
Page: