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 Gate Fever
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Gate Fever
0
votes
0
answers
1
made easy cbt2
consider the following relational schema R(A,B,C,D,E,F,G) AB->C,BC->A,AC->B,B->D,D->E how many minimum relations required to decompose R into BCNF which satisfy lossless and FDP decomposition? initially i got 4 relation as R1(A,B,C) R2(D,E) R3(B,D) R4(A,B,F,G) but in R1 and R2 there is no common attribute, hence it will not be lossless??am i correct
asked
in
Databases
Jan 28, 2019
336
views
1
vote
1
answer
2
made easy mock 2
consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5} which of the following is correct? L is recursive CSL CFL regular
asked
in
Theory of Computation
Jan 21, 2019
322
views
0
votes
0
answers
3
made easy mock 2
consider a disk having 10 platters with 2 recording surfaces each surface contains 80 tracks and each track contains 400 sectors with 1 sector capacity of 4KB.The capacity of 1 cylinder is ____? i was getting 400*4 KB = 1600 KB am i wrong ?
asked
in
Operating System
Jan 21, 2019
338
views
0
votes
0
answers
4
general aptitude
statements:- some authors are teachers No teacher is a lady. conclusion:- I.some teachers are not ladies II.some ladies are teachers according to me neither conclusion I follows nor II am i correct??
asked
in
Verbal Aptitude
Jan 21, 2019
897
views
analytical-aptitude
logical-reasoning
statements-follow
0
votes
1
answer
5
MADE ESY MOCK 1
consider R(A,B,C,D,E) with FDs AB->C,C->D,D->B,D->E if number of keys in relation R is ‘a’ and the number of relation in 3NF decomposition is ‘b’ what is the value of a-b? i am getting a=3,b=4 a-b=-1 am i correct?
asked
in
Databases
Jan 20, 2019
165
views
1
vote
0
answers
6
made easy adv mock
the number of ways in which we can place 3 white pawns and 3 black pawns on a 3*3 chessboard my answer was 12. approach :- we cant have any 2 black pawns or 2 white pawns in the same row or column {3*2*1} * {2*1 * 1} am i correct??
asked
in
Combinatory
Jan 18, 2019
434
views
0
votes
1
answer
7
self doubt
if the flip flops are going in these states that is starts from 0 to 5 then 4 and then again 5 .Then what is the mod of the circuit??
asked
in
Digital Logic
Jan 18, 2019
236
views
0
votes
0
answers
8
made easy adv mock
A graph G is self complementary iff G is isomorphoc to its complement.Let X be a self complementary graph.Which of the following is a viable possibility with regards to connectivity of X and X' ,where X' denotes the complement of X? a)both X and X' are ... X' is disconnected c)X' is connected and X' is disconnected d)both X and X' are connected ans is (d) pls explain
asked
in
Graph Theory
Jan 18, 2019
133
views
1
vote
2
answers
9
made easy mock
minimum number of nodes (both leaf and non leaf) of B+ tree index required for storing 5500 keys and order of B+ tree is 8 _________ (order is maximum pointers a node can have) am getting 4681
asked
in
Databases
Jan 17, 2019
1.9k
views
0
votes
0
answers
10
made easy mock 2019
(i)A computer can have multiple MAC addresses (ii)A computer can have multiple IP addresses at different instances of time true/ false?? acc to me (i) false (ii)true
asked
in
Computer Networks
Jan 14, 2019
641
views
0
votes
0
answers
11
made easy cbt1
consider the following languages M and N M={W$W^{R}$W$W^{R}$ | W$\epsilon$(0,1)*} N={W1$W1^{R}$W2$W2^{R}$ | W1,W2$\epsilon$(0,1)* which of the following languages are CFL?
asked
in
Theory of Computation
Jan 13, 2019
470
views
0
votes
1
answer
12
made easy cbt1
consider the raletion schema:- R(A,B,C) with functional dependency {A->B} which of the following query returns “0” if no records of R violates A->B functional dependency[assume no NULL’s] for this question I directly marked (d) option as they have used count(*) and count func gives 1 even for null. am i wrong??
asked
in
Databases
Jan 13, 2019
219
views
0
votes
1
answer
13
made easy cbt1
FIFO replacement policy ignores locality of reference. true/false
asked
in
Operating System
Jan 13, 2019
742
views
operating-system
0
votes
0
answers
14
made easy cn 2018
consider the following statement:- data link layer define the boundaries of frame because framing is always of fixed size true or false?? acc. to me , its true
asked
in
Computer Networks
Jan 12, 2019
569
views
0
votes
0
answers
15
made easy full
which of the following is not an operator grammar?(where S,A,B are non terminals and a,b are terminals) i)S->AaB A->a/$\epsilon$ ii)S->Aa iii)S->AB A->aA/a iv)S->Ba B->b/Ba acc to me (i),(iii),(iv) should be the answer
asked
in
Compiler Design
Jan 12, 2019
465
views
0
votes
0
answers
16
made easy 2019 full test 2
consider a system with 48 bit virtual address and page size is 16KB.Operating system uses multilevel paging.page table entry size is 4B.What is the number of entries in the last level page table such that last level page table will fit into exactly one page. I am getting 4096.
asked
in
Operating System
Jan 12, 2019
542
views
0
votes
0
answers
17
made easy
let an be the recurrenence relation which satisfies $a_{n}=4(a_{n-1}-a_{n-2})$ with $a_{1}$=2 and $a_{2}=8$. let X corresponds to the value of $a_{17}$.then values of $log_{2}(\left | x \right |)$ will be _____? am getting 18.
asked
in
Combinatory
Jan 11, 2019
194
views
0
votes
0
answers
18
made easy
An operating system operates a policy in which resources are numbered uniquely and processes are allowed to request for resources only in increasing resource number, can starvation occur?? according to me ,NO
asked
in
Operating System
Jan 10, 2019
97
views
1
vote
1
answer
19
made easy
consider the speed of propagation of a signal along a cable is 2*10^8m/s and metwork has 10Mbps CSMA/CD network interconnecting 10 computers shown in below image.each computer is connected to the hub with a cable of different length .Computer H1 is ... 2.5 microseconds.what is the shortest packet length Lmin of this network in order to ensure that the CSMA/CD functions properly?
asked
in
Computer Networks
Jan 10, 2019
940
views
0
votes
0
answers
20
made easy full test
what is the minimum level of Btree index for storing 7500 keys and order of Btree is 6(order is maximum child pointer a node can have)________ my approach = $\left \lceil log_{5}7500 \right \rceil$ = 6
asked
in
Databases
Jan 9, 2019
311
views
Page:
1
2
3
4
5
6
...
9
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...