Recent questions without an upvoted answer / GATE Overflow for GATE CSE

0 votes

0 answers

8521

DBMS Korth Edition 6 Exercise 6 Question 17 (Page No. 254)
Let R = (A, B) and S = (A, C), and let r (R) and s(S) be relations. Write SQL Queries equivalent to the following domain relational- calculus expressions: a. {< a > | $\exists b (< a, b > \epsilon¸r \wedge b$ = 17)} b. ... ))}

Let R = (A, B) and S = (A, C), and let r (R) and s(S) be relations.Write SQL Queries equivalent to the following domain relational-calculus expressions:a. {< a | $\exist...

ajaysoni1924

578 views

ajaysoni1924 asked Mar 30, 2019

0 votes

0 answers

8522

DBMS Korth Edition 6 Exercise 7 Question 25 (Page No. 321)
Consider the relation schemas are shown below, which were generated from the E-R diagram in Figure given below. For each schema, specify what foreign key constraints, if any, should be created. teaches (ID, course id, sec id, semester, ... room number) inst dept (ID, dept name) stud dept (ID, dept name) course dept (course id, dept name)

Consider the relation schemas are shown below, which were generatedfrom the E-R diagram in Figure given below. For each schema, specify what foreign keyconstraints, if an...

ajaysoni1924

1.2k views

ajaysoni1924 asked Mar 30, 2019

0 votes

0 answers

8523

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?

Saideepak Bejawada

546 views

Saideepak Bejawada asked Mar 30, 2019

0 votes

0 answers

8524

Peter Linz Edition 5 Exercise 10.2 Question 10 (Page No. 264)
Write out a detailed program for the computation in considering the language $\{a^nb^n\}$. We described a laborious method by which this language can be accepted by a Turing machine with one tape. Using a two-tape machine makes the ... an equal number of $a's$ and $b's$ without repeated back-and-forth movement of the read-write head.

Write out a detailed program for the computation in considering the language $\{a^nb^n\}$. We described a laborious method by which this language can be accepted by a Tur...

Rishi yadav

210 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8525

Peter Linz Edition 5 Exercise 10.2 Question 6,7 (Page No. 264)
Exercise 6: Show that for every Turing machine there exists an equivalent standard Turing machine with no more than six states. Exercise 7: Reduce the number of required states in Exercise 6 above as far as you can (Hint: The smallest possible number is three)

Exercise 6: Show that for every Turing machine there exists an equivalent standard Turing machine with no more than six states.Exercise 7: Reduce the number of required s...

Rishi yadav

218 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8526

Peter Linz Edition 5 Exercise 10.2 Question 5 (Page No. 264)
A $\text{queue automaton}$ is an automaton in which the temporary storage is a queue. Assume that such a machine is an online machine, that is, it has no input file, with the string to be processed placed in ... of the computation. Give a formal definition of such an automaton, then investigate its power in relation to Turing machines.

A $\text{queue automaton}$ is an automaton in which the temporary storage is a queue. Assume that such a machine is an online machine, that is, it has no input file, with...

Rishi yadav

228 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8527

Peter Linz Edition 5 Exercise 10.2 Question 2 (Page No. 264)
A multihead Turing machine can be visualized as a Turing machine with a single tape and single control unit but with multiple, independent read-write heads. Give a formal definition of a multihead Turing machine, and then show how much a machine can be simulated with a standard Turing machine.

A multihead Turing machine can be visualized as a Turing machine with a single tape and single control unit but with multiple, independent read-write heads. Give a formal...

Rishi yadav

222 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8528

Peter Linz Edition 5 Exercise 10.2 Question 1 (Page No. 264)
Define what one might call a multitape off-line Turing machine and describe how it can be simulated by a standard Turing machine.

Define what one might call a multitape off-line Turing machine and describe how it can be simulated by a standard Turing machine.

Rishi yadav

195 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8529

Peter Linz Edition 5 Exercise 11.4 Question 3 (Page No. 298)
Find two examples of languages that are deterministic context-free but not linear.

Find two examples of languages that are deterministic context-free but not linear.

Rishi yadav

137 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8530

Peter Linz Edition 5 Exercise 11.4 Question 2 (Page No. 298)
Find two examples of languages that are linear but not deterministic context-free.

Find two examples of languages that are linear but not deterministic context-free.

Rishi yadav

132 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8531

Peter Linz Edition 5 Exercise 11.4 Question 1 (Page No. 298)
Given examples that demonstrate that all the subset relations depicted in the figure are indeed proper ones.

Given examples that demonstrate that all the subset relations depicted in the figure are indeed proper ones.

Rishi yadav

159 views

Rishi yadav asked Mar 30, 2019

0 votes

0 answers

8532

self doubt
A directed acyclic graph has no connected components. TRUE OR FALSE???

A directed acyclic graph has no connected components.TRUE OR FALSE???

Doraemon

256 views

Doraemon asked Mar 30, 2019

0 votes

0 answers

8533

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...

Naveen Kumar 3

311 views

Naveen Kumar 3 asked Mar 30, 2019

0 votes

0 answers

8534

Peter Linz Edition 4 Exercise 2.3 Question 6 (Page No. 62)
Is it true that for every nfa $M = (Q,Σ,δ,q_0,F)$ the complement of $L(M)$ is equal to the set {$w ∈ Σ^*: δ^*(q_0,w) $ $\cap$ $(Q-F)$ $\neq$ $Ø$}? If so, prove it. If not, give a counterexample.

Is it true that for every nfa $M = (Q,Σ,δ,q_0,F)$ the complement of $L(M)$ is equal to the set{$w ∈ Σ^*: δ^*(q_0,w) $ $\cap$ $(Q-F)$ $\neq$ $Ø$}? If so, prove it. ...

Naveen Kumar 3

229 views

Naveen Kumar 3 asked Mar 30, 2019

0 votes

0 answers

8535

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...

Naveen Kumar 3

218 views

Naveen Kumar 3 asked Mar 30, 2019

0 votes

0 answers

8536

Peter Linz Edition 4 Exercise 2.3 Question 4 (Page No. 62)
Theorem: Let $L$ be the language accepted by a nondeterministic finite accepter $M_N=(Q_N,Σ,δ_N,q_0,F_N)$. Then there exists a deterministic finite accepter $M_D=(Q_D,Σ,δ_D,${$q_0$}$,F_D)$ such that $L=L(M_D)$. Prove this Theorem. Show in ... the label of $\delta ^*_D(q_0,w)$ contains $q_f$, then $\delta ^*_N(q_0,w)$ also contains $q_f$.

Theorem: Let $L$ be the language accepted by a nondeterministic finite accepter $M_N=(Q_N,Σ,δ_N,q_0,F_N)$. Then there exists a deterministic finite accepter $M_D=(Q_D,�...

Naveen Kumar 3

152 views

Naveen Kumar 3 asked Mar 30, 2019

1 votes

0 answers

8537

Peter Linz Edition 4 Exercise 2.3 Question 3 (Page No. 62)
Convert the following nfa into an equivalent dfa.

Convert the following nfa into an equivalent dfa.

Naveen Kumar 3

979 views

Naveen Kumar 3 asked Mar 30, 2019

0 votes

1 answer

8538

Peter Linz Edition 4 Exercise 2.3 Question 2 (Page No. 62)
Convert the nfa in following figure, into an equivalent dfa.

Convert the nfa in following figure, into an equivalent dfa.

Naveen Kumar 3

638 views

Naveen Kumar 3 asked Mar 30, 2019

0 votes

1 answer

8539

#Foruzan Chapter: Network Layer
An IPv4 packet has arrived with the first few hexadecimal digits as shown. Ox45000028000100000102 ... How many hops can this packet travel before being dropped? The data belong to what upper-layer protocol? Solution To find the time-to-live field, we skip ... the next byte (02), which means that the upper-layer protocol is IGMP Why to skip 8 bytes????Please Explain

An IPv4 packet has arrived with the first few hexadecimal digits as shown.Ox45000028000100000102 ...How many hops can this packet travel before being dropped? The data be...

Nishi Agarwal

2.0k views

Nishi Agarwal asked Mar 30, 2019

0 votes

2 answers

8540

Self Doubt
Q. Multithreaded programs are : A) lesser prone to deadlocks B) more prone to deadlocks C) not at all prone to deadlocks D) none of the mentioned I think can we gives ans like that? threads that are user level, if one of the thread is going be in ... process belonging to that thread is going to blocked (because user level threads are unaware by OS) so can we say optionB) is correct ?

Q. Multithreaded programs are :A) lesser prone to deadlocksB) more prone to deadlocks C) not at all prone to deadlocksD) none of the mentioned I think can we gives ans l...

Aks9639

732 views

Aks9639 asked Mar 30, 2019

0 votes

0 answers

8541

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.

Sandy Sharma

1.1k views

Sandy Sharma asked Mar 29, 2019

0 votes

0 answers

8542

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.

Doraemon

337 views

Doraemon asked Mar 29, 2019

0 votes

0 answers

8543

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?

aditi19

479 views

aditi19 asked Mar 29, 2019

1 votes

2 answers

8544

c functions
#include <stdio.h> void demo() { printf("GeeksQuiz "); } int main() { demo(); return 0; } ****************************************************************************** #include <stdio.h> int main() { demo(); return 0; } void demo() { printf("GeeksQuiz "); } will both program same result?

#include <stdio.h void demo() { printf("GeeksQuiz "); } int main() { demo(); return 0; } #include <stdio.h int main() { demo(); re...

hitendra singh

822 views

hitendra singh asked Mar 29, 2019

0 votes

0 answers

8545

Ullman(2e) Exercise-5.4.2 page no-336 Syntax Directed Translation
Rewrite the following SDT: A->A {a} B | AB {b} | 0 B->B {c} A | BA {d} | 1 so that the underlying grammar becomes non-left-recursive. Here a, b, c and d are actions, and 0 and 1 are terminals is my solution correct? A→ 0A’ A’→ {a} BA’ | B {b} A’ | ε B→ 1B’ B’→ {c} AB’ | A {d} B’ | ε

Rewrite the following SDT:A->A {a} B | AB {b} | 0B->B {c} A | BA {d} | 1so that the underlying grammar becomes non-left-recursive. Here a, b, c and d are actions, and 0 a...

aditi19

1.3k views

aditi19 asked Mar 29, 2019

1 votes

0 answers

8546

dbms ace test series
SQL view is said to be updatable (that is, inserts, updates or deletes can be applied on the view) if which of the following conditions are satisfied by the query defining the view? 1. The select clause contains only attribute names of the relation, and ... clause has only one database relation. 3. The query does not have a group by or having clause. 4. All of the mentioned

SQL view is said to be updatable (that is, inserts, updates or deletes can be applied on the view) if which of the following conditions are satisfied by the query definin...

Priyansh Singh

335 views

Priyansh Singh asked Mar 29, 2019

1 votes

1 answer

8547

Ace Test Series: Databases-Sql Query
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id) You want to display the last names and hire dates of all latest hires in their ... pairwise comparison. $3.$It executes but does not give the correct result. $4.$It executes and gives the correct result.

Given the following schema:employees(emp-id, first-name, last-name, hire-date, dept-id, salary)departments(dept-id, dept-name, manager-id, location-id)You want to display...

Priyansh Singh

704 views

Priyansh Singh asked Mar 29, 2019

1 votes

0 answers

8548

Digital Flip Flop
Just before the flip flops of the counter are cleared (that is when the counter is in the last used state) the flip flop outputs Q0 , Q1 and Q2 are made to pass through a full adder and the output of FULL ADDER is given to JK FLIP FLOP i.e, SUM to J and CARRY to K input of the JK F.F. The JK F.F enters into the : a.HOLD STATE b.SET STATE c.RESET STATE d.TOGGLE STATE.

Just before the flip flops of the counter are cleared (that is when the counter is in the last used state) the flip flop outputs Q0 , Q1 and Q2 are made to pass through a...

Piyush ####

657 views

Piyush #### asked Mar 28, 2019

0 votes

1 answer

8549

Made Easy Workbook
The initial state of MOD-20 counter is 10101. Counter Design is in such a way that output of the logic gate(AND) is connected with PRESET of all the 5 FFs and FFs are triggered with -ve edge and clock connection is with complement of the FF output (Q). After 44 clock pulses the state of the counter will be?

The initial state of MOD-20 counter is 10101. Counter Design is in such a way that output of the logic gate(AND) is connected with PRESET of all the 5 FFs and FFs are tri...

Piyush ####

1.1k views

Piyush #### asked Mar 28, 2019

0 votes

1 answer

8550

DBMS Korth Edition 6 Exercise 7 Question 28 (Page No. 321)
Explain the distinction between disjoint and overlapping constraints.

Explain the distinction between disjoint and overlapping constraints.

ajaysoni1924

854 views

ajaysoni1924 asked Mar 28, 2019

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