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 dragonball
5
votes
2
answers
41
How to make a minimal DFA
Draw a minimal DFA which accepts a language L over {a,b} 01 [ ((10) * + 111) * + 0 ] * 1
Draw a minimal DFA which accepts a language L over {a,b}01 [ ((10) * + 111) * + 0 ] * 1
739
views
asked
Oct 26, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
2
votes
1
answer
42
CLR 3rd Edition page no. 42 Q.n. c
Wha is the relationship between the running time of insertion sort and the number of inversions in the input array ? Is the circled text should be greater instead of less .Plz justify . PS: This image has been taken from solun manual of CLR.
Wha is the relationship between the running time of insertion sort and the number of inversions in the input array ?Is the circled text should be greater instead of less ...
1.2k
views
asked
Oct 21, 2017
Algorithms
algorithms
array
time-complexity
+
–
0
votes
0
answers
43
Time complexity
602
views
asked
Oct 15, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
bad-question
+
–
1
votes
1
answer
44
Master Theorem
539
views
asked
Oct 15, 2017
Algorithms
algorithms
master-theorem
time-complexity
test-series
+
–
2
votes
1
answer
45
Asymptotic time order
895
views
asked
Oct 15, 2017
Algorithms
algorithms
asymptotic-notation
test-series
+
–
2
votes
1
answer
46
Tree traversal
292
views
asked
Oct 15, 2017
Programming in C
data-structures
+
–
0
votes
0
answers
47
Spanning Tree
423
views
asked
Oct 15, 2017
Algorithms
algorithms
minimum-spanning-tree
+
–
4
votes
1
answer
48
Normalization
Given the following set of FD's find the minimum set of 3 NF relations. A->B A->C B->C B->D D->B ABE->F E->J EJ->H H->G
Given the following set of FD's find the minimum set of 3 NF relations.A->B A->CB->CB->DD->BABE->FE->JEJ->HH->G
281
views
asked
Oct 8, 2017
Databases
database-normalization
databases
+
–
5
votes
5
answers
49
Matrix Chain
Total no. of ways to perform matrix multiplication having 7 matrices is ? Total no. of ways to by which we could parenthesize 7 matrices is ? Does the above two questions are different or same ? Plz explain the answer.
Total no. of ways to perform matrix multiplication having 7 matrices is ?Total no. of ways to by which we could parenthesize 7 matrices is ?Does the above two questions ...
15.6k
views
asked
Oct 1, 2017
Algorithms
algorithms
dynamic-programming
+
–
1
votes
1
answer
50
QUICKSORT
Could anyone describe how the partitioning algorithm vary when the pivot is varied ? In Cormen , last element is taken as pivot . Suppose I took first element or middle element or 3 rd element as pivot then how the partitioning algorithm will change.
Could anyone describe how the partitioning algorithm vary when the pivot is varied ?In Cormen , last element is taken as pivot . Suppose I took first element or middle e...
623
views
asked
Sep 27, 2017
Algorithms
algorithms
sorting
quick-sort
+
–
1
votes
1
answer
51
Probability
Let X and Y be independent random variables each taking the values -1 or 1 with probability 1/2. Let Z=XY . Show that X,Y,Z are pairwise independent . Are they indepenedent ?
Let X and Y be independent random variables each taking the values -1 or 1 with probability 1/2. Let Z=XY . Show that X,Y,Z are pairwise independent .Are they indepeneden...
1.4k
views
asked
Sep 25, 2017
Probability
probability
conditional-probability
+
–
0
votes
0
answers
52
Time complexity
class Solution { public: int getSum(int a, int b) { int total = a; while (b != 0) { total = a ^ b; //calculates sum of 'a' and 'b' without taking carry b = (a & b) << 1; //calculates the carry a = total; //add sum(without carry) and carry } return total; } }; What is the time complexity of the above code ?Plz describe.
class Solution {public: int getSum(int a, int b) { int total = a; while (b != 0) { total = a ^ b; //calculates sum of 'a' and 'b' ...
208
views
asked
Sep 21, 2017
Algorithms
algorithms
asymptotic-notation
time-complexity
+
–
–1
votes
1
answer
53
Time Complexity
What will be the time complexity of a function f(n) = n^-2 i.e. pow (n,-2) ?
What will be the time complexity of a function f(n) = n^-2 i.e. pow (n,-2) ?
539
views
asked
Sep 12, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
2
votes
3
answers
54
C Program -3
What type of conversion is not accepted in C ? a. from char to int b. from float to char pointer c.from negative int to char d. from double to char
What type of conversion is not accepted in C ?a. from char to int b. from float to char pointerc.from negative int to chard. from double to char
2.0k
views
asked
Aug 27, 2017
Programming in C
programming-in-c
+
–
3
votes
5
answers
55
C Program -2
#include<stdio.h> int f(int a){ a > 20 ? return 10: return 20; } int main(){ int b=fun(20); return 0; } what will be the output of this program ?
#include<stdio.h>int f(int a){ a 20 ? return 10: return 20;}int main(){int b=fun(20);return 0;}what will be the output of this program ?
1.7k
views
asked
Aug 27, 2017
Programming in C
programming-in-c
+
–
1
votes
2
answers
56
C program - 1
#include<stdio.h> int main(){ short int i=20; char c=97; printf("%d %d %d\n",sizeof(i),sizeof(c),sizeof(i+c)); return 0; } could anyone explian why the answer of sizeof(i+c) is 4 ?
#include<stdio.h>int main(){short int i=20;char c=97;printf("%d %d %d\n",sizeof(i),sizeof(c),sizeof(i+c));return 0;} could anyone explian why the answer of sizeof(i+c) is...
5.6k
views
asked
Aug 27, 2017
Programming in C
data-structures
programming-in-c
+
–
1
votes
0
answers
57
Properties of Regular Language with Non- regular Language
Can anyone elaborate the properties of regular language with non regular under union, intersection, set difference , complement etc.
Can anyone elaborate the properties of regular language with non regular under union, intersection, set difference , complement etc.
532
views
asked
Aug 16, 2017
Theory of Computation
theory-of-computation
regular-language
closure-property
+
–
0
votes
1
answer
58
Linear Algebra-Determinant
Suppose det(A)=4 then how we could find the det(a^4) ? A is a square matrix of order 4X4 .
Suppose det(A)=4 then how we could find the det(a^4) ?A is a square matrix of order 4X4 .
514
views
asked
Jun 28, 2017
Linear Algebra
engineering-mathematics
linear-algebra
+
–
1
votes
2
answers
59
Subnet Mask
What is subnet mask ? Plz explain why do u need subnet mask in Computer Networks ? PS: I want high level explanation plz do not give any fundamental explanation .
What is subnet mask ?Plz explain why do u need subnet mask in Computer Networks ? PS: I want high level explanation plz do not give any fundamental explanation .
562
views
asked
Jun 27, 2017
Computer Networks
computer-networks
subnetting
+
–
0
votes
1
answer
60
CLR 3rd edition , page no 87, Q.no. 4.3-6
While solving this recurrence T(n) = 2T(n/2 + 17) + n what is the need of 17 and how to go forward to solve this question using the method of master theorem ?
While solving this recurrence T(n) = 2T(n/2 + 17) + n what is the need of 17 and how to go forward to solve this question using the method of master theorem ?
398
views
asked
Jun 22, 2017
Algorithms
recurrence-relation
master-theorem
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register