Recent activity by vk_9_1_9 / GATE Overflow for GATE CSE

2 answers

1

#MadeEasyTestSeries
S: If a relation R is in 3NF but not in BCNF then relation R must consist atleast 2 overlapped candidate keys. True/False

S: If a relation R is in 3NF but not in BCNF then relation R must consist atleast 2 overlapped candidate keys.True/False

2.0k views

answered Jan 29, 2019

0 answers

2

MadeEasy Full Length Test 2019: Databases - Er Diagram
Find minimum number of tables needed? Answer : (3) Can anyone please explain the answer and how to approach such complex er diagrams?

Find minimum number of tables needed?Answer : (3)Can anyone please explain the answer and how to approach such complex er diagrams?

895 views

asked Jan 26, 2019

0 answers

3

GEEKS 4 GEEKS - gate cs mock 2018
An orthogonal matrix A has eigen values 1, 2 and 4. What is the trace of the matrix ? 7/4 1/7 7 4/7 Answer given : 7/4 My answer : 7 trace of a matrix is the sum of its diagonal elements.So on transposing the matrix the diagonal elements will ... is also equal to sum of eigen values.So trace of A = 7 So trace of transpose(A) should be 7. Is my reasoning right?

An orthogonal matrix A has eigen values 1, 2 and 4. What is the trace of the matrix ?7/41/774/7Answer given : 7/4My answer : 7trace of a matrix is the sum of its diagonal...

1.2k views

commented Jan 3, 2019

0 answers

4

CLRS HASHING(EXERCISE 11.2-3)
Q)Professor Marley hypothesizes that substantial performance gains can be obtained if we modify the chaining scheme so that each list is kept in sorted order. How does the professor's modification affect the running time for successful searches, unsuccessful searches, ... what basis are we going to sort the elements? As, In a list all the elements have same key values

Q)Professor Marley hypothesizes that substantial performance gains can be obtainedif we modify the chaining scheme so that each list is kept in sorted order. Howdoes the ...

626 views

asked Dec 31, 2018

1 answer

5

sample question
If TCP round trip time is currently 20 ms and ACK comes in after 30 ms then what is the timeout period for next transmission . Use α=0.9 and β=2 I know that α is smoothening factor. what is meant by β?

If TCP round trip time is currently 20 ms and ACK comes in after 30 ms then what is the timeout period for next transmission . Use α=0.9 and β=2 I know that α is smoot...

518 views

asked Sep 21, 2018

0 answers

6

gate 2009
What does this relational calculus evaluates to? (A) Names of employees with a male supervisor. (B) Names of employees with no immediate male subordinates. (C) Names of employees with no immediate female subordinates. (D) Names of employees with a female supervisor. Can you please explain how to deal with the negation?

What does this relational calculus evaluates to?(A) Names of employees with a male supervisor.(B) Names of employees with no immediate male subordinates.(C) Names of empl...

162 views

asked Aug 17, 2018

2 answers

7

Virtual Memory
Which of the following is true? A. If the page size increases page fault rate may also increase. B. Multi-level paging optimizes program execution time. C. Dynamic linking increases program execution time.Correct Option D. TLB is a software data structure.

Which of the following is true?A. If the page size increases page fault rate may also increase.B. Multi-level paging optimizes program execution time.C. Dynamic linking i...

1.7k views

commented Aug 6, 2018

0 answers

8

Gate 2013
A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table (T1), which occupies exactly one page. Each entry of T1 stores ... never heard of page colouring.It's not in galvin and tannenbaum Can anyone suggest a book where i'll find this concept.

A computer uses 46–bit virtual address, 32–bit physical address, and a three–level paged page table organization. The page table base register stores the base addre...

531 views

asked Aug 6, 2018

0 answers

9

Sample Paper
Not sure about option c, can anyone please explain the relation between bounded waiting and busy waiting? 1. Bounded waiting does not allow: (a) Starvation of a process (b) A process to wait indefinitely to wait for Critical Section (c) Busy waiting (d) All of the above

Not sure about option c, can anyone please explain the relation between bounded waiting and busy waiting? 1. Bounded waiting does not allow: (a) Starvation of a process (...

180 views

asked Jul 30, 2018

1 answer

10

Sample paper
How to solve this when arrival time nd scheduling algorithm to use is not mentioned? 1. Consider the processes P 1 , P 2 , P 3 arrived in the sequence P 2 , P 3 , P 1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT? (a) 30 (c) 40 (b) 10 (d) 35

How to solve this when arrival time nd scheduling algorithm to use is not mentioned?1. Consider the processes P 1 , P 2 , P 3 arrived in the sequence P 2 , P 3 , P 1 and ...

462 views

asked Jul 29, 2018

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