18 votes
8 answers
2
What is the highest type number that can be assigned to the following grammar?$$S\to Aa,A\to Ba,B \to abc$$Type 0Type 1Type 2Type 3
6 votes
2 answers
3
2 votes
2 answers
4
How many bit strings contain exactly eight 0s and 10 1s if every 0 must be immediately followed by a 1?I got answer 9C2=36.Answer given 45
2 votes
2 answers
5
Prove that at a party where there are at least two people, there are two people who know the same number of other people there.
0 votes
1 answer
6
Show that there are at least six people in California (population: 37 million) with the same three initials who were born on the same day of the year (but not necessarily...
1 votes
1 answer
7
Show that in a group of 10 people (where any two people are either friends or enemies), there are either three mutual friends or four mutual enemies, and there are either...
0 votes
1 answer
8
Show that in a group of five people (where any two people are either friends or enemies), there are not necessarily three mutual friends or three mutual enemies.
1 votes
1 answer
9
Assume that in a group of six people, each pair of individuals consists of two friends or two enemies. Show that there are either three mutual friends or three mutual ene...
8 votes
1 answer
10
During a month with 30 days, a baseball team plays at least one game a day, but no more than 45 games. Show that there must be a period of some number of consecutive days...
5 votes
2 answers
11
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s?I got 382.Is it correct?
4 votes
2 answers
12
How many functions are there from the set {1, 2, . . . , n}, where n is a positive integer, to the set {0, 1}a) that assign 1 to exactly one of the positive integers les...
9 votes
9 answers
13
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
0 votes
1 answer
16
void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); push(s, i); } }
1 votes
3 answers
17
which of the following is correct?
1 votes
1 answer
18
How n + n/2 + n/4 + .... 1 can approximate it as an infinite GP?Is it =1+2+4+8+..........n/4 + n/2 +n ?=O(2^n) ?
0 votes
1 answer
19
Is it loglog(2^2^2^2)=4Let n=(2^(2^(2^2)))=2^16Loglogn=4T(n)=1+T(2^8)=2+T(2^4)=3+T(2^2)=4+T(2)=5Let n= (2^(2^(2^(2^(2^2)))))=2^(2^65536)Loglog n = 65536