GATE 17

Dev Bhatt asked Mar 3, 2017

412 views

See all

Please log in or register to answer this question.

Related questions

0 votes

0 answers

GO Classes asked Feb 4

171 views

Memory Based GATE DA 2024 | Question: 17
Consider the following SQL query: \[ \begin{aligned} &\text{SELECT * FROM Raider, Team} \\ &\text{WHERE Raider.id = Team.id} \\ &\text{AND City = 'Jaipur'} \\ &\text{AND Raid_points \textgreater 200; ... {aligned} \] Determine the number of rows returned by the SQL query, given the conditions specified for the City and Raid points.

Consider the following SQL query:\[\begin{aligned}&\text{SELECT * FROM Raider, Team} \\&\text{WHERE Raider.id = Team.id} \\&\text{AND City = 'Jaipur'} \\&\text{AND Raid_p...

GO Classes

171 views

GO Classes asked Feb 4

3 votes

1 answer

GO Classes asked Jan 28

490 views

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 17
Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be stored in $\text{A}[2]?$ (indexing starts from zero)

Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be st...

GO Classes

490 views

GO Classes asked Jan 28

6 votes

2 answers

GO Classes asked Jan 21

907 views

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 17
The number of ways that one can divide $10$ distinguishable objects into $3$ indistinguishable non-empty piles, is: $ \left\{\begin{array}{c} 10 \\ 3 \end{array}\right\}=9330 $ In how many different ways can one do this if the piles are also distinguishable?

The number of ways that one can divide $10$ distinguishable objects into $3$ indistinguishable non-empty piles, is:$$\left\{\begin{array}{c}10 \\3\end{array}\right\}=9330...

GO Classes

907 views

GO Classes asked Jan 21

4 votes

1 answer

GO Classes asked Jan 13

578 views

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 17
Consider the bit pattern $10110110.$ Interpret this bit pattern as a $8$-bit $2$'s complement number. What is the largest magnitude negative number that can be added to this value without causing $8$-bit $2$'s complement overflow? (Write your answer in decimal, only the magnitude, not the sign)

Consider the bit pattern $10110110.$ Interpret this bit pattern as a $8$-bit $2$'s complement number. What is the largest magnitude negative number that can be added to t...

GO Classes

578 views

GO Classes asked Jan 13

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

GATE 17

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0