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
Filter
User Harshada
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Harshada
5
answers
1
GATE CSE 2016 Set 1 | Question: 23
A database of research articles in a journal uses the following schema. $\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$ The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$ and the following functional dependencies exist in the ... database satisfies, but the old one does not? $\text{1NF}$ $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$
commented
in
Databases
Jan 31, 2019
16.4k
views
gatecse-2016-set1
databases
database-normalization
normal
2
answers
2
GATE CSE 1990 | Question: 15a
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$
commented
in
Theory of Computation
Jan 14, 2019
3.2k
views
gate1990
descriptive
theory-of-computation
regular-language
regular-grammar
9
answers
3
GATE CSE 2003 | Question: 40
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-degree of $G$ cannot be $3$ $4$ $5$ $6$
commented
in
Graph Theory
Jan 14, 2019
15.6k
views
gatecse-2003
graph-theory
normal
degree-of-graph
3
answers
4
GATE CSE 2014 Set 3 | Question: 30
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation. employee (empId, ... is greater than that of some dependent. all dependents. some of his/her dependents. all of his/her dependents.
commented
in
Databases
Jan 10, 2019
13.6k
views
gatecse-2014-set3
databases
relational-algebra
normal
3
answers
5
GATE CSE 2000 | Question: 1.23, ISRO2016-57
Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations ... whose name is the same as their department name The sum of all employees' salaries All employees of a given department
commented
in
Databases
Jan 10, 2019
14.8k
views
gatecse-2000
databases
relational-algebra
easy
isro2016
1
answer
6
GATE CSE 1998 | Question: 1.33
Given two union compatible relations $R_1(A, B)$ and $R_2 (C, D)$, what is the result of the operation $R_1 \Join_{ A = C \wedge B = D} R_2$? $R_1 \cup R_2$ $R_1 \times R_2$ $R_1 – R_2$ $R_1 \cap R_2$
commented
in
Databases
Jan 10, 2019
7.2k
views
gate1998
normal
relational-algebra
4
answers
7
GATE CSE 2008 | Question: 49
Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ ...
commented
in
Theory of Computation
Jan 10, 2019
14.6k
views
gatecse-2008
normal
theory-of-computation
finite-automata
11
answers
8
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
commented
in
Theory of Computation
Jan 10, 2019
12.6k
views
gatecse-2008
theory-of-computation
finite-automata
normal
6
answers
9
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
commented
in
Databases
Jan 8, 2019
26.4k
views
gatecse-2008
databases
er-diagram
normal
4
answers
10
GATE CSE 2013 | Question: 7
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
commented
in
DS
Jan 7, 2019
12.2k
views
gatecse-2013
data-structures
easy
binary-search-tree
7
answers
11
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
commented
in
DS
Jan 7, 2019
13.4k
views
gateit-2005
data-structures
normal
binary-search-tree
4
answers
12
GATE CSE 2003 | Question: 63, ISRO2009-25
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
commented
in
DS
Jan 7, 2019
20.2k
views
gatecse-2003
data-structures
easy
isro2009
binary-search-tree
2
answers
13
GATE IT 2005 | Question: 54
The following C function takes a singly-linked list of integers as a parameter and rearranges the elements of the list. The list is represented as pointer to a structure. The function is called with the list containing the integers $1, 2, 3, 4, 5, 6, 7$ in the given order. What will be the contents of ... $1, 3, 2, 5, 4, 7, 6$ $2, 3, 4, 5, 6, 7, 1$
commented
in
DS
Jan 6, 2019
7.9k
views
gateit-2005
data-structures
linked-list
normal
8
answers
14
GATE CSE 2004 | Question: 36
A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\text{enQueue}$ and $\text{deQueue}$ can be performed in constant time? rear node front node not possible with a single pointer node next to front
commented
in
DS
Jan 6, 2019
30.9k
views
gatecse-2004
data-structures
linked-list
normal
5
answers
15
GATE CSE 2004 | Question: 50
The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies: name, courseNo, $\rightarrow$ grade rollNo, courseNo $\rightarrow$ grade name $\rightarrow$ rollNo rollNo $\rightarrow$ name The highest normal form of this relation scheme is $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$ $\text{4NF}$
commented
in
Databases
Jan 6, 2019
17.7k
views
gatecse-2004
databases
database-normalization
normal
6
answers
16
GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$
commented
in
Databases
Jan 6, 2019
17.5k
views
gateit-2004
databases
database-normalization
normal
6
answers
17
GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
commented
in
Databases
Jan 6, 2019
51.6k
views
gatecse-2001
databases
database-normalization
normal
9
answers
18
GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?
commented
in
Theory of Computation
Jan 4, 2019
13.6k
views
gate1991
theory-of-computation
finite-automata
normal
descriptive
5
answers
19
GATE CSE 1997 | Question: 1.4
The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used? Singly linked list Doubly linked list Circular doubly linked list Array implementation of list
commented
in
DS
Jan 2, 2019
19.4k
views
gate1997
data-structures
linked-list
easy
4
answers
20
GATE CSE 2007 | Question: 68, ISRO2016-73
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$
commented
in
Computer Networks
Jan 1, 2019
33.8k
views
gatecse-2007
computer-networks
error-detection
crc-polynomial
normal
isro2016
8
answers
21
GATE IT 2008 | Question: 28
Consider the following Hasse diagrams. Which all of the above represent a lattice? (i) and (iv) only (ii) and (iii) only (iii) only (i), (ii) and (iv) only
commented
in
Set Theory & Algebra
Dec 27, 2018
15.0k
views
gateit-2008
set-theory&algebra
lattice
normal
4
answers
22
GATE CSE 2005 | Question: 9
The following is the Hasse diagram of the poset $\left[\{a,b,c,d,e\},≺\right]$ The poset is : not a lattice a lattice but not a distributive lattice a distributive lattice but not a Boolean algebra a Boolean algebra
commented
in
Set Theory & Algebra
Dec 27, 2018
9.1k
views
gatecse-2005
set-theory&algebra
lattice
normal
7
answers
23
GATE CSE 1995 | Question: 2.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
commented
in
DS
Dec 25, 2018
38.2k
views
gate1995
data-structures
stack
easy
7
answers
24
GATE CSE 1998 | Question: 1.12
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$
commented
in
Theory of Computation
Dec 24, 2018
23.0k
views
gate1998
theory-of-computation
regular-expression
easy
multiple-selects
6
answers
25
GATE CSE 1991 | Question: 03,xiii
Let $r=1(1+0)^*, s=11^*0 \text{ and } t=1^*0 $ be three regular expressions. Which one of the following is true? $L(s) \subseteq L(r)$ and $L(s) \subseteq L(t)$ $L(r) \subseteq L(s)$ and $L(s) \subseteq L(t)$ $L(s) \subseteq L(t)$ and $L(s) \subseteq L(r)$ $L(t) \subseteq L(s)$ and $L(s) \subseteq L(r)$ None of the above
commented
in
Theory of Computation
Dec 24, 2018
11.5k
views
gate1991
theory-of-computation
regular-expression
normal
multiple-selects
6
answers
26
GATE CSE 2004 | Question: 24
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ ... $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$
commented
in
Set Theory & Algebra
Dec 18, 2018
9.8k
views
gatecse-2004
set-theory&algebra
easy
relations
4
answers
27
GATE CSE 2001 | Question: 1.2
Consider the following relations: $R_1\:(a,b)$ iff $(a+b)$ is even over the set of integers $R_2 \:(a,b)$ iff $(a+b)$ is odd over the set of integers $R_3 \:(a,b)$ iff $a.b > 0$ ... $R_4$ are not $R_1$ and $R_4$ are equivalence relations, $R_2$ and $R_3$ are not $R_1, R_2, R_3$ and $R_4$ all are equivalence relations
commented
in
Set Theory & Algebra
Dec 18, 2018
6.1k
views
gatecse-2001
set-theory&algebra
normal
relations
3
answers
28
GATE CSE 1994 | Question: 2.3
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
commented
in
Set Theory & Algebra
Dec 18, 2018
5.1k
views
gate1994
set-theory&algebra
normal
relations
fill-in-the-blanks
10
answers
29
GATE CSE 2014 Set 3 | Question: 28
An $IP$ router with a $\text{Maximum Transmission Unit (MTU)}$ of $1500$ bytes has received an $IP$ packet of size $4404\text{ bytes}$ with an $IP$ header of length $20\text{ bytes}$. The values of the relevant fields in the header of the third $IP$ ... $1,$ Datagram Length$: 1500;$ Offset$: 370$ $\text{MF bit}$: $0,$ Datagram Length$: 1424;$ Offset$: 2960$
commented
in
Computer Networks
Dec 9, 2018
21.2k
views
gatecse-2014-set3
computer-networks
ip-packet
normal
4
answers
30
GATE CSE 2009 | Question: 1
Which one of the following is NOT necessarily a property of a Group? Commutativity Associativity Existence of inverse for every element Existence of identity
commented
in
Set Theory & Algebra
Dec 8, 2018
8.1k
views
gatecse-2009
set-theory&algebra
easy
group-theory
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:...