Recent questions - GATE CSE Doubts

0 votes

0 answers

Virtual Gate Test Series: Turing machine
If a language accepted by Turing Machine M, with the complexity atmost $O(2^{n})$ and halts on every input string, then (A) L is regular (B) L is CFL (C) L is CSL (D) L is recursive (E) L is recursively enumerable “halts on every input string”- we can say this will be RE, but how do we derive it w.r.t. polynomial function?

asked 40 minutes ago in Theory of Computation by srestha (318 points) | 1 view

0 votes

0 answers

Gatebook Test series: Dbms (Indexing/B/B+ Tree)
Consider the following statements S1 : allows rapid random access as well as rapid sequential access. S2 : When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. S3: When a key is deleted from ... For $S_{3}$ they have given it as false. How? It should be true acc. to me & $S_{4}$)

asked 1 hour ago in Databases by Kushagra गुप्ता (83 points) | 5 views

0 votes

0 answers

ACE Academy Test Series 2020
Consider a 2-way set associative cache with 4 blocks. The main memory contains 16 blocks. CPU generates requests for main memory blocks in following order: 0 4 0 8 0 4 1 3 1 5 1 3 Consider LRU (Least recently used) block replacement. Let's assume number of conflict misses for above requests is x and number of capacity misses is y. The value of x + 10y is

asked 1 hour ago in CO & Architecture by Ansaaa24 (8 points) | 3 views

0 votes

0 answers

Self-Doubt- Disk Schedulling
A program of size 64 MB is stored on disk which supports an average seek time of 32ms and rotation time of 20ms . Page size is 4MB and track size is 32MB . If the page of the program are countiguously placed on DIsk then the toatal time ... program-from-disk Someone kindly have a look at it, and tell me/us which one is the right approach to solve such questions.

asked 4 hours ago in Operating System by HeartBleed (52 points) | 12 views

0 votes

1 answer

Virtual GATE Test Series: Virtual Memory
Consider a three level memory system with the following specification $T1:$ Memory access time of level-1 memory=$10$ns/word $T2:$ Memory access time of level-2 memory=$15$ns/word $T3:$ Memory access time of level-1 memory=$200$ ... from level-2 to level-1. The average access time will be _______ ns. My ans 161ns and given 32ns. Which one correct?

asked 5 hours ago in CO & Architecture by srestha (318 points) | 20 views

+1 vote

1 answer

Self doubt -non isomorphic graph
Consider a graph G and it's complement is denoted by G', how many non isomorphic graph G exist such that G and G' both are bipartite??

asked 9 hours ago in Mathematical Logic by Prince Sindhiya (9 points) | 25 views

0 votes

0 answers

Operating System -Self Doubt
What is meaning of Page Address? How it’s size could be similar to PTE size?

asked 11 hours ago in Operating System by srestha (318 points) | 15 views

0 votes

1 answer

GRADE UP: FREE test

asked 20 hours ago in Linear Algebra by Debapaul (123 points) | 17 views

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?

asked 21 hours ago in Databases by Rudr Pawan (577 points) | 26 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 21 hours ago in Databases by Kushagra गुप्ता (83 points) | 8 views

0 votes

0 answers

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

asked 21 hours ago in CO & Architecture by Shivateja MST (35 points) | 11 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)

asked 22 hours ago in Databases by Kushagra गुप्ता (83 points) | 22 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 22 hours ago in Databases by Kushagra गुप्ता (83 points) | 9 views

+1 vote

1 answer

GATE GURU: GRAPHS

asked 23 hours ago in Graph Theory by Debapaul (123 points) | 23 views

0 votes

1 answer

GATE GURU: GRAPH THEORY

asked 1 day ago in Graph Theory by Debapaul (123 points) | 18 views

0 votes

1 answer

Virtual GATE test series: Aptitude(Verbal Ability)

asked 1 day ago in Verbal Ability by srestha (318 points) | 16 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 ?

asked 1 day ago in Numerical Ability by srestha (318 points) | 28 views

0 votes

0 answers

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

asked 1 day ago in Graph Theory by Debapaul (123 points) | 13 views

0 votes

0 answers

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

asked 1 day ago in Set Theory & Algebra by Debapaul (123 points) | 13 views

0 votes

0 answers

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

asked 1 day ago in Set Theory & Algebra by Debapaul (123 points) | 19 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 ____

asked 1 day ago in Combinatory by Debapaul (123 points) | 12 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 1 day ago in Mathematical Logic by Debapaul (123 points) | 7 views

0 votes

1 answer

GATE GURU TEST SERIES: LINEAR ALGEBRA

asked 1 day ago in Linear Algebra by Debapaul (123 points) | 32 views

0 votes

1 answer

MADE EASY: LINEAR ALGEBRA

asked 1 day ago in Linear Algebra by Debapaul (123 points) | 12 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

asked 1 day ago in Graph Theory by Debapaul (123 points) | 14 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?

asked 1 day ago in CO & Architecture by srestha (318 points) | 12 views

+1 vote

1 answer

GATE GURU TEST SERIES: 2019 Discrete Maths

asked 1 day ago in Mathematical Logic by Debapaul (123 points) | 16 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.

asked 1 day ago in CO & Architecture by `JEET (155 points) | 22 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]

asked 2 days ago in Graph Theory by shaktisingh (31 points) | 15 views

0 votes

0 answers

NPTEL Assignment : DBMS
BCNF 4NF PJNF DKNF

asked 2 days ago in Databases by Kushagra गुप्ता (83 points) | 13 views

0 votes

0 answers

Made Easy test series 2020 computer network question

asked 2 days ago in Computer Networks by vishal burnwal (9 points) | 23 views

0 votes

3 answers

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

asked 2 days ago in Theory of Computation by Priyansh Singh (41 points) | 61 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 _______

asked 2 days ago in Compiler Design by Debapaul (123 points) | 13 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?

asked 2 days ago in Computer Networks by vishal burnwal (9 points) | 20 views

0 votes

1 answer

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

asked 2 days ago in Mathematical Logic by Debapaul (123 points) | 15 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.

asked 2 days ago in Computer Networks by chandrikabhuyan8 (88 points) | 23 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 !!

asked 2 days ago in Operating System by Kushagra गुप्ता (83 points) | 49 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

asked 2 days ago in CO & Architecture by Sambhrant Maurya (271 points) | 26 views

0 votes

1 answer

MADE EASY: DISCRETE MATHS

asked 3 days ago in Mathematical Logic by Debapaul (123 points) | 23 views

0 votes

1 answer

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

asked 3 days ago in Operating System by aditi19 (44 points) | 17 views