Two cars start at the same time from the same location and go in the same direction. The speed of the first car is 50 km/h and the speed of the second car is 60 km/h. The number of hours it takes for the distance between the two cars to be 20 km is _________.
2. The expenditure on the project _______ as follows: equipment Rs.20 lakhs, salaries Rs.12 lakhs, and contingency Rs.3 lakhs.
1 Crore+ students have signed up on EduRev. Have you? Download the App |
Ten friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs 150 more. The cost of the gift was Rs __________.
A court is to a judge as ________ is to a teacher.
The search engine‟s business model ________ around the fulcrum of trust.
Three of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.
Request X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to
smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.
The police arrested four criminals –P, Q, R and S. The criminals knew each other. They made the following statements:
P says “Q committed the crime.”
Q says “S committed the crime.”
R says “I did not do it.”
S says “What Q said about me is false.”
Assume only one of the arrested four committed the crime and only one of the statement made above is true. Who committed the crime?
“A recent High Court Judgment has sought to dispel the ideal of begging as a disease which leads to its stigmatization and criminalization – and to regard it as a symptom. The underlying disease is the failure of the state to protect citizens who fall through the social security net.”
Which one of the following statements can be inferred from the given passage?
In a college, there are three student clubs, Sixty students are only in the Drama club, 80 students are only in the Dance club, 30 students are only in the Maths club, 40 students are in both Drama and Dance clubs, 12 students are in both Dance and Maths clubs, 7 students are in both Drama and Maths clubs, and 2 students are in all the clubs. If 75% of the students in the college are not in any of these clubs, then the total number of students in the college is ________.
In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentage of administrators shall be in the rage of ___________.
Which one of the following kinds of derivation is used by LR parsers?
Consider the following C program:
#include <stdio.h>
int main(){
int arr[ ]={1,2,3,4,5,6,7,8,9,0,1,2,5}, *ip=arr+4;
printf("%d \n", ip[1]);
return 0;
}
The number that will be displayed on execution of the program is _________.
For ∑ = {a,b} , let us consider the regular language L = {x | x a2+3k or x = b10+12k, k ≥ 0}.
Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?
Let U = {1, 2, …, n}. Let A = {( x, X ) | x ∈ X, X ⊂ U}. Consider the following two statements on |A|.
Which of the above statements is/are TRUE?
A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
Consider the grammar given below:
S → Aa
A → BD
B → b | ∈
D → d | ∈
Let a, b, d, and $ be indexed as follows:
Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b. d, $}, then the Key should be 3210)
Let X be a square matrix. Consider the following two statements on X.
I. X is invertible
II. Determine of X is non-zero.
Which one of the following is TRUE?
The chip select logic for a certain DRAM chip in a memory- system design is shown below Assume that the memory system has 16 address lines denoted by A15 to A0. What is the range of addresses (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?
Consider a sequence of 14 elements: A = {-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum Determine the maximum of S (i, j ) , where 0 ≤ i ≤ j < 14 . (Divide and conquer approach may be used.)
An array of 25 distinct elements is to be sorted using quick sort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places) is
Consider the concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialization to 100.
The processes are executed on a uniprocessor system running a time-shared operating system. If the minimum and maximum possible values of D after the three processes have completed execution are X and Y respectively, then the value of Y–X is _________.
Consider the following C program:
#include <stdio.h>
int jumble(int x, int y){
x=2*x+y;
return x; }
int main(){
int x=2, y=5;
y= jumble(y,x);
x= jumble(y,x);
printf("%d \n", x);
return 0;
}
The value printed by the program is _________
Let G be an arbitrary group. Consider the following relations on G:
Which of the above is/are equivalence relation/relations?
Consider the following two statements about database transaction schedules:
I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
II. Timestamp-ordering concurrency control protocol with Thomas‟ Write Rule can generate view serializable schedules that are not conflict serializable.
Which of the above statements is/are TRUE?
Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)?
The following C program is executed on a Unix/Linux system:
# include < unistd.h>
int main ( )
{int i; for (i = 0; i < 10; i++) if (i % 2 = = 0) fork ( ); return 0;}
The total number of child processes created is ________.
Consider Z = X – Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of: