Register

Recent questions tagged nptel-quiz

0 votes
0 answers
31
NPTEL Assignment Question
User Avatar
0 votes
0 answers
32
NPTEL Assignment Question
Its MSQ. Please help
Its MSQ. Please help
User Avatar
0 votes
0 answers
34
NPTEL Assignment Question
User Avatar
1 votes
1 answer
36
NPTEL Assignment Question
The number of possible subsequences in a string of length n are: $n^{2}$ $2^{n}$ n! n(n-1)
The number of possible subsequences in a string of length n are:$n^{2}$$2^{n}$ n!n(n-1)
User Avatar
1 votes
1 answer
38
NPTEL Assignment Question
In an array A[1..n] of n distinct elements, if i < j and A[i] > A[j], then the pair (i,j) is called an inversion of A. How many inversions are there in the array A = {n,n-1,n-2,...,3,2,1}? n(n-1) / 2 n(n+1) / 2 2n(n+1) None
In an array A[1..n] of n distinct elements, if i < j and A[i] A[j], then the pair (i,j) is called an inversion of A.How many inversions are there in the array A = {n,n-1...
User Avatar
0 votes
1 answer
39
NPTEL Assignment Question
User Avatar
0 votes
0 answers
40
NPTEL Assignment Question
The solution of the recurrence: T(n) = 2T(n/3) + nlgn by given Θ - notation bound is Θ(nlgn) Θ($n^{2}$) Θ(n) Θ($n^{2}$lgn)
The solution of the recurrence: T(n) = 2T(n/3) + nlgn by given Θ - notation bound isΘ(nlgn)Θ($n^{2}$)Θ(n)Θ($n^{2}$lgn)
User Avatar
1 votes
0 answers
41
NPTEL Assignment Question
User Avatar
0 votes
0 answers
42
NPTEL Assignment Question
User Avatar
0 votes
0 answers
43
NPTEL Assignment Question
User Avatar
0 votes
0 answers
44
NPTEL Assignment Question
User Avatar
0 votes
0 answers
45
NPTEL Assignment Question
User Avatar
0 votes
0 answers
46
NPTEL Assignment Question
User Avatar
0 votes
0 answers
47
NPTEL Assignment Question
User Avatar
0 votes
0 answers
48
NPTEL Assignment Question
User Avatar
0 votes
0 answers
49
NPTEL Assignment Question
User Avatar
1 votes
0 answers
50
NPTEL Assignment Question
User Avatar
0 votes
0 answers
53
NPTEL Assignment Question
in a class we ask the students their birthdays; one-by-one. continue till a date repeats. (Assume that there are 365 dates.) Let x := #students asked. What is P (x = k) =?, for $k \epsilon n$
in a class we ask the students their birthdays; one-by-one. continue till a date repeats.(Assume that there are 365 dates.)Let x := #students asked.What is P (x = k) =?, ...
User Avatar
0 votes
1 answer
54
NPTEL Assignment Question
Sir, kindly solve this.
Sir, kindly solve this.
User Avatar
0 votes
0 answers
55
NPTEL Assignment Question
Sir kindly explain. I did not get this question.
Sir kindly explain. I did not get this question.
User Avatar
0 votes
0 answers
56
NPTEL Assignment Question
NPTEL Assignment Question https://nptel.ac.in/content/storage2/courses/downloads/106105190/noc19_cs01_Assignment12.pdf
NPTEL Assignment Questionhttps://nptel.ac.in/content/storage2/courses/downloads/106105190/noc19_cs01_Assignment12.pdf
User Avatar
0 votes
0 answers
57
NPTEL Assignment Question
Kindly Solve this sir, My answer is wrong.
Kindly Solve this sir, My answer is wrong.
User Avatar
0 votes
0 answers
58
NPTEL Assignment Question
Question may be incorrect I guess. Kindly look into it. Sir please solve this.
Question may be incorrect I guess. Kindly look into it. Sir please solve this.
User Avatar
2 votes
1 answer
59
NPTEL Assignment Question
A regular expression for accepting strings with exactly one $1$ more than $0$’s is $0^{\ast}1$ $(0|1)^{\ast}1(0|1)^{\ast}$ $(0|1)^{\ast}1(0|1)^{\ast}|1(0|1)^{\ast}$ Not possible
A regular expression for accepting strings with exactly one $1$ more than $0$’s is$0^{\ast}1$$(0|1)^{\ast}1(0|1)^{\ast}$$(0|1)^{\ast}1(0|1)^{\ast}|1(0|1)^{\ast}$Not pos...
User Avatar
Page: