Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Kaluti
0
votes
41
MadeEasy Test Series: Theory Of Computation - Finite Automata
Let L = {(aP)*⎪P is a prime number} and Σ={a}. The minimum number of states in NFA that accepts the language L are ________. i don't think it is even a regular language. then how can NFA be generated?
Let L = {(aP)*⎪P is a prime number} and Σ={a}. The minimum number of states in NFA that accepts the language L are ________.i don't think it is even a regular language...
2.1k
views
answered
Aug 12, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
42
TOC Countability
Let A and B be countably infinite set which of the following is false :- a.) any subset of a or b is countable infinite b:) A union B and A*B is countable infinite c:)the union of countable infinite collection of countably infinite sets is countable infinite d)cartesian product of countable infinite collection of countable infinite sets is countable infinite
Let A and B be countably infinite set which of the following is false :-a.) any subset of a or b is countable infiniteb:) A union B and A*B is countable infinitec:)the un...
2.7k
views
answered
Aug 11, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
43
TOC Identify Language
Check for Regular,CFL,CSL? 1. L={a^n b^m | LCM(n,m)=600) } 2.L={a^n b^m | LCM(n,m)=k) } 3. L={a^n b^m | GCD(n,m)=600) } 4.L={a^n b^m | GCD(n,m)=k) } I think first is CFL as we will have limited cases where LCM is 600 but for second one it should be CSL. For GCD whether it is constant 600 or k,we will have infinite cases.So it must be CSL. Please verify answer and approach
Check for Regular,CFL,CSL?1. L={a^n b^m | LCM(n,m)=600) }2.L={a^n b^m | LCM(n,m)=k) }3. L={a^n b^m | GCD(n,m)=600) }4.L={a^n b^m | GCD(n,m)=k) } I think first is CFL as w...
520
views
answered
Aug 4, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
44
Ace Test Series: Algorithms - Graph Algorithms
(A). When a recurrence relation has a cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program. (B). Given a connected graph $G(V,E)$ if a vertex $v$ $\epsilon$ $V$ is visited ... have the length of atleast 'k'. Given wording is 'atmost'. So, B should be wrong. Given answer is D.
(A). When a recurrence relation has a cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program.(B). Given a connected...
655
views
answered
Aug 3, 2017
Algorithms
ace-test-series
algorithms
graph-algorithms
breadth-first-search
+
–
0
votes
45
which of the statements are true for a 5*5 matrix whose all entries are 1 ?
1. A is not diagonalizable 2.The minimal polynomial and the characteristic polynomial of A are not equal
1. A is not diagonalizable2.The minimal polynomial and the characteristic polynomial of A are not equal
1.0k
views
answered
Jul 31, 2017
0
votes
46
Discrete mathematics example 13 Kenneth rosen
How can sentence be translated into a logical expression ? "You can't ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old". Can answer be (!s->r)->!q Where q= You can ride the roller coaster r=You are under 4 feet tall s= You are older than 16 years old
How can sentence be translated into a logical expression ?"You can't ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old".Can answ...
3.3k
views
answered
Jul 19, 2017
0
votes
47
Kenneth Rosen Edition 6th Exercise 1.2 Question 29 (Page No. 29)
Show that each of the conditional statement is a tautology not using truth table [(p → q) ∧ (q → r)] → (p → r)
Show that each of the conditional statement is a tautologynot using truth table [(p → q) ∧ (q → r)] → (p → r)
755
views
answered
Jul 19, 2017
Mathematical Logic
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
+
–
0
votes
48
GATE CSE 2001 | Question: 4
Consider the function $h: N \times N \rightarrow N$ so that $h(a,b) = (2a +1)2^b - 1$, where $N=\{0,1,2,3,\dots\}$ is the set of natural numbers. Prove that the function $h$ is an injection (one-one). Prove that it is also a Surjection (onto)
Consider the function $h: N \times N \rightarrow N$ so that $h(a,b) = (2a +1)2^b - 1$, where $N=\{0,1,2,3,\dots\}$ is the set of natural numbers.Prove that the function $...
3.1k
views
answered
Jul 18, 2017
Set Theory & Algebra
gatecse-2001
functions
set-theory&algebra
normal
descriptive
+
–
0
votes
49
How to solve this generating function Question
Given two each of p kinds of objects and one each of additional q kind of objects, in how many ways r objects can be selected? Please give a detailed solution.
Given two each of p kinds of objects and one each of additional q kind of objects, in how many ways r objects can be selected?Please give a detailed solution.
894
views
answered
Jul 16, 2017
Mathematical Logic
combinatory
generating-functions
+
–
0
votes
50
Kenneth Rosen Edition 6th Exercise 5.3 Question 37 (Page No. 362)
How many bit strings of length 10 contain at least three 1s and at least three 0s? My Approach:-> using product rule There are 3 subtask following (filling 3 ones in 10 places) = (filling 3 zeros in remaing 7 places) = ... greater than (total number of string). Now , i want to know what is wrong in my apporach. please explain..
How many bit strings of length 10 contain at least three 1s and at least three 0s?My Approach:->using product rule There are 3 subtask following (filling 3 ones in 10 pla...
1.8k
views
answered
Jul 16, 2017
Combinatory
discrete-mathematics
combinatory
kenneth-rosen
+
–
0
votes
51
[Discrete maths] Permutations and combinations
How many ways can n books be placed on k distinguishable shelves a. if no two books are the same ,and the positions of the books on the shelves does not matter? b. if no two books are the same,and the positions of the books on the shelves matter?
How many ways can n books be placed on k distinguishable shelves a. if no two books are the same ,and the positions of the books on the shelves does not matter? b. if no...
490
views
answered
Jul 10, 2017
Mathematical Logic
discrete-mathematics
combinatory
+
–
0
votes
52
Diameter of a graph and tree
Why there is a difference between diameter of a graph and tree? Diameter of a tree as i have read is the maximum path between two vertices(number of edges between two vertices) But for tree it says number of nodes on the longest path. But tree is a graph so why cant i find the diameter of tree in similar way?
Why there is a difference between diameter of a graph and tree?Diameter of a tree as i have read is the maximum path between two vertices(number of edges between two vert...
665
views
answered
Jul 9, 2017
Mathematical Logic
graph-theory
algorithms
+
–
0
votes
53
Gatebook
I am not able to understand the last component in square brackets we have to minus from all combinations the combinations with that dotted line but intersection part i didn't get
I am not able to understand the last component in square brackets we have to minus from all combinations the combinations with that dotted line but intersection part i di...
523
views
answered
Jul 9, 2017
0
votes
54
Answer is provided as -1, why not +1?
315
views
answered
Jul 6, 2017
0
votes
55
set theory
in a group of students 100 studying Hindi,100 studying Maths and 100 studying English,20 people studying Maths and Mnglish,40 studying English and Hindi,60 studying Hindi and Maths,210 students are studying only 1 subject.How many are studying all three?
in a group of students 100 studying Hindi,100 studying Maths and 100 studying English,20 people studying Maths and Mnglish,40 studying English and Hindi,60 studying Hind...
256
views
answered
Jul 5, 2017
0
votes
56
relation
Plwase explain how inverse of an equivalence relation is an equivalence relation with suitable example?
Plwase explain how inverse of an equivalence relation is an equivalence relation with suitable example?
173
views
answered
Jul 5, 2017
Mathematical Logic
discrete-mathematics
+
–
0
votes
57
graph
a tree with n vertices can have at most 1 perfect matching how? perfect matching means no vertices will be left with 0 dergree right so how a tree can have a perfect matching explain with the help of trees plz
a tree with n vertices can have at most 1 perfect matching how? perfect matching means no vertices will be left with 0 dergree right so how a tree can have a perfect mat...
467
views
answered
Jul 5, 2017
Mathematical Logic
graph-theory
+
–
0
votes
58
Relations
Please tell me how to calculate total number of symmetric relations on a set of 5 elements. I know the answer but want the proof.
Please tell me how to calculate total number of symmetric relations on a set of 5 elements.I know the answer but want the proof.
440
views
answered
Jul 5, 2017
Set Theory & Algebra
relations
set-theory&algebra
discrete-mathematics
+
–
0
votes
59
Kenneth Rosen logic and proof example 21
Negation of ∃ x(x^2=2) should be ∀x (x^2!=2).But in the book it's given as ∀x(x^2=2). I think it is misprint. Please correct me if I m wrong. Thank you in advance.
Negation of ∃ x(x^2=2) should be ∀x (x^2!=2).But in the book it's given as ∀x(x^2=2). I think it is misprint. Please correct me if I m wrong.Thank you in advance.
197
views
answered
Jul 5, 2017
1
votes
60
MadeEasy Workbook: Mathematical Logic - Propositional Logic
<p>what is the negation of:</p> <p>x is prime iff x is not composite.</p> <p>a.x is prime and x is not composite or x is not prime and x is composite.</p> <p>b.x is prime and x is composite or x is not prime and x is not composite.</p>
<p>what is the negation of:</p <p>x is prime iff x is not composite.</p <p>a.x is prime and x is not composite or x is not prime and x is composite.</p <p>b.x is prime an...
365
views
answered
Jul 3, 2017
Mathematical Logic
discrete-mathematics
mathematical-logic
propositional-logic
made-easy-booklet
+
–
0
votes
61
Regular language problem
Which of the following is TRUE? S1: Any language L over an alphabet Σ,L+=L-{ϵ} is always TRUE. S2: For any automata M, L(M)≠∅( Marks: 0.00 ) S1,S2 Only S1 Only S2 Both the statements are false
Which of the following is TRUE?S1: Any language L over an alphabet Σ,L+=L-{ϵ} is always TRUE.S2: For any automata M, L(M)≠∅( Marks: 0.00 ) S1,S2 Only S1 Only S2 Bot...
686
views
answered
Jun 25, 2017
0
votes
62
MadeEasy Subject Test: Theory of Computation - Finite Automata
What is the answer for following question.
What is the answer for following question.
979
views
answered
Jun 25, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
63
Binary tree
An array X of n distinct integers is interpreted as a complete binary tree.The index of first element of array is 0.index of parent of element X[i] is (i-2)/2 (i/2)-1
An array X of n distinct integers is interpreted as a complete binary tree.The index of first element of array is 0.index of parent of element X[i] is(i-2)/2(i/2)-1
419
views
answered
Jun 14, 2017
0
votes
64
Graph
What can be used to find if a graph is disconnected BFS DFS Both
What can be used to find if a graph is disconnectedBFSDFSBoth
202
views
answered
Jun 14, 2017
0
votes
65
theory of computation
Which of the following languages is/are REGULAR ? A) L1 = { wxwR / w,x $\in$ {a,b}* and length(w) = 6 } B) L2 = { wxwR / w,x $\in$ {a,b}* and length(x) = 6 } I feel A) is regular ..but B) is not ...Please verify ...
Which of the following languages is/are REGULAR ?A) L1 = { wxwR / w,x $\in$ {a,b}* and length(w) = 6 } B) L2 = { wxwR / w,x $\in$ {a,b}* and length(x) = 6 }I feel A) is r...
480
views
answered
Jun 4, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
66
Regular Expression
Given statement is true or false 1. L is regular language $\Leftrightarrow$ Ǝ a regular expression without $\bigstar$ answer in detail
Given statement is true or false 1. L is regular language $\Leftrightarrow$ Ǝ a regular expression without $\bigstar$ answer in detail
522
views
answered
May 31, 2017
0
votes
67
Digital Electronics
Size of rom for converting binary code to gray code?
Size of rom for converting binary code to gray code?
503
views
answered
May 30, 2017
0
votes
68
[COA][ Hamacher 1.6] Cache memory
1.6 Suppose that execution time for a program is directly proportional to instruction access time and that access to an instruction in the cache is 20 times faster than access to an instruction in the main memory. Assume that a requested instruction ... added only one then please explain why? part B) Does doubling cache means access time of cache is also doubled?
1.6 Suppose that execution time for a program is directly proportional to instruction access time and that access to an instruction in the cache is 20 times faster than a...
1.8k
views
answered
May 22, 2017
CO and Architecture
co-and-architecture
memory-interfacing
cache-memory
+
–
0
votes
69
Doubt
L = { an bm cp dq , n != m or p != q } Is it inherently ambiguous or not????
L = { an bm cp dq , n != m or p != q }Is it inherently ambiguous or not????
732
views
answered
Apr 15, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register