Recent activity - GATE CSE Doubts

0 votes

0 answers

Self-Doubt on Partial dependency
1NF 2NF 3NF BCNF when a non-prime attribute depends on the prime attribute then it becomes a partial dependency My Doubt is: when a non-prime attribute depends on the Primary key itself or any of the candidate key(but not on key attribute), then, in that case, what happens? Will it be partial dependency or not?

commented 1 hour ago in Databases by Rudr Pawan (577 points) | 6 views

0 votes

1 answer

GATE GURU TEST SERIES: LINEAR ALGEBRA

commented 1 hour ago in Linear Algebra by Verma Ashish (262 points) | 23 views

0 votes

1 answer

GRADE UP: FREE test

answered 2 hours ago in Linear Algebra by Verma Ashish (262 points) | 6 views

0 votes

1 answer

NPTEL Assignment: Dbms
Given the memory can hold 5 blocks at a time. Also, it is known that size of data is 64MB and size of each block is 1 MB. How many merge passes are required to sort the whole data in external merge-sort, after the initial sort pass, when sorted ... anyone having any idea how to solve, do tell. Even I can provide you the answer for some help that I am unable to understand)

commented 2 hours ago in Databases by chandrikabhuyan8 (88 points) | 10 views

0 votes

1 answer

SELF DOUBT IN floating point
IEEE $754$ single-precision format is used to store floating-point numbers, what is the value of $\mathrm {A-B}$? Where $\textbf A$ is the smallest number representable using the implicit normalized form, $\text B$ is largest number representable ... $\text B$ are positive numbers. I am confused about the solution of this problem. Can someone please explain it.

commented 4 hours ago in CO & Architecture by srestha (315 points) | 18 views

0 votes

1 answer

Virtual GATE test series: Aptitude(Verbal Ability)

answer selected 4 hours ago in Verbal Ability by srestha (315 points) | 13 views

0 votes

0 answers

Gatebook Test series: Dbms (Indexing)
Consider the database EMPLOYEE and file parameters given below EMPLOYEE field and sizes 4 B Suppose that the file is not ordered by the key field and we want to construct a access structure (index) on . Let P be the branch-node order, and be the leaf-node order, ... First one or second one? (P-1)(Key+$R_{p}$)+6B$\leqslant$512B P(Key+$R_{p}$)+6B$\leqslant$512B

asked 5 hours ago in Databases by Kushagra गुप्ता (82 points) | 5 views

0 votes

0 answers

Array Multiplier
Could any one please clarify do we have array multiplier in syllabus ?

asked 5 hours ago in CO & Architecture by Shivateja MST (35 points) | 7 views

0 votes

3 answers

Self doubt TOC
What is the regular expression for this given DFA?

commented 5 hours ago in Theory of Computation by Satbir (2.5k points) | 53 views

+1 vote

1 answer

GATE GURU: GRAPHS

commented 5 hours ago in Graph Theory by shaktisingh (27 points) | 11 views

0 votes

1 answer

Virtual GATE test series: Aptitude
$8,2,14,6,11,?,14,6,18,12$ What will be in place of ‘?’ in the series ?

answer selected 6 hours ago in Numerical Ability by Satbir (2.5k points) | 17 views

0 votes

0 answers

GATE GURU:FUNCTIONS
Can we represent all real numbers by a function? If so, then both are true right?

commented 6 hours ago in Set Theory & Algebra by Debapaul (117 points) | 11 views

0 votes

0 answers

self-Doubt in edge formula for line graph
The line graph of a graph with nodes, edges, and vertex degrees contains nodes and edges (ref. Skiena 1990, p. 137) Question : does the no of edges in line graph(given below) got through e' formula is right? I am getting no of edges in ... 3 edges but it is 8 edges as we can see in the below line graph Please validate the edge formula of the line graph. [closed]

commented 6 hours ago in Graph Theory by shaktisingh (27 points) | 13 views

0 votes

0 answers

Self Doubt: Discrete Maths 101
Does Euler graph must contain Euler path? Is the converse true?

commented 6 hours ago in Graph Theory by GAITONDE (1.2k points) | 10 views

0 votes

0 answers

NPTEL Assignment: Dbms (Indexing)
Calculate branching factor in case for B- tree index structure, given: page size: 16 kB, key-size: 16 bytes, pointer size = 8 bytes ? 255 256 510 511 (Note: The answer I am getting is 512 but the given answer is 511. Is my answer correct & if not please tell the approach.)

asked 6 hours ago in Databases by Kushagra गुप्ता (82 points) | 3 views

0 votes

1 answer

GATE GURU: GRAPH THEORY

answer selected 6 hours ago in Graph Theory by Satbir (2.5k points) | 16 views

0 votes

0 answers

CO self doubt on logic of DMA
If DMA transfer rate given in clock cycles And Hard disk transfer rate of block is given Then from these two how can we get processor time or CPU time? What is logic behind processor time from DMA?

comment edited 11 hours ago in CO & Architecture by Satbir (2.5k points) | 8 views

0 votes

1 answer

Self Doubt : Pipelining
Which of these statements always holds true? S1 : If there is a hazard in a pipeline, then there must be a stall S2 : If there is a stall in a pipeline, then there must be a hazard.

answer selected 11 hours ago in CO & Architecture by Satbir (2.5k points) | 31 views

0 votes

1 answer

MADE EASY TEST : DISCRETE MATHS
In how many ways 11 chocolates can be distributed to 7 children such that each one gets atleast one is ____

answer selected 11 hours ago in Combinatory by Debapaul (117 points) | 8 views

0 votes

0 answers

GATE GURU DISCRETE MATHS
Why is $(II)$ not a poset?

asked 12 hours ago in Set Theory & Algebra by Debapaul (117 points) | 16 views

0 votes

1 answer

MADE EASY DISCRETE MATHS
Number of perfect matching in a complete graph of 5 vertices is _____ ANS should be 0 right? as when odd number of vertices are there we should have no matching right? But they have applied the matching formula and solved it. God knows why

answer selected 12 hours ago in Graph Theory by Debapaul (117 points) | 11 views

0 votes

0 answers

Discrete Maths : GATE GURU TEST
Ans should be (II) only right? or should it be (II) and (III) According to me only II is correct as in III we are defining another variable altogether, though we know that x is dog. Any help will be highly appreciated.

asked 12 hours ago in Mathematical Logic by Debapaul (117 points) | 5 views

0 votes

1 answer

MADE EASY: LINEAR ALGEBRA

answer selected 13 hours ago in Linear Algebra by Debapaul (117 points) | 9 views

0 votes

1 answer

Made Easy : Compilers
Consider the following grammar, where set of non terminals are {S,A,B,C} and set of terminals are {e,f,g, t} S→ SeA | A A→AfB | B B→BgC | C C→t If CLR(1) parser is used to construct the DFA (sets of CLR(1) canonical items) for above grammar, then number of look-ahead for an item B→ •Bgc in initial state are _______

answer selected 13 hours ago in Compiler Design by Debapaul (117 points) | 11 views

0 votes

1 answer

Dispatcher Self Doubt
The dispatcher program runs in user mode or kernel mode?

answered 14 hours ago in Operating System by Priyansh Singh (41 points) | 15 views

+1 vote

1 answer

GATE GURU TEST SERIES: 2019 Discrete Maths

answer selected 16 hours ago in Mathematical Logic by Debapaul (117 points) | 14 views

0 votes

1 answer

Find number of Minimum cost spanning tree possible?

answer selected 1 day ago in Algorithms by Shaik Masthan (227 points) | 22 views

0 votes

1 answer

MADE EASY : LATTICE
Boolean lattice Complemented lattice Distributive lattice Not a lattice

answer selected 1 day ago in Set Theory & Algebra by Debapaul (117 points) | 14 views

0 votes

0 answers

self doubt in no of regions in this graph
how to find regions in this graph manually?

edited 1 day ago in Graph Theory by shaktisingh (27 points) | 8 views

0 votes

1 answer

ICMP echo reply request
An ICMP Echo Request and Reply can be used to determine if we have connectivity between a client and server at the Application Layer level? Is it False,right ? ping command is used to check for connectivity at network layer ?

answered 1 day ago in Computer Networks by GAITONDE (1.2k points) | 9 views

0 votes

0 answers

Made Easy test series 2020 computer network question

comment edited 1 day ago in Computer Networks by GAITONDE (1.2k points) | 21 views

0 votes

1 answer

Discrete Mathematics : Self doubt
$($ $∀x A(x)$ $∪$ $∀x B(x)$ $)$ $→$ $∀x$ $[$ $A(x)$ $ ∪ $ $B(x)] $ $Is$ $this$ $formula$ $VALID$?

answer selected 1 day ago in Mathematical Logic by Shaik Masthan (227 points) | 13 views

0 votes

1 answer

GO: CO 1 test
A system has 3 levels of cache i.e., L1,L2 and L3. The access times of L1,L2 and L3 cache memories are 100 ns/word, 150 ns/word and 250 ns/word, respectively. L1,L2 and L3 are divided into blocks of 1,4 and 8 words. The hit ratios ... the caches and how are they affecting the answer? I can't understand it here: https://gateoverflow.in/86072/test-by-bikram-2017-computer-architecture-11

comment edited 1 day ago in CO & Architecture by Satbir (2.5k points) | 24 views

0 votes

2 answers

ACE academy digital logic test series 2020
To design “31” i/p NOR gates , minimum number of 2 i/p NOR gates required is ______ ?

answer selected 1 day ago in Programming by Shaik Masthan (227 points) | 46 views

0 votes

0 answers

NPTEL Assignment : DBMS
BCNF 4NF PJNF DKNF

asked 1 day ago in Databases by Kushagra गुप्ता (82 points) | 11 views

0 votes

1 answer

Made Easy Test series Computer Network 2020
In RSA algorithm the number of keys required to support both confidentiality and authentication are ________. Ans: 4 Can someone plz explain ,how the answer is 4?

answered 1 day ago in Computer Networks by GAITONDE (1.2k points) | 18 views

0 votes

0 answers

Self doubt ( subnetting)
If we are given number of subnet bits = 3, then number of subnets possible will be 6 or 8? It is very confusing. Somewhere it is given 6 and somewhere it is mentioned that we can use all the 8. Please clarify.

edited 1 day ago in Computer Networks by chandrikabhuyan8 (88 points) | 21 views

+1 vote

2 answers

Gatebook Test series:Operating System
Suppose an OS using fair share scheduling : that is users are guaranteed to get their fair-share of the CPU time. Consider the following scenario. User 1 has four processes P1, P2, P3 and P4, and user 2 has only 1 process P5. All processes arrive at the same time ... 24 (A) 24 (B) 21.5 (C) 22 (D) 23.5 Please someone having any idea for this question, Do tell !!

answer edited 1 day ago in Operating System by Satbir (2.5k points) | 47 views

0 votes

2 answers

Self Doubt in MBR and MAR
Can someone please explain MBR and MAR and its significance so that I can actually learn it rather crame it. I need something so that I can relate this concept in my memory.

answer selected 1 day ago in CO & Architecture by `JEET (155 points) | 26 views

0 votes

1 answer

NPTEL-Assignment
Are they view serializable or not ? S1: r1(y), r2(x), r2(y), r3(y), w2(x), w1(y), w3(x), r1(x) S2: r2(x), r3(z), w3(x), w2(x), w2(y), w3(z), r1(x), r1(y), w1(x), w1(y) S3: r1(x), r2(x), r3(y), w1(x), r2(z), r2(y), w2(y), w1(z) (Note: S1 is Conflict serialiazable hence View serializable also but I need to check directly how it VSS )

answer selected 1 day ago in Databases by Kushagra गुप्ता (82 points) | 20 views

To see more, click for the full list of questions or popular tags.

Recent activity

1,674 questions

1,085 answers

4,521 comments

89,591 users