Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Anu
3
votes
5
answers
1
UGC NET CSE | December 2015 | Part 2 | Question: 6
Which of the following arguments are not valid? "If Gora gets the job and works hard, then he will be promoted. if Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard. ... $n^2 > 1$, then $n>1$. i and iii ii and iii i,ii, and iii i and ii
Which of the following arguments are not valid?"If Gora gets the job and works hard, then he will be promoted. if Gora gets promotion, then he will be happy. He will not ...
6.3k
views
asked
Jul 5, 2016
Mathematical Logic
ugcnetcse-dec2015-paper2
discrete-mathematics
mathematical-logic
+
–
18
votes
8
answers
2
ISRO2016-38
What is the highest type number that can be assigned to the following grammar? $S\to Aa,A\to Ba,B \to abc$ Type 0 Type 1 Type 2 Type 3
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
17.6k
views
asked
Jul 4, 2016
Theory of Computation
theory-of-computation
identify-class-language
isro2016
+
–
6
votes
2
answers
3
ISRO2014-11
An aggregation association is drawn using which symbol? A line which loops back on to the same table A small open diamond at the end of a line connecting two tables A small closed diamond at the end of a line connecting two tables A small closed triangle at the end of a line connecting two tables
An aggregation association is drawn using which symbol?A line which loops back on to the same tableA small open diamond at the end of a line connecting two tablesA small ...
6.6k
views
asked
Jun 28, 2016
Databases
isro2014
databases
relational-model
+
–
2
votes
2
answers
4
permutaions and combinations
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
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
3.9k
views
asked
Jul 15, 2015
Combinatory
combinatory
counting
+
–
2
votes
2
answers
5
pigeonhole
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.
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.
2.0k
views
asked
Jul 14, 2015
Combinatory
combinatory
counting
pigeonhole-principle
+
–
0
votes
1
answer
6
pigeonhole
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 in the same year). Assume that everyone has three initials.
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...
2.1k
views
asked
Jul 14, 2015
Combinatory
pigeonhole-principle
counting
combinatory
+
–
1
votes
1
answer
7
pigeonhole
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 three mutual enemies or four mutual friends.
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...
4.1k
views
asked
Jul 14, 2015
Combinatory
combinatory
counting
pigeonhole-principle
+
–
0
votes
1
answer
8
pigeonhole
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.
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.
907
views
asked
Jul 14, 2015
Combinatory
combinatory
counting
pigeonhole-principle
+
–
1
votes
1
answer
9
pigeonhole
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 enemies in the group.
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...
3.6k
views
asked
Jul 14, 2015
Combinatory
combinatory
counting
pigeonhole-principle
+
–
8
votes
1
answer
10
application of pigeonhole principle
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 during which the team must play exactly 14 games
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...
13.5k
views
asked
Jul 14, 2015
Combinatory
combinatory
counting
pigeonhole-principle
+
–
5
votes
2
answers
11
counting
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s? I got 382.Is it correct?
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s?I got 382.Is it correct?
4.0k
views
asked
Jul 13, 2015
Combinatory
counting
+
–
4
votes
2
answers
12
number of function
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 less than n?
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...
3.9k
views
asked
Jul 13, 2015
Combinatory
counting
functions
+
–
9
votes
9
answers
13
Kenneth Rosen Edition 6 Question 45 (Page No. 346)
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
9.3k
views
asked
Jul 13, 2015
Combinatory
combinatory
counting
+
–
1
votes
1
answer
14
which of the following is true
Let L denote the languages generated by the grammar S → S0S0 | 00. Which of the following is TRUE? L = 0+ L is regular but not 0+ L is context free but not regular L is not context free C is the given answer but I got B L={00(2),000000(6),0000000000(10)...} number of zeros inside the bracket Is it correct?
Let L denote the languages generated by the grammar S → S0S0 | 00.Which of the following is TRUE?L = 0+L is regular but not 0+L is context free but not regularL is n...
642
views
asked
Jun 14, 2015
53
votes
4
answers
15
GATE CSE 1989 | Question: 1-vii, ISRO2015-14
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is $4$ $5$ $6$ $3$
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear p...
17.9k
views
asked
Jun 1, 2015
Algorithms
hashing
isro2015
gate1989
algorithms
normal
+
–
0
votes
1
answer
16
Is it correct?
void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); push(s, i); } }
void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); push(s, i); } }
680
views
asked
May 21, 2015
1
votes
3
answers
17
which of the following is correct
which of the following is correct?
which of the following is correct?
1.2k
views
asked
May 18, 2015
Algorithms
logarithmic-function
normal
+
–
1
votes
1
answer
18
doubt
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) ?
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) ?
463
views
asked
May 14, 2015
Algorithms
algorithms
asymptotic-notation
time-complexity
+
–
0
votes
1
answer
19
doubt
Is it loglog(2^2^2^2)=4 Let n=(2^(2^(2^2)))=2^16 Loglogn=4 T(n)=1+T(2^8)=2+T(2^4)=3+T(2^2)=4+T(2)=5 Let n= (2^(2^(2^(2^(2^2)))))=2^(2^65536) Loglog n = 65536
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
791
views
asked
May 14, 2015
Algorithms
algorithms
time-complexity
+
–
4
votes
3
answers
20
Big O
The concept of order (Big O) is important because— (a) it can be used to decide the best algorithm that solves a given problem (b) it determines the maximum size of a problem that can be solved in a given system, in a given amount of time (c) it is the lower bound of the growth rate of the algorithm (d) Both (a) and (b)
The concept of order (Big O) is important because—(a) it can be used to decide the best algorithm that solves a given problem(b) it determines the maximum size of a pro...
17.6k
views
asked
May 14, 2015
Algorithms
algorithms
time-complexity
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register