GATE 2017 Previous Year Paper Solution Question 10 – Computer Science
- Categories GATE Previous Year Questions, Videos
- Date January 15, 2019
In this video the question which was asked in the exam of GATE 2017, has been discussed.
You may also like
GATE CSE 1992 | Question 13b | Relational Algebra
GATE Question (GATE CSE 1992 | Question: 13b) Suppose we have a database consisting of the following three relations: FREQUENTS(Customer, Hotel): Indicates the hotels each customer visits. SERVES(Hotel, Snack): Tells which snacks each hotel serves. LIKES(Customer, Snack): Indicates which …
This post explores the concepts of Third Normal Form (3NF) in relational databases and the types of functional dependencies that may still exist in a 3NF database. We provide a detailed discussion to help you master these crucial concepts for …
GATE CSE 1990: Finite Automata and Regular Language Analysis
GATE CSE 1990: Analyzing Finite Automata and Regular Languages Original Question GATE CSE 1990 Question 3(ii): Consider the following finite automaton: a ↗ ↘ →(q0) (q1) ↖ ↙ ↘ b a (q2) ↺ a What is the language accepted …