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 aditi19
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by aditi19
0
votes
0
answers
21
Natural Join Self Doubt
how to write the query for natural join on three relations in SQL using the NATURAL JOIN clause?
asked
in
Databases
May 8, 2019
827
views
natural-join
databases
sql
1
vote
2
answers
22
Raghuramkrishnan Exercise-4.3 question 11 page no-127 Relational Algebra
Suppliers(sid, sname, address) Parts(pid, pname, color) Catalog(sid, pid, cost) Find the pids of the most expensive parts supplied by suppliers named Yosemite Sham
asked
in
Databases
May 8, 2019
1.3k
views
databases
relations
relational-algebra
relational-calculus
joins
0
votes
1
answer
23
Combination doubt
A shipping clerk has to weigh 10 distinct packets. He weighs them four at a time, weighing all the possible combinations of the packets from the ten. The average weight of all the weighing combination is found to be 800 gm. What is the combined weight of all the size packets?
asked
in
Quantitative Aptitude
May 7, 2019
1.9k
views
gate2016-ec-3
combinational-circuit
0
votes
1
answer
24
Raghuramkrishnan Exercise-4.3 page-127
Given relation catalog(sid, pid, cost) Find pairs of sids such that the supplier with the first sid charges more for some part than the supplier with the second sid what is the relational algebra expression for this?
asked
in
Databases
May 7, 2019
928
views
databases
relational-calculus
relations
relational-algebra
joins
0
votes
1
answer
25
Molina Exercise-6.2.2 page-267 SQL
Product(maker, model, type) PC(model, speed, ram, hd, price) Laptop(model, speed, ram, hd, screen, price) Find those manufacturers of at least two different computers (PC's or laptops) with speeds of at least 3.0 is my query ... AND count(distinct model)>=2 UNION select maker from Product NATURAL JOIN Laptop where speed>=3 AND count(distinct model)>=2
asked
in
Databases
May 7, 2019
1.7k
views
databases
sql
natural-join
joins
ullman
0
votes
1
answer
26
Rosen 7e Recurrence Relation Exercise-8.1 Question no-25 page no-511
How many bit sequences of length seven contain an even number of 0s? I'm trying to solve this using recurrence relation Is my approach correct? Let T(n) be the string having even number of 0s T(1)=1 {1} T(2)=2 {00, 11} T(3)=4 {001, ... add 0 to strings of length n-1 having odd number of 0s T(n)=T(n-1) Hence, we have T(n)=2T(n-1)
asked
in
Combinatory
Apr 29, 2019
798
views
kenneth-rosen
discrete-mathematics
combinatory
recurrence-relation
0
votes
2
answers
27
Rosen 7e Exercise-8.1 Question no-10 Page no-511
Find a recurrence relation for the number of bit strings of length n that contain the string 01.
asked
in
Combinatory
Apr 28, 2019
3.1k
views
kenneth-rosen
discrete-mathematics
combinatory
recurrence-relation
0
votes
0
answers
28
POSET self doubt
What is dual of a POSET?
asked
in
Set Theory & Algebra
Apr 27, 2019
478
views
lattice
self-doubt
set-theory&algebra
relations
partial-order
0
votes
1
answer
29
Rosen 7e Exercise-9.5 Question no-9 page no-615
Suppose that $A$ is a nonempty set, and $f$ is a function that has $A$ as its domain. Let $R$ be the relation on $A$ consisting of all ordered pairs $(x, y)$ such that $f (x)=f (y)$ $a)$ Show that $R$ is an equivalence relation on $A$ $b)$ What are the equivalence classes of $R?$
asked
in
Set Theory & Algebra
Apr 23, 2019
1.3k
views
kenneth-rosen
discrete-mathematics
relations
equivalence-class
3
votes
2
answers
30
Rosen 7e Exercise-6.5 question 45.b page 433
How many ways can n books be placed on k distinguishable shelves if no two books are the same, and the positions of the books on the shelves matter?
asked
in
Combinatory
Apr 16, 2019
1.7k
views
kenneth-rosen
discrete-mathematics
combinatory
1
vote
2
answers
31
Molina Exercise-3.3 BCNF decomposition
Decompose into BCNF R(A, B, C, D, E) FD: AB->C, C->D, D>B, D->E
asked
in
Databases
Apr 14, 2019
2.0k
views
database-normalization
databases
bcnf-decomposition
bcnf
5
votes
3
answers
32
Raghuramkrishnan Exercise 4.1 Relational Algebra
Given two relations R1 and R2, where R1 contains N1 tuples, R2 contains N2 tuples, and N2>N1> 0, give the minimum and maximum possible sizes (in tuples) for the result relation produced by each of the following relational algebra expressions. In each ... $σa=5(R1)$ (selection) $\pi a(R1)$ (projection) $R1/R2$ (division)
asked
in
Databases
Apr 11, 2019
8.8k
views
databases
relational-algebra
relational-calculus
relations
0
votes
0
answers
33
Ullman(2e) Exercise-8.3.2 page no-524 Code Generation
Generate code for the following three-address statements assuming stack allocation where register SP points to the top of the stack x = 1 x=a x = a + 1 x = a+b The two statements x = b * c y = a + x
asked
in
Compiler Design
Apr 1, 2019
978
views
compiler-design
intermediate-code
target-code-generation
stack
pointers
0
votes
1
answer
34
Memory Access Doubt
How many memory accesses are there in this code? LOAD R1, a(RO)
asked
in
CO and Architecture
Apr 1, 2019
862
views
effective-memory-access
co-and-architecture
1
vote
0
answers
35
DAG doubt
How to represent array expressions using DAG? for example a=b[i]+c[j] how to represent this using DAG?
asked
in
Compiler Design
Mar 31, 2019
1.5k
views
syntax-directed-translation
compiler-design
0
votes
0
answers
36
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?
asked
in
Compiler Design
Mar 29, 2019
468
views
syntax-directed-translation
compiler-design
0
votes
0
answers
37
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’ | ε
asked
in
Compiler Design
Mar 29, 2019
1.3k
views
compiler-design
syntax-directed-translation
left-recursion
1
vote
3
answers
38
Proposition Logic-Rosen(7e)
Show that these statements are inconsistent: “If Miranda does not take a course in discrete mathematics, then she will not graduate.” “If Miranda does not graduate, then she is not qualified for the job.” “If Miranda reads this book, then she is qualified for the job.” “Miranda does not take a course in discrete mathematics but she reads this book.” how to approach?
asked
in
Mathematical Logic
Mar 26, 2019
2.6k
views
mathematical-logic
discrete-mathematics
kenneth-rosen
propositional-logic
0
votes
1
answer
39
Compiler Design LR(1) doubt
Can lookahead symbol be epsilon in LR(1) parsing? and pls give the LR(1) diagram for the following grammar? A->AB | a B->*AC | Cb | ∈ C->+ABc | ∈
asked
in
Compiler Design
Mar 25, 2019
1.1k
views
compiler-design
lr-parser
parsing
2
votes
1
answer
40
Virtual Gate Test Series: Theory Of Computation - Finite Automata
How many possible finite automata ( DFA ) are there with two states X and Y, where X is always initial state with alphabet a and b, that accepts everything? answer is 20 or 64?
asked
in
Theory of Computation
Mar 24, 2019
1.6k
views
theory-of-computation
finite-automata
virtual-gate-test-series
Page:
« prev
1
2
3
4
5
6
7
...
9
next »
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:...