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 Ravi_1511
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ravi_1511
5
answers
1
GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only
commented
in
Databases
Apr 8, 2017
27.9k
views
gatecse-2008
databases
database-normalization
normal
1
answer
2
set theory
Which of the following statements about the POSET diagram given below is TRUE ? For a lattice with 8 elements to be called as boolean algebra A) It is a necessary and a sufficient condition that it should be isomorphic to above POSET diagram. B) It is necessary condition ... It is sufficient condition but not a necessary condition. Which among A),B),C) is true ..? why ? please explain ?
answered
in
Set Theory & Algebra
Mar 26, 2017
373
views
set-theory&algebra
discrete-mathematics
engineering-mathematics
set-theory
1
answer
3
group theory
"The necessary and sufficient condition for a subset of a group to be called as sub-group is it should satisfy the algebraic structure property". can somebody tell why this should be TRUE. We are concluding it as sub-group just by seeing only algebraic structure property satisfying and not checking for identity element,inverse ....why ?
answered
in
Set Theory & Algebra
Mar 26, 2017
520
views
discrete-mathematics
group-theory
set-theory&algebra
engineering-mathematics
set-theory
1
answer
4
ISRO2012-ECE Number system
If $(146)_x + (313) _{x-2} = (246)_ 8$ then the value of $x$ will be $5$ $6$ $7$ $9$
answered
in
Digital Logic
Feb 27, 2017
1.0k
views
isro-ece
isro2012-ece
digital-logic
number-representation
4
answers
5
GATE CSE 2017 Set 2 | Question: 40
Consider the following languages. $L_1 = \{a^p \mid p \text{ is a prime number} \}$ $L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$ $L_3 = \{a^n b^n c^{2n} \mid n \geq 0 \}$ ... not context free $L_3$ is not context free but recursive $L_4$ is deterministic context free I, II and IV only II and III only I and IV only III and IV only
answered
in
Theory of Computation
Feb 27, 2017
8.9k
views
gatecse-2017-set2
theory-of-computation
identify-class-language
4
answers
6
How many tuples are returned by SQL Query
Consider the following relation instance myTable num1 num2 100 100 100 NULL NULL 100 NULL NULL Query 1: SELECT * FROM myTable WHERE num1 = 100; Query 2: SELECT * FROM myTable WHERE num1 <> 100; If Query 1 returns p tuples and Query 2 returns q tuples, then 10p+q will be _____________
answered
in
Databases
Feb 8, 2017
1.8k
views
databases
sql
2
answers
7
Maximum File Size
I am getting 282. Answer given is 256..??
answered
in
Operating System
Feb 7, 2017
1.7k
views
3
answers
8
GATE CSE 2008 | Question: 28
How many of the following matrices have an eigenvalue 1? $\left[\begin{array}{cc}1 & 0 \\0 & 0 \end{array} \right]\left[\begin{array}{cc}0 & 1 \\0 & 0 \end{array} \right] \left[\begin{array}{cc}1 & -1 \\1 & 1 \end{array} \right]$ and $\left[\begin{array}{cc}-1 & 0 \\1 & -1 \end{array} \right]$ one two three four
commented
in
Linear Algebra
Feb 6, 2017
8.6k
views
gatecse-2008
eigen-value
linear-algebra
2
answers
9
GATE CSE 2016 Set 1 | Question: 12
Consider the following "C" program. void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ____________; // call to f() } Which one of the following expressions , when placed in the blank above, will NOT result in a type checking error? $f(s, *s)$ $i = f(i,s)$ $f(i, *s)$ $f(i, *p)$
commented
in
Programming in C
Feb 6, 2017
12.6k
views
gatecse-2016-set1
programming-in-c
easy
5
answers
10
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
Feb 6, 2017
16.4k
views
gatecse-2016-set1
databases
database-normalization
normal
9
answers
11
GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.
commented
in
Set Theory & Algebra
Feb 6, 2017
21.6k
views
gatecse-2016-set1
set-theory&algebra
functions
normal
numerical-answers
8
answers
12
GATE CSE 2016 Set 1 | Question: 14
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$
commented
in
Algorithms
Feb 6, 2017
22.5k
views
gatecse-2016-set1
algorithms
spanning-tree
normal
9
answers
13
GATE CSE 2016 Set 1 | Question: 33
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)
commented
in
Digital Logic
Feb 6, 2017
31.0k
views
gatecse-2016-set1
digital-logic
adder
normal
1
answer
14
Gate Practice Question
A binary min-heap contains keys 1,2,3,4.....2047,2048 What is smallest key that can be at leaf node.??
commented
in
DS
Feb 4, 2017
861
views
data-structures
binary-heap
numerical-answers
1
answer
15
Gate Practice Question
A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R can be.?
commented
in
Databases
Feb 3, 2017
614
views
candidate-key
databases
2
answers
16
Gate Practice
Q.1 VAS = 46 bit , Page size = 4KB , Page table entry = 4B ,3 level paging used ,1st level =12bits, 2nd level = 12bits,3rd level=10 bits(from right to left) Page table size for 4MB process.?? Q.2 Program size = 32MB , Page size = 1KB, VAS=46 bit ,Page table entry = 4B 3 level paging 1st = 12 bit ,2nd = 12 bit , 3rd = 10 bit Page table size.??
asked
in
Operating System
Feb 3, 2017
609
views
memory-management
6
answers
17
GATE CSE 2009 | Question: 16, ISRO2017-12
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every context-free language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
commented
in
Theory of Computation
Feb 3, 2017
15.6k
views
gatecse-2009
theory-of-computation
easy
isro2017
pushdown-automata
7
answers
18
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
answered
in
Computer Networks
Feb 3, 2017
30.1k
views
gatecse-2009
computer-networks
sliding-window
normal
18
answers
19
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
answered
in
Computer Networks
Feb 3, 2017
48.5k
views
gatecse-2009
computer-networks
sliding-window
normal
isro2016
5
answers
20
GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is the sector ... $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$
commented
in
Operating System
Feb 3, 2017
10.4k
views
gatecse-2009
operating-system
disk
normal
3
answers
21
Doubt about joins on keys
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of _______.
commented
in
Databases
Feb 2, 2017
2.3k
views
databases
relational-algebra
12
answers
22
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
answered
in
DS
Feb 2, 2017
16.2k
views
gatecse-2010
data-structures
binary-tree
normal
8
answers
23
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
answered
in
Databases
Feb 2, 2017
32.7k
views
gatecse-2010
databases
b-tree
easy
8
answers
24
GATE CSE 2010 | Question: 48
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ ... $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ nanoseconds
answered
in
CO and Architecture
Feb 2, 2017
40.8k
views
gatecse-2010
co-and-architecture
cache-memory
normal
barc2017
4
answers
25
GATE CSE 2015 Set 3 | Question: 22
Consider the following statements. TCP connections are full duplex TCP has no option for selective acknowledgement TCP connections are message streams Only I is correct Only I and III are correct Only II and III are correct All of I, II and III are correct
commented
in
Computer Networks
Jan 31, 2017
12.3k
views
gatecse-2015-set3
computer-networks
tcp
normal
5
answers
26
GATE CSE 2015 Set 3 | Question: 31
Consider the following grammar G $S \rightarrow F \mid H$ $F \rightarrow p \mid c$ $H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c$ are terminal symbols. Which of the following statement(s) ... grammar G S2: LR(1) can parse all strings that are generated using grammar G Only S1 Only S2 Both S1 and S2 Neither S1 and S2
answered
in
Compiler Design
Jan 31, 2017
15.2k
views
gatecse-2015-set3
compiler-design
parsing
normal
1
answer
27
Permutation and combinations
I am confused with Following formulaes of combination.. 1. n!/r! 2. n+k-1 C k 3. (P+1)*2^R where (P+R are total things and P are alike). 4. question such as number of ways of choosing 10 balls out of 15 balls in which 5 are red,8 are green,2 are black. Anybody please provide me some reference to understand these formulaes related to combination.
commented
in
Combinatory
Jan 31, 2017
365
views
combinatory
6
answers
28
GATE CSE 2015 Set 3 | Question: 9
The value of $\displaystyle \lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is $0$ $\frac{1}{2}$ $1$ $\infty$
commented
in
Calculus
Jan 31, 2017
13.2k
views
gatecse-2015-set3
calculus
limits
normal
6
answers
29
GATE CSE 2014 Set 2 | Question: 7
Let $k=2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n\text{-to-}2^n$ bit decoder. This circuit is equivalent to a $k$-bit binary up counter. $k$-bit binary down counter. $k$--bit ring counter. $k$-bit Johnson counter.
commented
in
Digital Logic
Jan 31, 2017
19.7k
views
gatecse-2014-set2
digital-logic
normal
digital-counter
3
answers
30
GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable
commented
in
Databases
Jan 31, 2017
28.2k
views
gatecse-2014-set2
databases
transaction-and-concurrency
conflict-serializable
normal
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:...