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
Recent questions tagged gatecse-2017-set2
47
votes
9
answers
61
GATE CSE 2017 Set 2 | Question: 25
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left | w_{1} \right | = 2, \left | w_{2} \right |\geq 3$} is ______________ .
Madhav
asked
in
Theory of Computation
Feb 14, 2017
by
Madhav
16.5k
views
theory-of-computation
gatecse-2017-set2
finite-automata
numerical-answers
minimal-state-automata
62
votes
3
answers
62
GATE CSE 2017 Set 2 | Question: 17
An ER model of a database consists of entity types $A$ and $B$. These are connected by a relationship $R$ which does not have its own attribute. Under which one of the following conditions, can the relational table for R be merged with that of A? Relationship ... of $A$ in $R$ is total Relationship $R$ is many-to-one and the participation of $A$ in $R$ is partial
Madhav
asked
in
Databases
Feb 14, 2017
by
Madhav
22.3k
views
gatecse-2017-set2
databases
er-diagram
normal
25
votes
7
answers
63
GATE CSE 2017 Set 2 | Question: 03
Match the algorithms with their time complexities: ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
khushtak
asked
in
Algorithms
Feb 14, 2017
by
khushtak
6.8k
views
gatecse-2017-set2
algorithms
time-complexity
match-the-following
easy
57
votes
10
answers
64
GATE CSE 2017 Set 2 | Question: 11
Let $p, q, r$ ... $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$
khushtak
asked
in
Mathematical Logic
Feb 14, 2017
by
khushtak
12.1k
views
gatecse-2017-set2
mathematical-logic
propositional-logic
41
votes
6
answers
65
GATE CSE 2017 Set 2 | Question: 04
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT? $L_1 \cup L_2$ is context-free $\overline{L_1}$ is context-free $L_1 - R$ is context-free $L_1 \cap L_2$ is context-free I, II and IV only I and III only II and IV only I only
khushtak
asked
in
Theory of Computation
Feb 14, 2017
by
khushtak
11.6k
views
gatecse-2017-set2
theory-of-computation
closure-property
Page:
« prev
1
2
3
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 questions tagged gatecse-2017-set2
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:...