Questions by Junaed Siddiquee / GATE Overflow for GATE CSE

0 votes

0 answers

1

Made Easy Booklet-Databases
Question 79

Question 79

236 views

asked Apr 14, 2019

1 votes

0 answers

2

Made Easy Workbook Database

504 views

asked Apr 14, 2019

4 votes

0 answers

3

Made Easy Workbook
Question number : 32

Question number : 32

951 views

asked Apr 6, 2019

2 votes

1 answer

4

Calculus- +2math book
If an = 1000*n /n!, for n = 1, 2, 3, ...., then the sequence {an } (a) doesn't have a maximum (b) attains maximum at exactly one value of n (c) attains maximum at exactly two values of n (d) attains maximum for infinitely many values of n

If an = 1000*n /n!, for n = 1, 2, 3, ...., then the sequence {an }(a) doesn't have a maximum(b) attains maximum at exactly one value of n(c) attains maximum at exactly tw...

329 views

asked Apr 1, 2018

2 votes

2 answers

5

Pointers
Consider the declaration below: typedef char *Str_typed; #define Str_defined char* Str_typed s1, s2; Str_defined s3, s4; Which one of the following statements is correct? I. $s1$, $s2$, $s3$ and $s4$ are character pointers II. $s1$, $s2$, $s3$ and $s4$ are characters III. $s1$, $s2$, $s3$ are character pointers while $s4$ is a character IV. None of the above

Consider the declaration below:typedef char *Str_typed; #define Str_defined char* Str_typed s1, s2; Str_defined s3, s4;Which one of the following statements is correct?I....

594 views

asked Mar 23, 2018

0 votes

1 answer

6

Computer Networks
A $64000-byte$ message is to be transmitted over a $2-hop$ path in a store- and-forward packet-switching network. The network limits packets to a maximum size of $2032 bytes$ including a $32-byte$ header. The trans- mission lines in the ... delays at the intermediate node are negligible. How long does it take to deliver the entire message from the source to the destination?

A $64000-byte$ message is to be transmitted over a $2-hop$ path in a store- and-forward packet-switching network. The network limits packets to a maximum size of $2032 by...

380 views

asked Mar 15, 2018

1 votes

5 answers

7

Combinatorics
Three ladies have each brought a child for admission to a school. The head of the school wishes to interview the six people one by one, taking care that no child is interviewed before its mother. In how many different ways can the interviews be arranged? $6$ $36$ $72$ $90$

Three ladies have each brought a child for admission to a school. The head of the school wishes to interview the six people one by one, taking ca...

1.1k views

asked Mar 8, 2018

0 votes

0 answers

8

DBMS question on Join
Consider three relations R1(X, Y, Z), R2(M, N, P ), and R3(N, X). The primary keys of the relations are in Bold. The relations have 100, 30, and 400 tuples, respectively. The space requirements for different attributes are: X = 30 ... of join for the minimum cost. The cost of a join is defined as the total space required by the intermediate relations. Justify your answer.

Consider three relations R1(X, Y, Z), R2(M, N, P ), and R3(N, X). Theprimary keys of the relations are in Bold. The relations have 100, 30, and400 tuples, respectively. T...

315 views

asked Mar 7, 2018

2 votes

1 answer

9

Theory of Computation
It is known that the language $L1 = \{0^n 1^n 2^i \mid i!= n\}$ is not a context free language(CFL). Now consider the language $L2 = \{0^i 1^n 2^n \mid i != n\}$. We can prove $L2$ is not a CFL by converting $L2$ into $L1$ by applying two operations, both known to be closed on CFLs. What are the two operations you will use for this conversion? Justify your answer.

It is known that the language $L1 = \{0^n 1^n 2^i \mid i!= n\}$ is not a context free language(CFL).Now consider the language $L2 = \{0^i 1^n 2^n \mid i != n\}$. We can p...

398 views

asked Mar 6, 2018

1 votes

2 answers

10

Theory of Computation
Prove or disprove the following statement: The union of a regular language with a disjoint non-regular language over the same alphabet can never be regular.

Prove or disprove the following statement: The union of a regular language with a disjoint non-regular language over the same alphabet can never be regular.

2.4k views

asked Mar 4, 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