Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged ugcnetcse-june2013-paper2
1
vote
1
answer
31
UGC NET CSE | June 2013 | Part 2 | Question: 11
Manager’s salary details are to be hidden from Employee table. This Technique is called as Conceptual level Datahiding Physical level Datahiding External level Datahiding Logical level Datahiding
go_editor
asked
in
Others
Jul 14, 2016
by
go_editor
2.5k
views
ugcnetcse-june2013-paper2
1
vote
1
answer
32
UGC NET CSE | June 2013 | Part 2 | Question: 10
Which of the following is not a type of Database Management System? Hierarchical Network Relational Sequential
go_editor
asked
in
Others
Jul 14, 2016
by
go_editor
6.6k
views
ugcnetcse-june2013-paper2
1
vote
1
answer
33
UGC NET CSE | June 2013 | Part 2 | Question: 9
How many times the word ‘print’ shall be printed by the following program segment? for (i=1, i $\leq$ 2, i++) for (j=1, j $\leq$ 2, j++) for (k=1, k $\leq$ 2, k++) printf(“print\n”) 1 3 6 8
go_editor
asked
in
Others
Jul 14, 2016
by
go_editor
2.1k
views
ugcnetcse-june2013-paper2
1
vote
2
answers
34
UGC NET CSE | June 2013 | Part 2 | Question: 8
What is the result of the expression(1&2)+(3/4)? 1 2 3 0
go_editor
asked
in
Others
Jul 14, 2016
by
go_editor
3.8k
views
ugcnetcse-june2013-paper2
2
votes
1
answer
35
UGC NET CSE | June 2013 | Part 2 | Question: 7
How many values can be held by an array A(-1, m; 1, m)? m m$^2$ m(m+1) m(m+2)
go_editor
asked
in
Others
Jul 13, 2016
by
go_editor
6.7k
views
ugcnetcse-june2013-paper2
1
vote
2
answers
36
UGC NET CSE | June 2013 | Part 2 | Question: 6
When the following code is executed what will be the value of x and y? int x=1, y=0; y=x++; 2, 1 2, 2 1, 1 1, 2
go_editor
asked
in
Others
Jul 13, 2016
by
go_editor
2.8k
views
ugcnetcse-june2013-paper2
2
votes
1
answer
37
UGC NET CSE | June 2013 | Part 2 | Question: 5
Cyclometric complexity of a flow graph G with n vertices and e edges is V(G) = e+n-2 V(G) = e-n+2 V(G) = e+n+2 V(G) = e-n-2
go_editor
asked
in
Graph Theory
Jul 13, 2016
by
go_editor
746
views
ugcnetcse-june2013-paper2
graph-theory
1
vote
2
answers
38
UGC NET CSE | June 2013 | Part 2 | Question: 4
A good software design must have High module coupling, High module cohesion High module coupling, Low module cohesion Low module coupling, High module cohesion Low module coupling, Low module cohesion
go_editor
asked
in
Others
Jul 13, 2016
by
go_editor
3.1k
views
ugcnetcse-june2013-paper2
1
vote
2
answers
39
UGC NET CSE | June 2013 | Part 2 | Question: 2
Match the following $:$ ... $\text{a-i; b-ii; c-iv; d-iii}$ $\text{a-i; b-ii; c-iii; d-iv}$
go_editor
asked
in
Others
Jul 13, 2016
by
go_editor
3.4k
views
ugcnetcse-june2013-paper2
1
vote
1
answer
40
UGC NET CSE | June 2013 | Part 2 | Question: 1
COCOMO stands for COmposite COst MOdel COnstructive COst MOdel COnstructive COmposite MOdel COmprehensive COnstruction MOdel
go_editor
asked
in
Others
Jul 13, 2016
by
go_editor
857
views
ugcnetcse-june2013-paper2
2
votes
2
answers
41
UGC NET CSE | December 2012 | Part 2 | Question: 5 UGCNET-June2013-II: 47
If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98. 37, 14, 124, 65, 67. 239 310 321 325
go_editor
asked
in
Operating System
Jul 8, 2016
by
go_editor
3.6k
views
ugcnetcse-dec2012-paper2
operating-system
disk-scheduling
ugcnetcse-june2013-paper2
1
vote
2
answers
42
UGC NET CSE | June 2013 | Part 2 | Question: 30
Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue may be complex structures ... incorrect S1 is correct and S2 is incorrect S1 is incorrect and S2 is correct Both S1 and S2 are correct
shivani2010
asked
in
DS
Jun 15, 2016
by
shivani2010
4.4k
views
data-structures
priority
ugcnetcse-june2013-paper2
2
votes
1
answer
43
UGC NET CSE | June 2013 | Part 2 | Question: 28
The time complexity to build a heap with a list of n numbers is O(log n) O(n) O(n logn) O(n$^2$)
shivani2010
asked
in
DS
Jun 15, 2016
by
shivani2010
1.9k
views
heap-sort
ugcnetcse-june2013-paper2
3
votes
3
answers
44
UGC NET CSE | June 2013 | Part 2 | Question: 37
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
shivani2010
asked
in
Graph Theory
Jun 12, 2016
by
shivani2010
4.6k
views
graph-theory
ugcnetcse-june2013-paper2
1
vote
1
answer
45
UGC NET CSE | June 2013 | Part 2 | Question: 40
The truth value of the statements: $\exists ! xP(x) \rightarrow \exists xP(x) \text{ and } \exists ! x \rceil P(x) \rightarrow \rceil \forall xP(x)$, (where the notation $\exists ! x P(x)$ denotes the proposition “There exists a unique $x$ such that $P(x)$ is true”) are: True and False False and True False and False True and True
Sanjay Sharma
asked
in
Mathematical Logic
Jun 1, 2016
by
Sanjay Sharma
1.6k
views
ugcnetcse-june2013-paper2
2
votes
1
answer
46
UGC NET CSE | June 2013 | Part 2 | Question: 38
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? M+N-C M-N-C M-N+C M+N+C
Sanjay Sharma
asked
in
Graph Theory
May 7, 2016
by
Sanjay Sharma
3.5k
views
ugcnetcse-june2013-paper2
2
votes
2
answers
47
UGC NET CSE | June 2013 | Part 2 | Question: 3
While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to measure which one of the following? Length of code Size of software Functionality of software None of the above
Sanjay Sharma
asked
in
IS&Software Engineering
Apr 13, 2016
by
Sanjay Sharma
6.4k
views
is&software-engineering
ugcnetcse-june2013-paper2
0
votes
2
answers
48
UGC NET CSE | June 2013 | Part 2 | Question: 39
Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? ... $(p \vee r \wedge q) \vee (p \wedge q \wedge r) \vee (\rceil p \wedge q \wedge r)$
Shimpy Goyal
asked
in
Mathematical Logic
Jun 26, 2015
by
Shimpy Goyal
3.5k
views
ugcnetcse-june2013-paper2
3
votes
1
answer
49
UGC NET CSE | June 2013 | Part 2 | Question: 33
Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE BUTAEEZ SUZANNE XYZABCD ABCDXYZ
Shimpy Goyal
asked
in
Computer Networks
Jun 25, 2015
by
Shimpy Goyal
10.9k
views
computer-networks
network-security
rsa
ugcnetcse-june2013-paper2
41
votes
4
answers
50
GATE CSE 2011 | Question: 20, UGCNET-June2013-II: 48
Let the page fault service time be $10$ milliseconds(ms) in a computer with average memory access time being $20$ nanoseconds (ns). If one page fault is generated every $10^6$ memory accesses, what is the effective access time for memory? $21$ ns $30$ ns $23$ ns $35$ ns
go_editor
asked
in
Operating System
Sep 29, 2014
by
go_editor
26.6k
views
gatecse-2011
operating-system
virtual-memory
normal
ugcnetcse-june2013-paper2
Page:
« prev
1
2
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged ugcnetcse-june2013-paper2
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...