QuizSagar
4 years ago Like 232906
Questions 823
Contests 7
C takes 30 days to finish a work and A is thrice as good as C and twice as good as B. If A, B and C work together, then how many days they will take to finish the work?
- 5
- 5.45
- 4.45
- 4
- option2
Clear All
From questions,
Ratio of,
A:C = 3:1
A:B = 2:1
then, Ratio of A:B:C=6:3:2
C takes 30days to do work can be written as,
efficiency of c * 30day = Total work
2 * 30 = 60 --- Total work
Time taken by A,B & C to complete work is,
Total work/efficiency of (A
Loading...
Predicate the output of following program.
#include <stdio.h>
int main(){
int x = 10,y = 15,z=0;
z= x,y;
printf("%d", z);
getchar();
return 0;}
- 10
- 15
- 1015
- Error
- option2
Clear All
The comma operator is a binary operator that evaluates its first operand and discards the result, it then evaluates the second operand and returns this value (and type).
So here x execute but discard their results then y is executed then assigned this res
Loading...
Predicate the output of following c program.
#include <stdio.h>
int main()
{
int x = 10,y = 15,z=0;
int z= x,y;
printf("%d", z);
getchar();
return 0;
}
- 10
- 15
- 1015
- EROR
- option4
Clear All
int z=x,y; is treate as int z=x; & int z=y; by compiler but y is already declared in the program so "redeclaration of 'y' with no linkage" error occurred
Loading...
Predicate the output of following program.
#include <stdio.h>
void main()
{
static int y;
{
int y=10;
}
printf("%d", y);
}
- 0
- 10
- Garbage value
- Error
- option1
Clear All
The default value of static variable is zero.
Loading...
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0
- 4 and 15 respectively
- 3 and 14 respectively
- 4 and 14 respectively
- 4 and 15 respectively
- option2
Clear All
The height of a tree is the number of edges on the longest downward path between the root and a leaf.,
Maximum height of a tree is only if a tree is complete binary tree & minimum height of tree is possible if a tree is left skewed or right skewed binary
Loading...
Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is_
- 18
- 19
- 20
- 21
- option1
Clear All
Total number Of edges(e) = Total Vertices - 1,
e=10-1=9
By handshaking lemma,
sum of degree of all vertices= twice number of edges
Therefore, sum of degree of all vertices=2*9=18
Loading...
Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are ___
- 202
- 201
- 200
- 199
- option4
Clear All
In a Binary tree, the number of leaf nodes(L) is always one more than nodes with two children(TC).
i.e., L=TC + 1
In above questions Leave Node(L)=200
Therefore,
200= TC +1
TC=200-1 = 199
Hence, number of nodes in tree will be 199
Loading...
Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is__
- 80
- 0.0125
- 8000
- 1.25
- option1
Clear All
load factor = (no. of elements) / (no. of table slots),
Therefore,
Load Factor= 2000/25 = 80
Loading...
A hash table contains 10 buckets and uses linear probing to resolve collisions. The key values are integers and the hash function used is key % 10. If the values 43, 165, 62, 123, 142 are inserted in the table, in what location would the key value 142 be
- 2
- 3
- 4
- 6
- option4
Clear All
Value 142 will be inserted at 6 location. At location 2 already 62 is persent so according to linear prob rule elements will be stored at next location(in simple). But , there is also an element 43 at location 3, at next location[2] 123 is present,and the
Loading...
The number of tokens in the following C printf("i-PERCENTAGE-TAG---d, &i=PERCENTAGE-TAG---x",i,&i); is
- 3
- 26
- 10
- 21
- option3
Clear All
In a C language program, if a basic element is recognized by a compiler is known as token. Token is also a source program text, those text won't be broke down by a compiler. Token has six types. They are identifiers, keywords, constants, operators, string
Loading...