Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
which of the following are false
student2018
asked
in
Databases
Jan 12, 2018
268
views
1
vote
1
vote
student2018
asked
in
Databases
Jan 12, 2018
by
student2018
268
views
answer
comment
Follow
share this
share
1 comment
by
student2018
commented
Jan 12, 2018
reply
Follow
share this
I think 2 and 3 are true
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Akriti sood
asked
in
Compiler Design
Dec 10, 2016
1,148
views
Which of the following statement/s is/are false for the following language:
Which of the following statement/s is/are false for the following language: L = {am bn cq | m = n or n = q, m > 0, n > 0, q > 0} S1: The language can be parsed by any LR(K) parsers for any value of K. S2: The language cannot be recognized by deterministic PDA. Only S2 Only S1 Both S1 and S2 Neither S1 nor S2
Akriti sood
asked
in
Compiler Design
Dec 10, 2016
by
Akriti sood
1.1k
views
theory-of-computation
compiler-design
4
votes
4
votes
1
answer
2
GateAspirant999
asked
in
Programming in C
Sep 15, 2016
2,286
views
Which of the following statements are TRUE/FALSE?
Which of the following statements are TRUE/FALSE? S1: SQL permits attributes names to be repeated in the same relation S2: The power of DRC and TRC is same as that of relational algebra S3: The project operation (pi) cometimes only distributes over join ... (D) <T,F,T> Sol. I dont understand what it is meant by S3. I feel first two are false.
GateAspirant999
asked
in
Programming in C
Sep 15, 2016
by
GateAspirant999
2.3k
views
relational-calculus
relational-algebra
sql
0
votes
0
votes
0
answers
3
Isha Gupta
asked
in
Unknown Category
Jun 15, 2016
265
views
which of the following statements about peephole optimizations is false?
Isha Gupta
asked
in
Unknown Category
Jun 15, 2016
by
Isha Gupta
265
views
0
votes
0
votes
1
answer
4
im.raj
asked
in
Theory of Computation
May 26, 2016
12,194
views
Which one of the following statement is false ?
(A) Context-free languages are closed under union. (B) Context-free languages are closed under concatenation. (C) Context-free languages are closed under intersection. (D) Context-free languages are closed under Kleene closure.
im.raj
asked
in
Theory of Computation
May 26, 2016
by
im.raj
12.2k
views
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy