Recent activity - GATE Overflow

GATE CSE

For all GATE CSE Questions

First time here? Checkout the FAQ!

x

0 votes

1 answer

1

ACE Class Test
Find what FD is violated by the Relation R = { } i.e. empty relation a. All FD b. Does not violate FD's c. Cannot say d. None of the Above

commented 35 minutes ago in Databases by aik138463 Active (1.1k points) | 108 views

+9 votes

2 answers

2

GATE2016-2-38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10,$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.

answer edited 2 hours ago in Algorithms by kenzou Junior (655 points) | 1.8k views

+11 votes

5 answers

3

GATE2004-IT-55
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive inter such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$. Which one of the following statements is FALSE? $f(n) + g(n) = O(h(n) + h(n))$ $f(n) = O(h(n))$ $h(n) \neq O(f(n))$ $f(n)h(n) \neq O(g(n)h(n))$

edited 3 hours ago in Algorithms by Puja Mishra Loyal (3.4k points) | 760 views

+2 votes

1 answer

4

analysis-of-algorithms
If f(n) = O(g(n)) then is it always true g(n) = (f(n)) ??? please explain.

commented 4 hours ago in Algorithms by sourav. Veteran (13.4k points) | 9 views

+23 votes

5 answers

5

GATE2012-38
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to 15 30 90 360

comment moved 5 hours ago in Graph Theory by sourav. Veteran (13.4k points) | 3.2k views

+1 vote

1 answer

6

Test Series
Host A Sends UDP datagram containing 1100 bytes of user data to host B over ethernet LAN. MTU of the network is 206 bytes (including network layer overhead ). UDP Header = 10 bytes TCP Header = 20 bytes . no options field in the IP header. Which of the ... ) a)there are total 6 fragments. b)offset of 4th fragment =69. c)MF of 6th fragment is set , i.e. 1.

answer selected 6 hours ago in Computer Networks by shaurya vardhan (403 points) | 12 views

+6 votes

2 answers

7

GATE2009-35
The running time of an algorithm is represented by the following recurrence relation: $T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{cases}$ Which one of the following represents the time complexity of the algorithm? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$

commented 6 hours ago in Algorithms by MiNiPanda Junior (521 points) | 823 views

0 votes

2 answers

8

Graph theory
The total number of non isomorphic graph which can be formed with 3 vertices________________________

commented 6 hours ago in Graph Theory by Ashwani Kumar 2 Boss (5.1k points) | 110 views

+14 votes

3 answers

9

GATE2007-IT-17
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute $b^n \bmod{m}, 0 \leq b, n \leq m$ ? $O(\log n)$ $O(\sqrt n)$ $O\Biggl (\frac{n}{\log n} \Biggr )$ $O(n)$

answer edited 6 hours ago in Algorithms by Shivansh Gupta Junior (915 points) | 1k views

0 votes

1 answer

10

subnet mask
Suppose computer A and B have IP address 143.105.1.113 and 143.105.1.91 respectively and they use the same subnet mask N. Which of the values of N given below should NOT be used if A & B belongs to the same network— (A) 255.255.255.0 (B) 255.255.255.128 (C) 255.255.255.192 (D) 255.255.255.224

answered 6 hours ago in Computer Networks by Ashwani Kumar 2 Boss (5.1k points) | 5 views

+1 vote

2 answers

11

commented 7 hours ago in Databases by Warlock lord Active (1.7k points) | 44 views

0 votes

0 answers

12

Fragmentation offset question
Consider a data of 4500 bytes (excluding IP header) sent through 2 routers of MTU 2600 and 1400 respectively. What will be the fragmentation offset of 3rd frame at the router of 1400 MTU ?

commented 7 hours ago in Computer Networks by Rajesh R (421 points) | 18 views

0 votes

0 answers

13

ethernet network
Station A and Station B attempt to transmit a frame and collide on an ethernet network, after collision, a wins and started transmission. At the end of this successful transmission, both A and B attempt to transmits & collide again. The probability that A wins the second is— (A) 0.5 (B) 0.625 (C) 0.75 (D) 0.33

commented 7 hours ago in Computer Networks by Ashwani Kumar 2 Boss (5.1k points) | 18 views

0 votes

1 answer

14

properties of languages
Which of the following statements is false ? (A) Every NFA can be converted to a equivalent DFA (B) Every non-deterministic turning machine can be converted to an equivalent deterministic turning machine (C) Every regular language is also a context for language (D) Every subset of a recursively enumerable set is recursive

answered 7 hours ago in Theory of Computation by junaid ahmad Boss (7.3k points) | 12 views

+4 votes

3 answers

15

different independent eigen vectors

commented 7 hours ago in Linear Algebra by Nirjhar Roy (49 points) | 286 views

+7 votes

2 answers

16

GATE2006-IT-45
Suppose that we have numbers between 1 and 100 in a binary search tree and want to search for the number 55. Which of the following sequences CANNOT be the sequence of nodes examined? {10, 75, 64, 43, 60, 57, 55} {90, 12, 68, 34, 62, 45, 55} {9, 85, 47, 68, 43, 57, 55} {79, 14, 72, 56, 16, 53, 55}

answered 7 hours ago in DS by Chhotu Loyal (4.7k points) | 1.5k views

0 votes

0 answers

17

Header length changes ?
Does header length change during transit ? That is when the packet reaches destination via routers ? If yes, then why ?

commented 7 hours ago in Computer Networks by junaid ahmad Boss (7.3k points) | 28 views

0 votes

0 answers

18

Data security in C programming language can be implemented using the data storage attribute

asked 7 hours ago in Programming by Sanjay Sharma Veteran (46.9k points) | 14 views

0 votes

2 answers

19

Programming
rec(int x) { static int f; if(x==1) return 1; else f+=x*rec(x-1); return(f); } the value returned by rec(5) is_____________

commented 7 hours ago in Programming by smsubham Active (1.3k points) | 58 views

0 votes

0 answers

20

digital signature
A digital signature is required— (I) To tie an electronic message to the sender’s identity (II) For non repudiation of communication by a sender (III) To prove that a message was sent by the sender in a court of law (IV) In all e-mail transactions (A) I and II (B) I, II, III (C) I, II, III, IV (D) II, III, IV

commented 7 hours ago in Computer Networks by Ankit Srivastava 7 Junior (509 points) | 7 views

0 votes

0 answers

21

about lex
Which of the following remarks about lex are true ? (A) It generates a ‘C’ program (B) It produces a C code that consumes more memory than a C program that can be written separately to accomplish the same task (C) It produces a C code that executes slower than a C program that can be written separately to accomplish the same task (D) All of these

asked 7 hours ago in Compiler Design by Sanjay Sharma Veteran (46.9k points) | 2 views

0 votes

2 answers

22

TestBook Live Test Q No 46

commented 7 hours ago in Databases by joshi_nitish Veteran (10.7k points) | 97 views

+1 vote

2 answers

23

C Programming
What will be output of below program #include<stdio.h> int tech(int,int); int main(void){ int a=tech(15,4); printf("%d",a); return 0; } int tech(int p,int q){ if(p%q==0) return q; else tech(q,p%q); }

commented 8 hours ago in Programming by Habibkhan Veteran (88.6k points) | 40 views

+19 votes

4 answers

24

GATE2008-IT-71
A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the following sequence of keys. 81, 537, 102, 439, 285, 376, 305 52, 97, 121, 195, 242, 381, 472 142, 248, 520, 386, 345, 270, 307 550, 149, 507, 395 ... nodes in the order in which we could have encountered them in the search? II and III only I and III only III and IV only III only

commented 8 hours ago in DS by Chhotu Loyal (4.7k points) | 1.2k views

+1 vote

1 answer

25

Discrete
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above

answered 8 hours ago in Others by sourav. Veteran (13.4k points) | 10 views

+1 vote

1 answer

26

DeadLock
A) S1 is Deadlock and S2 is starvation B) S1 is livelock and S2 is starvation C) S1 is starvation and S2 is Deadlock D) S1 is Livelock and S2 is Deadlock

commented 8 hours ago in Operating System by SHUBHAM SHASTRI (269 points) | 25 views

0 votes

1 answer

27

Doubt database
What is basic difference between mandatory attributes and multivalued attributes???

answered 9 hours ago in Databases by Dexter Veteran (10.1k points) | 7 views

+7 votes

1 answer

28

GATE2011-16, UGCNET-June2013-III-65

comment edited 9 hours ago in Operating System by Akash Kanase Veteran (45.7k points) | 2k views

+32 votes

3 answers

29

GATE2003-78
A processor uses 2-level page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both 32 bits wide. The memory is byte addressable. For virtual to physical address ... to access a virtual address is approximately (to the nearest 0.5 ns) 1.5 ns 2 ns 3 ns 4 ns

commented 9 hours ago in Operating System by hsd31196 (149 points) | 4.7k views

0 votes

2 answers

30

probability
5 cards are drawn successively with replacement from well shuffled deck of 52 cards. What is the probability that i) all the five cards are spades ii) only 3 cards are spades iii) none is a spade.

commented 9 hours ago in Probability by srestha Veteran (65.1k points) | 23 views

+1 vote

0 answers

31

Compiler Design:- Number of conflicts in LR(0)

commented 9 hours ago in Compiler Design by nikhil_cs (117 points) | 33 views

0 votes

1 answer

32

Hash function takes a message of arbitrary length and generates a fixed length code

answered 9 hours ago in CO & Architecture by Dexter Veteran (10.1k points) | 13 views

0 votes

1 answer

33

Round robin response time.
Response time either increases or remains same if time quantum increases but never decreases. True or false?

answer selected 9 hours ago in Operating System by Rajesh R (421 points) | 13 views

0 votes

1 answer

34

Discrete
Consider the graph G given below. The graph G is (a) planar (b) non- planar

commented 9 hours ago in Others by Shubhanshu Boss (9k points) | 28 views

0 votes

1 answer

35

Question
On a system with N CPU, what is the maximum number of processes that can be in running state ? A) N process B)Depend on the processes in ready state C) Can't say

commented 10 hours ago in Operating System by Shivam Chauhan Boss (5.8k points) | 9 views

0 votes

0 answers

36

ME,BW,Progress
Let flag is declared as Boolean flag[2] while(1) { flag[i] = true; while(flag[j]); /* Critical section */ flag[i] = false; /*Remainder section */ } Lets two processes are there, then in the above case A) ... only B) Mutual Exclusion and Bounded Waiting is satisfied only C) Progress is satisfied only D) Mutual Exclusion and Progress is satisfied only

asked 10 hours ago in Operating System by Shivam Chauhan Boss (5.8k points) | 6 views

0 votes

0 answers

37

Discrete
If G is a Cubic Hamiltonian graph, then χ′(G)= (a) 3 (b) 4 (c) 5 (d) None of the above

asked 10 hours ago in Others by mathematics (375 points) | 5 views

0 votes

3 answers

38

UGCNET-DEC2016-III-32
Any decision tree that sorts n elements has height ____ $\Omega (lg \: n)$ $\Omega (n)$ $\Omega (n \: lg \: n)$ $\Omega (n^2)$

answer selected 10 hours ago in Others by Rishi yadav Boss (5.9k points) | 410 views

0 votes

2 answers

39

View serializable
S: r1(x),r2(x),w1(x),w2(x) it is view serializable or not

answered 10 hours ago in Databases by Nirjhar Roy (49 points) | 200 views

0 votes

0 answers

40

compiler
A) Triple representation of x[i]:=y B) Number of conflicting states in DFA with LR(1) items for S-> aS | Sa |a

asked 10 hours ago in Compiler Design by A_i_$_h Boss (8.1k points) | 5 views

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

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

Follow @csegate

Gatecse

Recent activity

27,324 questions

35,176 answers

84,109 comments

33,279 users