search
Log In

Questions by Harsh181996

2 votes
1 answer
1
Consider a group of k people. Assume that each person's birthday is drawn uniformly at random from the 365 possibilities. (And ignore leap years.) What is the smallest value of ksuch that the expected number of pairs of distinct people with the same birthday is at least one?
asked Mar 13, 2017 in Combinatory 617 views
0 votes
0 answers
2
Given Answer D) I think the answer should be A) Complement of L1 will be ( i = j or j = k) right so there can be a NPDA that will accept this right ?
asked Feb 5, 2017 in Theory of Computation 139 views
0 votes
0 answers
3
The given answer is A) but option A) produces the string "ab" which is not produced by the above grammar so how can the answer be A) ?
asked Feb 5, 2017 in Compiler Design 116 views
1 vote
1 answer
4
The answer given is D) Why is option 3 and 4 correct ? In 4) if there is a branch instruction , it can lead to stalls ,so how will it improve the execution ?
asked Feb 5, 2017 in CO and Architecture 120 views
3 votes
1 answer
5
The given answer is C) But shouldnt the answer be D) as it satisfies the new database
asked Jan 27, 2017 in Databases 100 views
2 votes
1 answer
6
The question basically says no. of different outputs produced for given sequence of input (1,2,...,n) I thought in terms of push - pop pairs but cant arrive at the answer @arjun sir , @bikram sir
asked Jan 25, 2017 in Programming 244 views
1 vote
1 answer
7
Is statement 1 true for all safe expressions ?
asked Jan 24, 2017 in Databases 386 views
2 votes
2 answers
8
The Given Answer is C) , my doubt is can PassportNo take NULL values as it is defined as UNIQUE ?
asked Jan 17, 2017 in Databases 187 views
0 votes
1 answer
9
I am getting answer as 9 , the given answer is 8.
asked Jan 12, 2017 in CO and Architecture 237 views
0 votes
0 answers
10
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
asked Jan 5, 2017 in Algorithms 88 views
1 vote
1 answer
11
The Answer given is A) I think the naswer should be B) as we have both the prev pointer and the next pointer available , it will take constant time to update the adjacent nodes pointers and delete the given node .?
asked Jan 3, 2017 in DS 933 views
...