Show, using the pigeonhole principle, that in any group of 30 people, 5 people can always be found who were born on the same day of the week.
See Answer →In a tennis tournament, each entrant plays a match in the first round. Next, all winners from the first round play a second-round match. Winners continue to move on to the next round, until finally only one player is left as the tournament winner. Assuming that tournaments always involve n = 2k players, for some k, find the recurrence relation for the number rounds in a tournaments of n players.
See Answer →A committee consisting of 2 male and2 female workers is to be constituted from 8 male and 9 female workers. In how many distinct ways can this be done ?
See Answer →Define the terms Domain, Co-domain and Range in the context of a function. Also find the domain, co-domain and range for a function A to B, where A={1,2,3,4} and B={1,4,9,16,25}
See Answer →Given the Boolean expression ,draw the corresponding circuit, where a, b, c and d are the inputs to the circuitry
Prove the following theorem by direct proof method: ‘‘The square of an even integer is an even integer.’’
See Answer →What is proposition ? Explain with the help of an example. Explain Disjunction and Conjunction with the help of truth table for each.
See Answer →Describe the divide-and-conquer approach to solve recurrences ? Explain how this approach can be used to apply binary search in a sorted list.
See Answer →Moore and Mealy Machine
See Answer →Deterministic and Non-deterministic Turing Machine
See Answer →Deterministic and Non-deterministic finite automata
See Answer →What is a finite automata ? Why is it needed? How is a finite automata represented?. Also explain the term regular expression with the help of an example.
See Answer →What is isomorphism? Find, if the following graphs G1 and G2 are isomorphic or not. Explain how you arrived at your answer.
Draw a hypercube graph Q3 (also called the cubical hypercube). Check whether the hypercube Q3 is Hamiltonian
See Answer →A die is rolled once. What are the probabilities of the following events:
a. Getting an odd number
b. Getting at least a value 2
c. Getting at most a value 2
d. Getting at least 7
How many different permutations arepossible of the letters, taken all at a time, of the word: ASSESSES?
See Answer →Use Mathematical Induction to prove that :
Graph Colouring Problem
See Answer →Vertex cover problem
See Answer →Clique problem
See Answer →