1 Crore+ students have signed up on EduRev. Have you? Download the App 
Choose the most approximate word from the options given below to complete the following sentence.If I had known that you were coming, I _______ you at the airport
Choose the most approximate word from the options given below to complete the following sentence.
I believe in the _____ of positive thinking thus always recommend these books to my clients.
Consider a circle of radius r. Fit the largest possible square inside it and the largest possible circle inside the square. What is the radius of the innermost circle?
A bird files along the three sides of a field in the shape of an equilateral triangle at speeds of 3, 6, 8 km/hr respectively. The average speed of the bird is
Choose the most appropriate words from the options given below to fill in the blanks.
She was ______ to travel abroad and _____ in the field of commerce as per her wishes.
In a 1600 m race around a circular track of length 400 m, the faster runner and the slowest runner meet at the end of the sixth minute, for the first time after the start of the race. All the runners maintain uniform speed throughout the race. If the faster runner runs at twice the speed of the slowest runner. Find the time taken by the faster runner to finish the race.
Select the pair that best expresses a relationship similar to that expressed in the pair:
Horse: Foal
Read the following passage and find out the inference stated through passage.
Juvenile delinquency is also termed as Teenage Crime. Basically, juvenile delinquency refers to the crimes committed by minors. These crimes are committed by teenagers without any prior knowledge of how it affects the society. These kind of crimes are committed when children do not know much about outside world.
Which of the following Inferences is correct with respect to above passage?
If n and y are positive integers and 450 y = n³, which of the following must be an integer?
The graph shows cumulative frequency % of research scholars and the number of papers published by them. Which of the following statements is true?
Consider the following system of equations in three real variables x, y, z.
2x – 3y + 7z = 5
3x + y – 3z = 13
2x + 19y – 47z = 32
The system of equation has
One of the addresses in a block is 135.16.27.116/20, the third octet (in decimal) of the first IP address in the block is _______.
What is the output of the following C code:
int main( )
{
int p=8,q=3,r=0;
int x,y,z;
x = p && q && r ;
y = p  q && r ;
z = p && q  r ;
printf ( "%d", x+y+z ) ;
return 0;
}
Consider two relational schemas:
emp(ID, name, address, phone number, deptID)
department(ID, managerID, deptname, location)
What does the following relational expression perform?
Let q, r, and s represent “You can ride the roller coaster,” “You are under 4 feet tall,” and “You are older than 16 years old,” respectively. What is the logical expression for “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old"
A continuous random variable, X is distributed in interval 0 – 10. The probability, P(x = 2) is ______
In a compiler, a lexical analyzer
Let L be the set of all strings generated by the regular automata over input alphabet {x,y}. The minimum number of states in a minimal DFA that accepts all the strings of length not more than 250 is ________.
A process executes the following code.
void main()
{
if(fork()==0)
{
for(int i = 0; i<5; i++)
{
printf(“Hello”);
}
}
else
for(int j = 0; j<5; j++)
{
printf(“Hello”);
}}
Find the number of times ‘Hello’ will be printed.
Bob wants people to know his public key but at the same time, he wants no one to accept a forged key as his. He decides to create a public key certificate. He goes to Certificate Authority(CA) where CA asks for Bob’s ______ key and signs the certificate with his _______ key.
Consider the following functions:
f_{1}(a, b, c) = Ʃm(0, 1, 3, 5) + d(2, 4)
f_{2}(a, b, c) = Ʃm(1, 6) + d(2, 3, 5)
How many functions are possible for f1 + f2?
Consider the statement
do
{
i = i + 1;
}
While(a[i] < b);
The minimum number of variables required in three address code of the above statement is _____.
Which of the following are one of the maximal and minimal elements respectively of the poset ({2, 4, 5, 10, 12, 20, 25}, /)
The post order traversal of a binary search tree is given by 25, 30, 20, 45, 60, 50, 40, 35. The pre order traversal of this tree will be given by:
Consider the following weighted graph. BellmanFord algorithm is implemented on the given graph with source P. The shortest distance from source P to vertex T is ______.
In a TCP connection, the client closes the connection using threeway handshaking. The client TCP sends the last segment an ack segment with an acknowledgment no. 2164. What is the value of sequence number in FIN + ACK segment sent by server TCP? Assume that there is no data transfer between client and server TCP.
Consider the following languages:
I. {a^{m}b^{n } m = 3n + 1, where m,n >=0}
II. {a^{p}  p is a prime number}
III. {a^{i}b^{j}  i ≠ 5j, where i,j>=0}
IV. {w  w Є {a,b}, n_{a}(w) = n_{b}(w) + 1}
Which of the above languages are context free?
Consider a FATbased file system which is stored on a disk of 900 GB. The data block size is 45000 bytes. The total overhead in each entry is 6 bytes in size. The maximum size of a file that can be stored on this disk is ______ MB
The chromatic number of a planar graph is not greater than ________
Consider the following grammar:
S→Pp
P→QR
Q→qε
R→rε
Find the value of first(P) and follow(Q)?
Consider the following C program:
#include <stdio.h>
void fun(int *p)
{
int i,j;
for(i = 0;i < 4; i++)
{
for(j=0;j<3;j++)
{
printf("%d\t", p[i]);
}
}
}
int main()
{
int a[5] = {1, 5, 3};
int *p = a;
fun(p);
return 0;
}
What will be the output of the above program?
What is the space complexity of insertion sort?
Consider direct mapping implementation of a cache of size 16 MB. The main memory has a capacity of 1 GB. Let the number of tag bits required is 'x' and the comparator latency is 20x ns. What is the hit latency?
Which of the following statements is false?
In which of the following, framing bits are used?
Th eigen vector of the matrix are written in the form .[1x]and[1y]. What is value of x + y?
A finite automata over the input alphabet {x,y} is given below. What does the following deterministic finite automata perform?
In RSA cryptosystem, Bob wants to encrypt a message “RDX” using the values of 1 to 26 for letters A to Z. He uses p = 11, q = 19 and d = 103 to generate his public and private keys. What will be the cipher text generated by applying RSA algorithm (Encrypt each character individually)?
A company has three machines A, B and C. The machines produce 20%, 45% and 65% of identical goods respectively. Out of them the defective pieces produced by each machine are 0.01, 0.03, 0.15. What is the probability that a defective piece is selected and it is produced by machine ‘C’.
A BFS algorithm is implemented on the following graph. Which of the following nodes will be traversed at last if the root is ‘E’ and consider lexicographic ordering while traversing?
What is the number of comparators required in an associative mapping implementation of cache where the size of main memory and the size of cache are 256 KB and 32 KB respectively? The block size if 512 bytes.
Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?
Construct the parsing table for the following LL1 grammar:
In binary search tree, what happens to inorder successor when we delete a node that has both left and right child as nonempty?
Consider an instruction pipeline in which a total of 5 cycles is required to complete the execution of the first instruction out of ‘n’ instructions. The speed up factor for the instruction execution without the pipeline compared to instruction pipeline is 3.75. Find the time (in nanoseconds) required to execute ‘n’ instructions without pipeline if maximum stage delay is 300 picoseconds.
Compute effective access time in seconds for a demandpaged memory. The memory access time is 180 ns and the average latency, seek time, transfer time is of 3 ms, 4ms, 1ms respectively. Assume the probability of page fault is 0.4.
Consider the following schedules:
Which of the above schedules are cascadeless schedules?
Which of the following scheduling algorithms majorly suffer from starvation?
Consider the grammar G =({A, B}, {x,y}, P, A}, where P is given by:
A → xA/yB/y
B → xB/yB/x/y
What is the language generated by the given grammar?
The least number of temporary variables required to create a threeaddress code in static single assignment form for the expression p+q*rs/(q*r)
Which of the following statements is false?
Consider the following memory values and a single address machine with an accumulator.
Which of the following instructions will load 408 into accumulator?
I. LOAD DIRECT 362
II. LOAD INDIRECT 354
III. LOAD INDIRECT 350
Which of the following is equivalent to the expression xy+x′z+yz ?
Consider the recurrence relation:
T(n) = 16T(n/4)+n!
Above recurrence relation represents the running time of an algorithm. Which of the following represents the time complexity of the algorithm?
What should be substituted in the place of (A) to find the maximum element out of the two elements?
int main ()
{
int a = 100, b = 200;
int *p = &a;
int *q = &b;
(A)
return 0;
}
Consider the grammar with the following translation rules and X as the start symbol.
X > X_{1}* Y {X.value = X_{1}.value * Y.value}
X > Y {X.value = Y.value}
Y > Y_{1} Z {Y.value = Y_{1}.value  Z.value}
Y > Z {Y.value = Z.value}
Z > digit {Z.value = digit.value}
What is the value for the root of the parse tree for the expression: 54 – 5 * 1 * 7 – 4?
The following C function inserts a new element after a specific element in a doubly linked list.
struct Node {
int data;
struct Node* next;
struct Node* prev;
};
void insertAfter(struct Node* previous, int value)
{
struct Node* element = (struct Node*)malloc(sizeof(struct Node));
element>data = value;
element>next = previous>next;
previous>next = element;
element>prev = previous;
if (element>next != NULL)
__________
}
Choose the correct alternative to replace the blank line.
In the question below, a Turing machine M over {0,1} is given. Which of the following statements is true about M?
Find the time complexity of the following C code if n > m.
int foo(int m, int n)
{
if(m>n)
swap(n,m);
if(n%m == 0)
return m;
else
return foo(m, n%m);
}
Consider the following C program:
#include
int fun(char *s, char *t)
{
for(; *s == *t; s++, t++)
if(*s == '\0')
return 0;
return *s  *t;
}
int main()
{
char a[10]="Hello";
char b[10]="Help";
char *p = a;
char *q = b;
int x=fun(p,q);
printf("%d", x);
return 0;
}
What will be the output of the program?
A sender uses a StopandWait protocol for transmission of 8000 kbits size frames on a 1Gbps satellite channel with a propagation delay of 400 ms. What will be the link utilization(%) if a probability of single frame error is 0.001?
Consider a system with three resource types and the vector Available initialized to (5,3,2). If process P0 asks for (2,1,1), it gets them. If P1 asks for (2, 2,1), it gets them. Then, if P0 asks for (0,0,1), it is blocked (resource not available). If P2 now asks for (2,0,0), it gets the available one (1,0,0) and one that was allocated to P0 (since P0 is blocked). P0’s Allocation vector goes down to (1,1,1), and its Need vector goes up to (1,0,1). Which of the following statements is TRUE about the given system?
A counting semaphore was initialized to 17. Then 8P (wait) operations and ‘n’V (signal) operations were completed on this semaphore. Find the value of n if total 14 down operations can be carried out successfully after 8 wait operation and n signal operations?
55 docs215 tests

Practice Test: Computer Science Engineering (CSE)  6 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  7 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  8 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  9 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  10 Test  65 ques 
55 docs215 tests

Practice Test: Computer Science Engineering (CSE)  6 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  7 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  8 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  9 Test  65 ques 
Practice Test: Computer Science Engineering (CSE)  10 Test  65 ques 