Direction: Two delivery boys Ram and Amar use their scooters to deliver pizza to different places in city Delhi. The line graph given below represents the distance travelled by them in months from January to June.
With the help of given data answer the following questions:
The distance travelled by Ram in the months of Feb and May is what percent less/more than the distance travelled by Amar in Feb and May?
Which of the following refers to ‘To fall asleep from exhaustion?
1 Crore+ students have signed up on EduRev. Have you? Download the App |
Direction: Study the information carefully to answer the questions that follow.
In Vimla public school, students can choose among three sports Cricket, Football and Hockey. Out of 1000 students, each one is required to play at least one of the three sports. 40 students play all three sports. 380 students play only Hockey, 170 students play only Cricket, 60 students play exactly two sports Hockey and cricket and 240 students play only Football.
What is the number of students who play exactly two sports?
He lost the game _________ he has improved a lot
Rs. 200 are divided among Arun, Bholu and Chetan such that Arun's share is Rs. 30 more than Bholu and Rs. 20 less than Chetan's. What is Bholu's share?
The average of 5 consecutive integers starting with 'm' is n. What is the average of 6 consecutive integers starting with (m+2)?
Ramesh sold a television for Rs 18500 at a loss of 7.5%. If he wants to earn 16% profit by selling the television then at what price he should sell the television?
A sum of money at compound rate of interest amounts to Rs. 750 in 1st year and to Rs. 1000 in 2nd year. Find the sum:
Present average age of Kanika and Shweta is ‘x’ years. Ratio of the age of Kanika one year ago to the age of Monika four year hence will be 1: 2. Present average age of Kanika, Monika and Shweta is 22 years. Find the value of ‘x’ if the present age of Kanika is 16 years
The HCF and LCM of two positive numbers are 5 and 585. If two numbers are in the ratio 9: 13, then find the sum of numbers.
From the types of sort given below choose the sort from which we get best average behavior
Consider an array consisting of the following elements in unsorted order (placed randomly), but 60 as the first element.
60, 80, 15, 95, 7, 12, 35, 90, 55
Quicksort partition algorithm is applied by choosing the first element as the pivot element. How many total number of arrangements of array integers is possible preserving the effect of first pass of partition algorithm.
The grammar which is equivalent to -
E → E+/ES+/+
S → */S*
After eliminating the left recursion is-
E' → S+E'/+E'
E' → EPSILON
S → *S'
S' → *S'/EPSILON
E' → S+E'/+E'
S → *S'
S' → *S'/EPSILON
E' → +E'/EPSILON
S → *S'
S' → *S'/EPSILON
Consider the code segment
int i, j, x, y, m, n;
n = 20;
for (i = 0, i < n; i++)
{
for (j = 0; j < n; j++)
{
if (i % 2)
{
x + = ((4*j) + 5*i);
}
}
}
m = x + y;
Which one of the following is false?
One piece of data is being sent from one host to another host through the HyperText Transfer protocol. What port number will be attached to destination port number?
A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
Consider an Ethernet network employing CSMA/CD, where Bw = 10 Mbps, length of the cable (L) is 200m and v = 2 x 108 m/sec. Calculate the maximum frame size in bytes.
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is a _________.
If F= {A →BC, CD → E, E →C, D → AEH, ABH →BD, DH → BC} then canonical cover over F is
One to many relationship between X(one side) and Y(many side) entities in an E-R diagram is converted as
In ER models, which statement is not valid?
Consider the following SQL query
SELECT studentid, studentname
FROM student
WHERE birthyear <=ALL (SELECT birth year from student)
Identify the answer returned by the above query?
A person is having 10 flowers in which 3 are of the same type A and 2 are of the same type B. He wants to make a garland out of all the flowers he is having. How many types of Garland are possible?
From the letters of the word ‘INSTITUTION’, let the number of words in which all I’s come together possible from the permutation of the letters is X and the number of words in which vowels come at even position possible from the permutation of the letters is Y, then what is X - Y?
If we run Dijkstra algorithm on vertex S to the following graph, then which of the following is shortest path distance from S to t
Consider the following elements:
5 , 12 , 3 , 15 , 4 , 6 , 10
These elements are inserted one-by-one into two separate heaps, one min-heap and another max heap. Then these two heaps are stored in two different arrays starting from index How many elements have the same index value in both the arrays _______.
Consider a relation R related to 7 entities E1,E2…..E7 respectively, each of them has 2 attributes (A,B) (C,D) (E,F) (G,H) (I,J) (K,L) (M,N) with first attribute as candidate key in all entities. All entities are related to R with one-one mapping. What is the number of candidate keys possible for R :
Consider a case in which A and B are been considered as non zero +ve integers, then find out the outcome of following Pascal program
While A < > B do
if A < B then
A : = A – B
else
B : = B – A;
Write(A);
Consider the following elements in a heap {17, 9, 6, 3, 12, 2, 15, 14, 20, 13, 21}. The minimum number of exchanges to convert it into a min heap be P. Then the minimum number of elements that can be arranged in a BST of height P is
Consider the following statement:
S1: Deletion in referencing relation causes deletion anomaly.
S2: Referential integrity constraints are specified between exactly two relations in a schema.
S3: Count(*) also counts the tuples which consist of NULL in a relation.
S4: Every relation is possible to decompose into BCNF with dependency preserving and lossless join decomposition.
Which option is correct?
55 docs|215 tests
|
55 docs|215 tests
|