Cloud Computing Computer Networks Theory of Computation Computer Organization and Architecture Data Structure R Notes Software Engineering DBMS Operating Systems Linux Discrete Structure Management Information Systems Network and Web Security Distributed System Web Engineering PHP Notes Advanced Computer Architecture Information Storage Management Python Programming Java Notes Compiler Design Principles of Programming Languages RGPV Solved UGC NET GATE Questions Banks C Coding

In a town of 10000 families, it was found that 40% families buy product A, 20% buy product B

                 No comments    

DAVV MBA PYQ

In a town of 10000 families, it was found that 40% families buy product A, 20% buy product B and 10% buy product C, 5% buy product A and product B, 3% buy product B and product C and 4% buy product A and product C. If 2% families buy product A, B, C all. Then find the number of the families buy product A only.

Solution:

Formula: 
n(A U B U C) = n(A)+n(B)+n(C)-n(A ∩ B)-n(A ∩ C)-n(B ∩ C)+n(A ∩ B ∩ C)

Given,
n(A U B U C) = 10000 
n(A) = 4000
n(B) = 2000
n(C) = 1000
n(A ∩ B ∩ C) = 200
n(A ∩ B) = 500
n(A ∩ C) = 400
n(B ∩ C) = 300

Number of the families buy product A only ?


From the Venn diagram,
Number of the families by product A only = 3300.

Practice questions (DAVV MBA PYQs):

Q1. In a city there are 100000 people, 64% of them speak Greek, 55% people speak Latin, 43% people speak French, 21% people speak both Greek and Latin, 31% people speak both Greek and French, and 41% people speak both Latin and French. Determine the number of people speak all the three languages.

Solution: Click Here

Q2. In a survey of 500 T.V. viewers, 285 watched KBC, 195 watch cricket, 115 watch hockey, 45 watch KBC and hockey, 70 watch KBC and cricket, 50 watch cricket and hockey, 50 do not watch any of three games. How many watch all 3 and how many watch exactly one of three ?

Solution: Click Here

Q3. In a managers club, 45 play polo, out of which 30 play Polo only 28 play Snookers. 25 play Tennis  of which 11 play Tennis only, 7 play Tennis and Polo, but not Snooker. 5 play Polo and Snooker, but not Tennis
i) How many play all the thre sports?
ii) How many play Snookers only?
iii) How many members are there is the club.

Solution: Click Here

Q4. In a town of 10000 families, it was found that 40% families buy product A, 20% buy product B and 10% buy product C, 5% buy product A and product B, 3% buy product B and product C and 4% buy product A and product C. If 2% families buy product A, B, C all. Then find the number of the families buy product A only.

Solution: Click here
Share:

In a managers club, 45 play polo, out of which 30 play Polo only

                 No comments    

DAVV MBA PYQ

In a managers club, 45 play polo, out of which 30 play Polo only 28 play Snookers. 25 play Tennis  of which 11 play Tennis only, 7 play Tennis and Polo, but not Snooker. 5 play Polo and Snooker, but not Tennis
i) How many play all the thre sports?
ii) How many play Snookers only?
iii) How many members are there is the club.

Solution:

P for Polo
S for Snookers
T for Tennis




From the Venn diagram:

i) How many play all the thre sports?
Ans. 3

ii) How many play Snookers only?
Ans. 16

iii) How many members are there is the club.
Ans. 76

Practice questions (DAVV MBA PYQs):

Q1. In a city there are 100000 people, 64% of them speak Greek, 55% people speak Latin, 43% people speak French, 21% people speak both Greek and Latin, 31% people speak both Greek and French, and 41% people speak both Latin and French. Determine the number of people speak all the three languages.

Solution: Click Here

Q2. In a survey of 500 T.V. viewers, 285 watched KBC, 195 watch cricket, 115 watch hockey, 45 watch KBC and hockey, 70 watch KBC and cricket, 50 watch cricket and hockey, 50 do not watch any of three games. How many watch all 3 and how many watch exactly one of three ?

Solution: Click Here

Q3. In a managers club, 45 play polo, out of which 30 play Polo only 28 play Snookers. 25 play Tennis  of which 11 play Tennis only, 7 play Tennis and Polo, but not Snooker. 5 play Polo and Snooker, but not Tennis
i) How many play all the thre sports?
ii) How many play Snookers only?
iii) How many members are there is the club.

Solution: Click Here

Q4. In a town of 10000 families, it was found that 40% families buy product A, 20% buy product B and 10% buy product C, 5% buy product A and product B, 3% buy product B and product C and 4% buy product A and product C. If 2% families buy product A, B, C all. Then find the number of the families buy product A only.

Solution: Click here
Share:

In a survey of 500 T.V. viewers, 285 watched KBC, 195 watch cricket, 115 watch hockey, 45 watch KBC and hockey

                 1 comment    

DAVV MBA PYQ

In a survey of 500 T.V. viewers, 285 watched KBC, 195 watch cricket, 115 watch hockey, 45 watch KBC and hockey, 70 watch KBC and cricket, 50 watch cricket and hockey, 50 do not watch any of three games. How many watch all 3 and how many watch exactly one of three ?

Solution:

K for KBC
H for Hockey
C for Cricket

Formula: 
n(K U H U C) = n(K)+n(H)+n(C)-n(K ∩ H)-n(K ∩ C)-n(H ∩ C)+n(K ∩ H ∩ C)

Given,
n(K U H U C) = 500 - 50 = 450
n(K) = 285
n(H) = 115
n(C) = 195
n(K ∩ H) = 45
n(K ∩ C) = 70
n(H ∩ C) = 50
n(K ∩ H ∩ C) = ?

How many watch all the three games ?

n(K U H U C) = n(K)+n(H)+n(C)-n(K ∩ H)-n(K ∩ C)-n(H ∩ C)+n(K ∩ H ∩ C)

450 = 285+115+195-45-70-50+n(K ∩ H ∩ C)

n(K ∩ H ∩ C) = 20

How many watch all 3 ?
Ans. 20

Now, how many watch exactly one ?


From the Venn diagram,

Watch exactly KBC = 190
Watch exactly Hockey = 40
Watch exactly Cricket = 95

Practice questions (DAVV MBA PYQs):

Q1. In a city there are 100000 people, 64% of them speak Greek, 55% people speak Latin, 43% people speak French, 21% people speak both Greek and Latin, 31% people speak both Greek and French, and 41% people speak both Latin and French. Determine the number of people speak all the three languages.

Solution: Click Here

Q2. In a survey of 500 T.V. viewers, 285 watched KBC, 195 watch cricket, 115 watch hockey, 45 watch KBC and hockey, 70 watch KBC and cricket, 50 watch cricket and hockey, 50 do not watch any of three games. How many watch all 3 and how many watch exactly one of three ?

Solution: Click Here

Q3. In a managers club, 45 play polo, out of which 30 play Polo only 28 play Snookers. 25 play Tennis  of which 11 play Tennis only, 7 play Tennis and Polo, but not Snooker. 5 play Polo and Snooker, but not Tennis
i) How many play all the thre sports?
ii) How many play Snookers only?
iii) How many members are there is the club.

Solution: Click Here

Q4. In a town of 10000 families, it was found that 40% families buy product A, 20% buy product B and 10% buy product C, 5% buy product A and product B, 3% buy product B and product C and 4% buy product A and product C. If 2% families buy product A, B, C all. Then find the number of the families buy product A only.

Solution: Click here
Share:

In a city there are 100000 people, 64% of them speak Greek, 55% people speak Latin, 43% p

                 No comments    

DAVV MBA PYQ

In a city there are 100000 people, 64% of them speak Greek, 55% people speak Latin, 43% people speak French, 21% people speak both Greek and Latin, 31% people speak both Greek and French, and 41% people speak both Latin and French. Determine the number of people speak all the three languages.
Solution:

G for Greek
L for Latin
F for French

Formula: 
n(G U L U F) = n(G)+n(L)+n(F)-n(G ∩ L)-n(G ∩ F)-n(L ∩ F)+n(G ∩ L ∩ F)

Given,
n(G U L U F) = 100000 
n(G) = 64% = 64000
n(L) = 55% = 55000
n(F) = 43% = 43000
n(G ∩ L ∩ F) = ?
n(G ∩ L) = 21% = 21000
n(G ∩ F) = 31% = 31000
n(L ∩ F) = 41% = 41000

n(G U L U F) = n(G)+n(L)+n(F)-n(G ∩ L)-n(G ∩ F)-n(L ∩ F)+n(G ∩ L ∩ F)

100000 = 64000+55000+43000-21000-31000-41000+n(G ∩ L ∩ F)

n(G ∩ L ∩ F) = 31000

Number of people speak all the three languages = 31000.

Practice questions (DAVV MBA PYQs):

Q1. In a city there are 100000 people, 64% of them speak Greek, 55% people speak Latin, 43% people speak French, 21% people speak both Greek and Latin, 31% people speak both Greek and French, and 41% people speak both Latin and French. Determine the number of people speak all the three languages.

Solution: Click Here

Q2. In a survey of 500 T.V. viewers, 285 watched KBC, 195 watch cricket, 115 watch hockey, 45 watch KBC and hockey, 70 watch KBC and cricket, 50 watch cricket and hockey, 50 do not watch any of three games. How many watch all 3 and how many watch exactly one of three ?

Solution: Click Here

Q3. In a managers club, 45 play polo, out of which 30 play Polo only 28 play Snookers. 25 play Tennis  of which 11 play Tennis only, 7 play Tennis and Polo, but not Snooker. 5 play Polo and Snooker, but not Tennis
i) How many play all the thre sports?
ii) How many play Snookers only?
iii) How many members are there is the club.

Solution: Click Here

Q4. In a town of 10000 families, it was found that 40% families buy product A, 20% buy product B and 10% buy product C, 5% buy product A and product B, 3% buy product B and product C and 4% buy product A and product C. If 2% families buy product A, B, C all. Then find the number of the families buy product A only.

Solution: Click here
Share:

A company studies the product preferences of 20,000 consumers. It was found that each

                 No comments    

DAVV MBA PYQ  

A company studies the product preferences of 20,000 consumers. It was found that each of the products A, B and C was liked by 7020, 6230 and 5980 respectively. All products were liked by 1500. Products A and B were liked by 2580, products A and C were liked by 1200 and products B and C were liked by 1950. Prove that the study results are not correct.

Solution:
Share:

C Program GATE 2018 -8

                 No comments    
Consider the following C code. Assume that unsigned long int type length is 64 bits.

unsigned long int fun(unsigned long int n){
    unsigned long int i, j = 0, sum = 0;
    for (i = n; i > 1; i = i/2) j++;
    for ( ; j > 1; j = j/2) sum++;
    return(sum);
}
Share:

C Program GATE 2018 -7

                 No comments    
Consider the following C program:

#include<stdio.h>
 
void fun1(char *s1, char *s2){
     char *tmp;
     tmp = s1;
     s1 = s2;
     s2 = tmp;
}
Share:

TCS Coding Q-01

                 No comments    

TCS NQT

Q. An automobile company manufactures both a two wheeler (TW) and a four wheeler (FW). A company manager wants to make the production of both types of vehicle according to the given data below:

1st data, Total number of vehicle (two-wheeler + four-wheeler)=v
2nd data, Total number of wheels = W

The task is to find how many two-wheelers as well as four-wheelers need to manufacture as per the given data.
Share:

C Program GATE 2019 -4

                 No comments    

C Program : GATE 2019


Consider the following C program:

#include <stdio.h> 

int main(){

float sum = 0.0, j = 1.0, i = 2.0; 

while (i/j > 0.0625){

j = j + j;

sum = sum + i/j;

printf("%f\n", sum);

}

return 0;

}


The number of times the variable sum will be printed, when the above program is executed, is _________________.
Share:

C Program GATE 2019-1

                 No comments    

C Program : GATE 2019


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;
Share:

Explain the concepts of Generalization and Aggregation with appropriate examples.

                 No comments    

Explain the concepts of Generalization and Aggregation with appropriate examples. (RGPV 2019)

Ans. Generalization:

Entities with common attributes can be merged into a generic or super type entity by generalisation. 

For example, the entity EMPLOYEE is a super type of Professor, Conductor, and Engineer.

Share:

Time Complexities of sorting algorithms

                 2 comments    

Algorithm

Time Complexity

Best case

Average case

Worst case

Bubble Sort

Ω(n)

θ(n2)

O(n2)

Bucket Sort

Ω(n+k)

θ(n+k)

O(n2)

Heap Sort

Ω(n log(n))

θ(n log(n))

O(n log(n))

Insertion Sort

Ω(n)

θ(n2)

O(n2)

Merge Sort

Ω(n log(n))

θ(n log(n))

O(n log(n))

Quick Sort

Ω(n log(n))

θ(n log(n))

O(n2)

Radix Sort

Ω(nk)

θ(nk)

O(nk)

Selection Sort

Ω(n2)

θ(n2)

O(n2)
Share: