Recent questions tagged ugcnetcse-june2015-paper3 / GATE Overflow for GATE CSE

2 votes

1 answer

61

UGC NET CSE | Junet 2015 | Part 3 | Question: 8
The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks, DEPT_Name). COnsider the following SQL Query: SELECT DEPT_Name from STUDENT where SEX='M' group by DEPT_Name having avg(Marks)> ... the university The average marks of Male students is more than the average marks of male students in the university

The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks, DEPT_Name). COnsider the following SQL Query:SELECT DEPT_Name from STUDENT where...

go_editor

3.1k views

go_editor asked Jul 31, 2016

0 votes

1 answer

62

UGC NET CSE | Junet 2015 | Part 3 | Question: 6
The number of flip-flops required to design a modulo -272 counter is 8 9 27 11

The number of flip-flops required to design a modulo -272 counter is892711

go_editor

3.1k views

go_editor asked Jul 31, 2016

2 votes

2 answers

63

UGC NET CSE | Junet 2015 | Part 3 | Question: 5
The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memory read/write employs one machine cycle. For execution of the ... rate if programmed IO data transfer technique is used? 500 Kbytes/sec 2.2 Mbytes/sec 125 Kbytes/sec 250 Kbytes/sec

The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memo...

go_editor

4.3k views

go_editor asked Jul 31, 2016

1 votes

2 answers

64

UGC NET CSE | Junet 2015 | Part 3 | Question: 4
The equivalent hexadecimal notation for octal number 2550276 is FADED AEOBE ADOBE ACABE

The equivalent hexadecimal notation for octal number 2550276 isFADEDAEOBEADOBEACABE

go_editor

2.4k views

go_editor asked Jul 31, 2016

2 votes

1 answer

65

UGC NET CSE | Junet 2015 | Part 3 | Question: 3
The RST 7 instruction in 8085 microprocessor is equal to CALL 0010 H CALL 0034 H CALL 0038 H CALL 003C H

The RST 7 instruction in 8085 microprocessor is equal toCALL 0010 HCALL 0034 HCALL 0038 HCALL 003C H

go_editor

3.7k views

go_editor asked Jul 31, 2016

3 votes

2 answers

66

UGC NET CSE | Junet 2015 | Part 3 | Question: 2
Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor? ... /sec $4 \times 10^6$ bytes/sec $16 \times 10^6$ bytes/sec $4 \times 10^9$ bytes/sec

Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration ...

go_editor

8.8k views

go_editor asked Jul 31, 2016

1 votes

1 answer

67

UGC NET CSE | Junet 2015 | Part 3 | Question: 1
For the 8 bit word 00111001,the check bits stored with it would we 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory? 10011001 00011001 00111000 11000110

For the 8 bit word 00111001,the check bits stored with it would we 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the ...

Sanjay Sharma

9.8k views

Sanjay Sharma asked Oct 10, 2015

4 votes

3 answers

68

UGC NET CSE | Junet 2015 | Part 3 | Question: 35
Let $f(n)$ and $g(n)$ be asymptotically non-negative functions. Which of the following is correct? $\theta (f(n)^*g(n))=min (f(n),g(n))$ $\theta (f(n)^*g(n))=max(f(n),g(n))$ $\theta (f(n)+g(n))=min(f(n),g(n))$ $\theta (f(n)+g(n))=max(f(n),g(n))$

Let $f(n)$ and $g(n)$ be asymptotically non-negative functions. Which of the following is correct?$\theta (f(n)^*g(n))=min (f(n),g(n))$$\theta (f(n)^*g(n))=max(f(n),g(n))...

Shubham Sahu

3.9k views

Shubham Sahu asked Jul 12, 2015

0 votes

1 answer

69

UGC NET CSE | Junet 2015 | Part 3 | Question: 32
The travelling salesman problem can be solved in Polynomial time using dynamic programming algorithm Polynomial time using branch-and-bound algorithm Exponential time using dynamic programming algorithm or branch-and-bound algorithm Polynomial time using back tracking algorithm

The travelling salesman problem can be solved inPolynomial time using dynamic programming algorithmPolynomial time using branch-and-bound algorithmExponential time using ...

Shubham Sahu

5.7k views

Shubham Sahu asked Jul 12, 2015

4 votes

4 answers

70

UGC NET CSE | Junet 2015 | Part 3 | Question: 7
Let $E_1$ and $E_2$ be two entities in E-R diagram with simple single valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$ where $R_1$ is one-many and $R_2$ is many-many. $R_1$ and $R_2$ ... attribute of their own. How many minimum number of tables are required to represent this situation in the Relational Model? 4 3 2 1

Let $E_1$ and $E_2$ be two entities in E-R diagram with simple single valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$ where $R_1$ is one-...

Shubham Sahu

10.4k views

Shubham Sahu asked Jul 7, 2015

0 votes

1 answer

71

UGC NET CSE | Junet 2015 | Part 3 | Question: 44
Which design matric is used to measure the compactness of the program in terms of lines of code? Consistency Conciseness Efficiency Accuracy

Which design matric is used to measure the compactness of the program in terms of lines of code?ConsistencyConcisenessEfficiencyAccuracy

Shubham Sahu

2.7k views

Shubham Sahu asked Jul 6, 2015

0 votes

2 answers

72

UGC NET CSE | Junet 2015 | Part 3 | Question: 43
Verification: refers to the set of activities that ensure that software correctly implements a specific function Gives answer to the question - Are we building the right product requires execution of software both A and B

Verification:refers to the set of activities that ensure that software correctly implements a specific functionGives answer to the question - Are we building the right pr...

Shubham Sahu

2.6k views

Shubham Sahu asked Jul 6, 2015

1 votes

1 answer

73

UGC NET CSE | Junet 2015 | Part 3 | Question: 45
Requirements prioritization and negotiation belongs to Requirements validation Requirements elicitation Feasibility study Requirements reviews

Requirements prioritization and negotiation belongs toRequirements validationRequirements elicitationFeasibility studyRequirements reviews

Shubham Sahu

3.5k views

Shubham Sahu asked Jul 5, 2015

1 votes

1 answer

74

UGC NET CSE | Junet 2015 | Part 3 | Question: 33
Which of the following is asymptotically smaller? lg(lg*n) lg*(lgn) lg(n!) lg*(n!)

Which of the following is asymptotically smaller?lg(lg*n)lg*(lgn)lg(n!)lg*(n!)

Shubham Sahu

6.8k views

Shubham Sahu asked Jul 4, 2015

32 votes

6 answers

75

GATE CSE 2005 | Question: 29, UGCNET-June2015-III: 9
Which one of the following statements about normal forms is $\text{FALSE}?$ $\text{BCNF}$ is stricter than $\text{3NF}$ Lossless, dependency-preserving decomposition into $\text{3NF}$ is always possible Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible Any relation with two attributes is in $\text{BCNF}$

Which one of the following statements about normal forms is $\text{FALSE}?$$\text{BCNF}$ is stricter than $\text{3NF}$Lossless, dependency-preserving decomposition into $...

Kathleen

16.9k views

Kathleen asked Sep 22, 2014

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