Dark Mode

Answers by Prashant.

2 votes

211

Converting weak entity in ER diagram to RDBMS relation
Consider the following ER diagram: Which one of the following is correct attribute set for one of the minimized RDBMS table for above ER diagram? a. Parts(Part-id, P-id, Part-name) with primary key: Part-id, P-id b. Parts(Part-id, ... id) with primary key: P-id d. Trainer(Trainer-id, Trainer-name, Part-id) with primary key: Trainer-id, Part-id

answered in Databases Nov 6, 2016

4.5k views

7 votes

212

What is "Strict recoverable" schedule?
Consider the following schedule: $S: r_1(A), w_2(A), Commit_2, w_1(A),w_3(A), Commit_3, Commit_1$ Which of the following is true? a. Schedule is view serializable schedule and strict recoverable schedule b. Schedule is ... know what is "strict schedule" and "recoverable schedule", But then what it means by "strict recoverable"?

answered in Unknown Category Nov 6, 2016

6.8k views

3 votes

213

Min Heap
he minimum number of swaps required to build a min heap tree is _____________. Assume that array of n elements is provided 0 n/2 n n+1

answered in Programming in C Nov 6, 2016

830 views

4 votes

214

AVL tree
Following keys are inserted into a binary search tree and AVL tree in given order, keys : 45 30 8 36 60 51 The following nodes are added into corresponding BST and AVL tree then what is the difference in height of BST and AVL tree ? Keys : 4 16 25 are added afterwards in the corresponding trees

answered in Programming in C Nov 6, 2016

675 views

4 votes

215

AVL Tree
Following keys are inserted into a binary search tree and AVL tree in given order, keys : 45 30 8 36 60 51 What is the difference in the height of the binary search tree and AVL tree ?

answered in Programming in C Nov 6, 2016

432 views

3 votes

216

DMA is
DMA is a)Processor by itself b) Feature of the computer c)Part of processor d)A dedicated h/w device

answered in CO and Architecture Nov 5, 2016

244 views

1 vote

217

How does following SQL translates to relational algebra divide operation?
Book claims that below query translates to relational algebra expression $P/Q$. Can anyone explain how does the below query translates to relational algebra expression $P/Q$? Assume $Q$ has attributes $B_1,B_2,...,B_m$ ... addition the attributes $A_1,A_2,...,A_n$. How above query equates to relation algebra expression $P/Q$?

answered in Databases Nov 5, 2016

1.3k views

2 votes

218

Address of a 2 - dimensional Array in row major order

answered in Programming in C Nov 5, 2016

784 views

2 votes

219

Address of a 2 - dimensional Array

answered in Programming in C Nov 5, 2016

290 views

1 vote

220

Design an AVL tree ?

answered in Programming in C Nov 5, 2016

221 views

4 votes

221

Macro
Consider the following C program # include<stdio.h> # define fun(i, j) i * j # define gun(q) q * q int main( ) { int i = 4; int j = 3; printf(“%d”, fun(fun(i + 2, j), gun(j + 2))); return 0; } The output of the program is _______

answered in Programming in C Nov 5, 2016

514 views

3 votes

222

Array
Consider the following C program # include<stdio.h> int main( ) { static int p[ ] = {10, 20, 30, 40, 50, 60}; static int *q[ ] = {p+2, p+1, p, p+3, p+4, p+5}; static int **r[] = {q+4, q+5, q+1, q, q+2, q+3} int ***pt; pt = r + 2; printf(“%d”, ***(pt+3) - **(q+1)); } The output of the above program is ____

answered in Programming in C Nov 5, 2016

220 views

0 votes

223

worst case lower bound
What is the meaning of upper bound and worst case lower bound here?

answered in Algorithms Nov 5, 2016

1.0k views

2 votes

224

ME-ALGORITHM(BASIC LEVEL)-Q26
Consider the vertices a' and b' that are simultaneously on the function call stack at some point during the execution of DFS from vertices s' in diagraph. Which of the following must be true? S1: There exist directed path from s to a' and directed path from s to ... the above statements is/are true? a. S1 only b. S1 and S2 only c. S1 and S3 only d. S1, S2 and S3

answered in Algorithms Nov 5, 2016

1.8k views

1 vote

225

answered in Computer Networks Nov 4, 2016

291 views

2 votes

226

SQL query
when we calculated avg fun in sql then we exclude the null value or not in count (sum/count) somewhere it consider null vlaue also in count soomwher not?? wht is actual procedure

answered in Databases Nov 4, 2016

305 views

2 votes

227

SQL query
A relational schema for a train reservation database is given below. Passenger: (pid, pname, age) Reservation: (pid, class, tid) What pids are returned by the following SQL query for the above instance of the tables? SELECT pid FROM Reservation WHERE class= 'AC' AND EXISTS (SELECT * ... C) 1, 3 (D) 1, 5 in this que i get the ans but i what is the meanig of 1 here in every option

answered in Databases Nov 4, 2016

1.1k views

19 votes

228

GATE IT 2005 | Question: 69
In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two tables hold information on which items are supplied by which suppliers, and which warehouse ... who do not supply any item supply exactly one item supply one or more items supply two or more items

answered in Databases Nov 4, 2016

14.2k views

5 votes

229

How many address operations are possible
A computer has 40 bit instruction code . It uses one register operand and one memory operand .There are 128 general purpose regsiters and 256 M bytes of RAM If there are n 2 address operations which uses both register and memory then how many one address operations are possible a) (16-n)x 2^7 b)(32-n)x 2^6 c)64x 2^18 d)none

answered in CO and Architecture Nov 4, 2016

2.0k views

3 votes

230

Broadcast address
Suppose a host with ip address 15.121.201.123 wants to send a packet to all hosts in the same network. What will be the destination address that it uses? (A) 15.255.255.255 (B) 15.0.0.0 (C) 15.1.1.1 (D) 255.255.255.255

answered in CO and Architecture Nov 4, 2016

1.4k views

7 votes

231

johnson counter
How many flip flops are needed to build a divide by 12 johnson counter a)12 b)10 c)8 d)6

answered in CO and Architecture Nov 4, 2016

5.8k views

25 votes

232

GATE CSE 1997 | Question: 76-a
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined ... which is equivalent to SQL query. select eno from EMP|INVOLVED where EMP.eno=INVOLVED.eno and INVOLVED.pno=3

answered in Databases Nov 4, 2016

6.2k views

104 votes

233

GATE IT 2008 | Question: 61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, C), (B, D)$ gives a ... a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving

answered in Databases Nov 4, 2016

35.3k views

115 votes

234

GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.

answered in Operating System Nov 4, 2016

38.0k views

5 votes

235

race condition is related to

answered in CO and Architecture Nov 4, 2016

680 views

4 votes

236

kmap problem
for n variable kmap combining 16 cells canaining 1's as a single group will result a terms of __________ litrals a.4 b.n-4 c.n+4 d.4n

answered in Digital Logic Oct 30, 2016

2.3k views

2 votes

237

max min terms
how many number of possible max terms n min terms for n variable??

answered in Digital Logic Oct 30, 2016

5.1k views

6 votes

238

(Hamacher, pg.255, question 5.20)
1024x1024 array of 32-bit numbers is to be normalized as follows. For each column the largest element is found and all elements of the column are divided by this maximum value. Assume that each page in the virtual memory consists of 4Kbytes and that 1Mbytes of the ... it takes 2 ns to do a comparison, 20 ns to do a divide and 100 ns to do a load/store to memory.

answered in CO and Architecture Oct 30, 2016

2.7k views

Page:

« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
21
next »