Recent questions

0 votes

0 answers

1

Made Easy Test Series: TOC
The pushdown automata $M=\left \{ \left ( q_{0},q_{1},q_{2} \right ),\left ( a,b \right ) ,\left ( 0,1 \right ),\partial ,q_{0},0,\left \{ q_{0} \right \}\right \}$ $\partial \left ( q_{0},a,0 \right )=\left ( q_{1},10 \right )$ ... $q_{0}$ As last transition going from $q_{2}$ to $q_{0}$ and not $q_{0}$ to $q_{2}$ Am I right?

asked 1 hour ago in Theory of Computation by srestha Veteran (111k points) | 3 views

0 votes

1 answer

2

#DBMS #Alternate-Key #self-doubt
Can attributes of alternate keys be prime attributes? since alternate keys can qualify for candidate key hence attributes of alternate keys can become prime attribute??

asked 1 hour ago in Databases by debasree88 (85 points) | 10 views

+1 vote

0 answers

3

FAQ-7
Is it ok to drop for 2nd time for GATE ? i.e. dropping for giving GATE 3rd time in a row ? Please give your opinions.

asked 6 hours ago in GATE by Satbir Loyal (6k points) | 54 views

0 votes

1 answer

4

Rosen 7e Exercise-9.5 Question no-9 page no-615
Suppose that $A$ is a nonempty set, and $f$ is a function that has $A$ as its domain. Let $R$ be the relation on $A$ consisting of all ordered pairs $(x, y)$ such that $f (x)=f (y)$ $a)$ Show that $R$ is an equivalence relation on $A$ $b)$ What are the equivalence classes of $R?$

asked 7 hours ago in Set Theory & Algebra by aditi19 Active (2.9k points) | 11 views

0 votes

0 answers

5

Pgee 2013 exam
If you had three locks and three keys, how many trials do you need to see if the key works in the lock? Is the answer 6?

asked 7 hours ago in Numerical Ability by Dipanshu Rana (383 points) | 11 views

0 votes

0 answers

6

Pgee mock exam

asked 7 hours ago in Computer Networks by Dipanshu Rana (383 points) | 14 views

0 votes

1 answer

7

Made Easy Test Series:TOC-DFA
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$

asked 9 hours ago in Theory of Computation by srestha Veteran (111k points) | 19 views

0 votes

1 answer

8

IIIT H 2018
Assume that an integer and a pointer each takes 4 bytes. Also assume there is no alignment in objects. Predict the output #include <iostream> using namespace std; class Test{ static int x; int *ptr; int y; }; int main() { // your code goes here Test t; int a; cout<<sizeof(t)<<"\n"; cout<<sizeof(Test *); return 0; }

asked 14 hours ago in Programming by N (255 points) | 23 views

+4 votes

1 answer

9

FAQ-5
How to attempt Gate exam ?

asked 1 day ago in GATE by Abhishek Shaw Active (1.1k points) | 106 views

+5 votes

1 answer

10

FAQ-4
What is the ideal expected month of completion of preparation and how to revise after completion of syllabus ?

asked 1 day ago in GATE by Abhishek Shaw Active (1.1k points) | 138 views

+3 votes

0 answers

11

FAQ-3
How to utilize GO Book to get maximum benfit ?

asked 1 day ago in GATE by Abhishek Shaw Active (1.1k points) | 58 views

+3 votes

0 answers

12

FAQ-2
How important is solving previous year ? Till what year should one solve ?

asked 1 day ago in GATE by Abhishek Shaw Active (1.1k points) | 36 views

+2 votes

1 answer

13

FAQ-1
How important is test series and what is the expected number of full length test should one give before final gate exam ?

asked 1 day ago in GATE by Abhishek Shaw Active (1.1k points) | 94 views

+1 vote

1 answer

14

Pgee 2013
You have a box containing 10 black and 10 blue socks.What is the minimum number of times you need to pull out so that you have a pair of the same color?

asked 1 day ago in Combinatory by Winner (249 points) | 28 views

0 votes

0 answers

15

Self-Doubt(P-NP class)
$1)$ If the complement of NP-Complete problem is in NP, then can we also say , for this case complement of NP problem is in NP-Complete ? $2)$ If the complement of NP-Complete problem is in Co-NP, then can we also say, for this case complement of Co-NP problem is in NP-Complete?

asked 1 day ago in Theory of Computation by srestha Veteran (111k points) | 41 views

0 votes

0 answers

16

Michael Sipser Edition 3 Exercise 1 Question 30 (Page No. 88)
Describe the error in the following $ $proof$"$ that $0^{*}1^{*}$ is not a regular language. $($An error must exist because $0^{*}1^{*}$ is regular.$)$ The proof is by contradiction. Assume that $0^{*}1^{*}$ is regular ... example $1.73$ shows that $s$ cannot be pumped. Thus you have a contradiction. So $0^{*}1^{*}$ is not regular.

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 20 views

0 votes

1 answer

17

Michael Sipser Edition 3 Exercise 1 Question 29 (Page No. 88)
Use the pumping lemma to show that the following languages are not regular. $A_{1}=\{0^{n}1^{n}2^{n}|n\geq 0\}$ $A_{2}=\{www|w\in\{a,b\}^{*}\}$ $A_{3}=\{a^{{2}^{n}}|n\geq 0\}$ $\text{(Here,}$\text{$a^{{2}^{n}}$}$ $\text{means a strings of $2^{n}$ a's.)}$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 14 views

0 votes

0 answers

18

Made Easy Test Series:DS
I want longest path from root to leaf. Then which code is correct among Code-1 or Code-2? Code-1) int tree(Struct node *root){ int a=0, b=0,c=0; if(root==NULL) return 0; if((root->left==NULL)&&(root->right==NULL)) return 1; a=1+tree(root- ... )&&(root->right==NULL)) return 1; a=tree(root->left); b=tree(root->right); c=1+max(a,b); return c; }

asked 2 days ago in DS by srestha Veteran (111k points) | 23 views

0 votes

0 answers

19

Michael Sipser Edition 3 Exercise 1 Question 28 (Page No. 88)
Convert the following regular expressions to $NFA's$ using the procedure given in Theorem $1.54.$ In all parts, $Σ = \{a, b\}.$ $a(abb)^{*}\cup b$ $a^{+}\cup (ab)^{+}$ $(a\cup b^{+})a^{+}b^{+}$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 5 views

0 votes

0 answers

20

Michael Sipser Edition 3 Exercise 1 Question 27 (Page No. 88)
Read the informal definition of the finite state transducer given in question $24.$ Give the state diagram of an $FST$ with the following behavior. Its input and output alphabets are $\{0,1\}.$ Its output string is ... the even positions but inverted on the odd positions. For example, on input $0000111$ it should output $1010010.$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 3 views

0 votes

0 answers

21

Michael Sipser Edition 3 Exercise 1 Question 26 (Page No. 87)
Using the solution you gave to question $25,$ give a formal description of the machines $T_{1}$ and $T_{2}$ depicted in question $24.$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 2 views

0 votes

0 answers

22

Michael Sipser Edition 3 Exercise 1 Question 25 (Page No. 87)
Read the informal definition of the finite state transducer given in question $24.$ Give a formal definition of this model, following the pattern in Definition $1.5$ $\text{(page 35).}$ Assume that an $FST$ has an input alphabet $Σ$ and an output ... $(Hint:$ An $FST$ is a $5$-tuple. Its transition function is of the form $δ : Q Σ→Q Γ.)$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 3 views

0 votes

0 answers

23

Michael Sipser Edition 3 Exercise 1 Question 24 (Page No. 87)
A $\text{finite state transducer (FST)}$ is a type of deterministic finite automaton whose output is a string and not just accept or reject. The following are state diagrams of finite state transducers $T1$ and $T2.$ Each transition of an $FST$ is labeled ... $\text{$T_{2}$ on input bbbbbb}$ h. $\text{$T_{2}$ on input $\epsilon$}$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 2 views

0 votes

0 answers

24

Decidability and Undecidability
From where to learn the decidability and Undecidability concept for gate? So that I can grasp the full concept of that topic crystal clear..(please suggest me except Shai Simonson..I had already watch that video but i could'nt clear my concepts from there) i am facing real difficulty on that topic

asked 2 days ago in Theory of Computation by Ritabrata Dey (37 points) | 9 views

0 votes

0 answers

25

Michael Sipser Edition 3 Exercise 1 Question 23 (Page No. 87)
Let $B$ be any language over the alphabet $Σ.$ Prove that $B = B^{+}$ iff $BB ⊆ B.$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 3 views

0 votes

0 answers

26

Michael Sipser Edition 3 Exercise 1 Question 22 (Page No. 87)
In certain programming languages, comments appear between delimiters such as $\text{/#}$ and $\text{#/}.$ Let $C$ be the language of all valid delimited comment strings. A member of $C$ must begin with $\text{/#}$ ... $DFA$ that recognizes $C.$ b. Give a regular expression that generates $C.$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 5 views

0 votes

0 answers

27

Michael Sipser Edition 3 Exercise 1 Question 21 (Page No. 86)
Use the procedure described in $\text{Lemma 1.60}$ to convert the following finite automata to regular expressions.

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 4 views

0 votes

0 answers

28

Michael Sipser Edition 3 Exercise 1 Question 20 (Page No. 86)
For each of the following languages, give two strings that are members and two strings that are not members-a total of four strings for each part. Assume the alphabet $Σ = \{a,b\}$ in all parts. $a^{*}b^{*}$ $a(ba)^{*}b$ $a^{*}\cup b^{*}$ ... $aba\cup bab$ $(\epsilon\cup a)b$ $(a\cup ba\cup bb)\sum^{*}$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 4 views

0 votes

0 answers

29

Michael Sipser Edition 3 Exercise 1 Question 19 (Page No. 86)
Use the procedure described in $\text{Lemma 1.55}$ to convert the following regular expressions to non-deterministic finite automata. $(0\cup 1)^{*}000(0\cup 1)^{*}$ $(((00)^{*}(11))\cup 01)^{*}$ $\phi^{*}$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 5 views

0 votes

0 answers

30

Michael Sipser Edition 3 Exercise 1 Question 18 (Page No. 86)
Give regular expressions generating the languages of the alphabet is $\{0,1\}.$ $\text{\{w| w begins with a 1 and ends with a 0\}}$ $\text{\{w| w contains at least three 1s\}}$ ... $\text{The empty set}$ $\text{All strings except the empty string}$

asked 2 days ago in Theory of Computation by Lakshman Patel RJIT Boss (34.5k points) | 6 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent Posts

Recent Blog Comments