Register
Filter

Recent questions without answers

0 votes
0 answers
5161
#KennethRosen#DiscreteMaths
R is iff $R ^{-1}$ is Total ? a function ? a surjection ? an injection ? a bijection ? Fill in the entries in the table.
R isiff $R ^{-1}$ isTotal?a function?a surjection?an injection?a bijection?Fill in the entries in the table.
User Avatar
2 votes
0 answers
5165
Peter Linz Edition 4 Exercise 2.3 Question 13 (Page No. 62)
Give a simple verbal description of the language accepted by the dfa in following figure. Use this to find another dfa, equivalent to the given one, but with fewer states.
Give a simple verbal description of the language accepted by the dfa in following figure.Use this to find another dfa, equivalent to the given one, but with fewer states....
User Avatar
0 votes
0 answers
5168
CLRS CHAPTER 25
FOR THE EXTENDED-SHORTEST-PATH if we want to find the distance between 1->4 and the 1->5 +5->4 gives the shortest path and if 1->5 gets its shortest path as 1->2->5 and 5>4 gets its shortest path as 5->3->4 then how will we get it?? as one of the operands is always from the initial array.
FOR THE EXTENDED-SHORTEST-PATH if we want to find the distance between 1->4 and the 1->5 +5->4 gives the shortest path and if 1->5 gets its shortest path as 1->2->5 and ...
User Avatar
0 votes
0 answers
5173
self doubt
Are new IIT’s worth joining than old NIT’s if you want to go for phD after M.tech?
Are new IIT’s worth joining than old NIT’s if you want to go for phD after M.tech?
User Avatar
0 votes
0 answers
5182
self doubt
A directed acyclic graph has no connected components. TRUE OR FALSE???
A directed acyclic graph has no connected components.TRUE OR FALSE???
User Avatar
0 votes
0 answers
5183
Peter Linz Edition 4 Exercise 2.3 Question 10 (Page No. 62)
Define a dfa with multiple initial states in an analogous way to the corresponding nfa in Exercise 18, Section 2.2. Does there always exist an equivalent dfa with a single initial state?
Define a dfa with multiple initial states in an analogous way to the corresponding nfa in Exercise18, Section 2.2. Does there always exist an equivalent dfa with a single...
User Avatar
0 votes
0 answers
5185
Peter Linz Edition 4 Exercise 2.3 Question 5 (Page No. 62)
Is it true that for any nfa $M = (Q,Σ,δ,q_0,F)$ the complement of $L(M)$ is equal to the set {$w ∈ Σ^*: δ^*(q_0,w) $ $\cap$ $F= Ø$}? If so, prove it. If not, give a counterexample.
Is it true that for any nfa $M = (Q,Σ,δ,q_0,F)$ the complement of $L(M)$ is equal to the set{$w ∈ Σ^*: δ^*(q_0,w) $ $\cap$ $F= Ø$}? If so, prove it. If not, give a...
User Avatar
0 votes
0 answers
5188
SQL practice questions
From where practice SQL query questions of GATE level , apart from previous year questions.
From where practice SQL query questions of GATE level , apart from previous year questions.
User Avatar
0 votes
0 answers
5189
self doubt
For multiplication method in hashing the formula is h(k)=m* (KA mod 1); m=2^p, k=key , 0<A<1 My question is how does it actually works. Please explain in a detailed way.
For multiplication method in hashing the formula is h(k)=m* (KA mod 1);m=2^p, k=key , 0<A<1My question is how does it actually works.Please explain in a detailed way.
User Avatar
0 votes
0 answers
5190
Compiler Design SDT Doubt
What is the SDT to eliminate redundant parenthesis from infix expressions with * and +? what is the concept behind removal of redundant parenthesis and how to start?
What is the SDT to eliminate redundant parenthesis from infix expressions with * and +? what is the concept behind removal of redundant parenthesis and how to start?
User Avatar
Page: