Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2012-paper2
4
votes
2
answers
31
UGC NET CSE | December 2012 | Part 2 | Question: 17
The design issue of Datalink layer in OSI Reference Model is Framing Representation of bits Synchronization of bits Connection control
The design issue of Datalink layer in OSI Reference Model isFramingRepresentation of bitsSynchronization of bitsConnection control
go_editor
8.7k
views
go_editor
asked
Jul 8, 2016
Computer Networks
ugcnetcse-dec2012-paper2
computer-networks
network-layering
+
–
3
votes
2
answers
32
UGC NET CSE | December 2012 | Part 2 | Question: 16
In which tree, for every node the height of its left subtree and right subtree differ almost by 1? Binary Search Tree AVL Tree Threaded Binary Tree Complete Binary Tree
In which tree, for every node the height of its left subtree and right subtree differ almost by 1?Binary Search TreeAVL TreeThreaded Binary TreeComplete Binary Tree
go_editor
6.7k
views
go_editor
asked
Jul 8, 2016
DS
ugcnetcse-dec2012-paper2
data-structures
tree
binary-tree
+
–
0
votes
1
answer
33
UGC NET CSE | December 2012 | Part 2 | Question: 15
What is the size of the Unicode character in Windows Operating System? 8-Bits 16-Bits 32-Bits 64-Bits
What is the size of the Unicode character in Windows Operating System?8-Bits16-Bits32-Bits64-Bits
go_editor
2.3k
views
go_editor
asked
Jul 8, 2016
Programming in C
ugcnetcse-dec2012-paper2
non-gate
programming
+
–
1
votes
2
answers
34
UGC NET CSE | December 2012 | Part 2 | Question: 14
Given a memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K and 426 K (in order), using the first fit algorithm, in which partition would the process requiring 426 K be placed? 500 K 200 K 300 K 600 K
Given a memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K and 426 K (in order), using the first fit algorithm, in ...
go_editor
6.9k
views
go_editor
asked
Jul 8, 2016
Operating System
ugcnetcse-dec2012-paper2
operating-system
memory-management
+
–
1
votes
1
answer
35
UGC NET CSE | December 2012 | Part 2 | Question: 10
The number of bit strings of length eight that will either start with a 1 bit and end with two bits 00 shall be 32 64 128 160
The number of bit strings of length eight that will either start with a 1 bit and end with two bits 00 shall be3264128160
go_editor
1.5k
views
go_editor
asked
Jul 8, 2016
Combinatory
ugcnetcse-dec2012-paper2
combinatory
recurrence-relation
+
–
0
votes
3
answers
36
UGC NET CSE | December 2012 | Part 2 | Question: 9
If a packet arrive with M-bit value is ‘1’ and a fragmentation offset value ‘0’, then it is ____ fragement. First Middle Last All of the above
If a packet arrive with M-bit value is ‘1’ and a fragmentation offset value ‘0’, then it is ____ fragement.FirstMiddleLastAll of the above
go_editor
7.5k
views
go_editor
asked
Jul 8, 2016
Computer Networks
ugcnetcse-dec2012-paper2
computer-networks
ip-packet
+
–
0
votes
1
answer
37
UGC NET CSE | December 2012 | Part 2 | Question: 8
The Mobile Application Protocol (MAP) typically runs on top of which protocol? SNMP (Simple Network Management Protocol) SMTP (Simple Mail Transfer Protocol) SS7 (Signalling System 7) HTTP (Hyper Text Transfer Protocol)
The Mobile Application Protocol (MAP) typically runs on top of which protocol?SNMP (Simple Network Management Protocol)SMTP (Simple Mail Transfer Protocol)SS7 (Signalling...
go_editor
4.3k
views
go_editor
asked
Jul 8, 2016
Computer Networks
ugcnetcse-dec2012-paper2
computer-networks
network-protocols
+
–
1
votes
1
answer
38
UGC NET CSE | December 2012 | Part 2 | Question: 7
The ‘C’ language is Context free language Context sensitive language Regular language None of the above
The ‘C’ language isContext free languageContext sensitive languageRegular languageNone of the above
go_editor
1.5k
views
go_editor
asked
Jul 8, 2016
Theory of Computation
ugcnetcse-dec2012-paper2
theory-of-computation
+
–
1
votes
1
answer
39
UGC NET CSE | December 2012 | Part 2 | Question: 6
Component level design is concerned with Flow oriented analysis Class based analysis Both of the above None of the above
Component level design is concerned withFlow oriented analysisClass based analysisBoth of the aboveNone of the above
go_editor
5.8k
views
go_editor
asked
Jul 8, 2016
IS&Software Engineering
ugcnetcse-dec2012-paper2
non-gate
is&software-engineering
+
–
2
votes
2
answers
40
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
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.2393103...
go_editor
3.6k
views
go_editor
asked
Jul 8, 2016
Operating System
ugcnetcse-dec2012-paper2
operating-system
disk-scheduling
ugcnetcse-june2013-paper2
+
–
3
votes
4
answers
41
UGC NET CSE | December 2012 | Part 2 | Question: 4
The power set of the set $\{ \Phi \}$ is $\{ \Phi \}$ $\{ \Phi, \{ \Phi \} \}$ $\{ 0 \}$ $\{ 0, \Phi , \{ \Phi \} \}$
The power set of the set $\{ \Phi \}$ is$\{ \Phi \}$$\{ \Phi, \{ \Phi \} \}$$\{ 0 \}$$\{ 0, \Phi , \{ \Phi \} \}$
go_editor
2.3k
views
go_editor
asked
Jul 8, 2016
Set Theory & Algebra
ugcnetcse-dec2012-paper2
set-theory&algebra
set-theory
power-set
+
–
0
votes
3
answers
42
UGC NET CSE | December 2012 | Part 2 | Question: 3
The GSM network is divided into the following three major systems: SS, BSS, OSS BSS, BSC, MSC CELL, BSS, OSS SS, CELL, MSC
The GSM network is divided into the following three major systems:SS, BSS, OSSBSS, BSC, MSCCELL, BSS, OSSSS, CELL, MSC
go_editor
4.3k
views
go_editor
asked
Jul 8, 2016
Computer Networks
ugcnetcse-dec2012-paper2
computer-networks
communication
mobile-communication
+
–
1
votes
3
answers
43
UGC NET CSE | December 2012 | Part 2 | Question: 1
Consider the circuit shown below. IN a certain steady state, ‘Y’ is at logical ‘l’. What are the possible values of A, B, C? A=0, B=0, C=1 A=0, B=C=1 A=1, B=C=0 A= B=1, C=1
Consider the circuit shown below. IN a certain steady state, ‘Y’ is at logical ‘l’. What are the possible values of A, B, C?A=0, B=0, C=1A=0, B=C=1A=1, B=C=0A= B=...
go_editor
3.7k
views
go_editor
asked
Jul 8, 2016
Digital Logic
ugcnetcse-dec2012-paper2
digital-logic
circuit-output
+
–
1
votes
1
answer
44
UGC NET CSE | December 2012 | Part 2 | Question: 13
Which of the following is true? A relation in BCNF is always in 3NF A relation in 3NF is always in BCNF BCNF and 3NF are same A relation in BCNF is not in 3NF
Which of the following is true?A relation in BCNF is always in 3NFA relation in 3NF is always in BCNFBCNF and 3NF are sameA relation in BCNF is not in 3NF
im.raj
5.7k
views
im.raj
asked
Jun 16, 2016
Databases
databases
ugcnetcse-dec2012-paper2
database-normalization
+
–
2
votes
1
answer
45
UGC NET CSE | December 2012 | Part 2 | Question: 2
The worst case time complexity of AVL is tree is better in comparison to binary search tree for Search and Insert Operations Search and Delete Operations Insert and Delete Operations Search, Insert and Delete Operations
The worst case time complexity of AVL is tree is better in comparison to binary search tree forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...
im.raj
5.4k
views
im.raj
asked
Jun 16, 2016
DS
data-structures
binary-tree
ugcnetcse-dec2012-paper2
avl-tree
+
–
7
votes
4
answers
46
ISRO2009-21, UGCNET-Dec2012-II: 12
In which addressing mode, the effectives address of the operand is generated by adding a constant value to the content of a register? Absolute mode Indirect mode Immediate mode Index mode
In which addressing mode, the effectives address of the operand is generated by adding a constant value to the content of a register?Absolute modeIndirect modeImmediate m...
Desert_Warrior
6.2k
views
Desert_Warrior
asked
Jun 3, 2016
CO and Architecture
isro2009
co-and-architecture
ugcnetcse-dec2012-paper2
addressing-modes
+
–
1
votes
1
answer
47
UGC NET CSE | December 2012 | Part 2 | Question: 11
In compiler design ‘reducing the strength’ refers to reducing the range of values of input variables code optimization using cheaper machine instructions reducing efficiency of program none of the above
In compiler design ‘reducing the strength’ refers toreducing the range of values of input variablescode optimization using cheaper machine instructionsreducin...
Sanjay Sharma
4.1k
views
Sanjay Sharma
asked
Jun 1, 2016
Compiler Design
code-optimization
ugcnetcse-dec2012-paper2
compiler-design
+
–
1
votes
1
answer
48
UGC NET CSE | December 2012 | Part 2 | Question: 37
AES is a round cipher based on the Rijndal Algorithm that uses a 128 – bit block of data. AES has three different configurations. ______ rounds with a key size of 128-bits, ______ rounds with a key size of 192 bits and ______ rounds with a key size of 256 –bits 5, 7, 15 10, 12, 14 5, 6, 7 20, 12, 14
AES is a round cipher based on the Rijndal Algorithm that uses a 128 – bit block of data. AES has three different configurations. ______ rounds with a key size of 128-b...
Sanjay Sharma
2.5k
views
Sanjay Sharma
asked
May 9, 2016
Computer Networks
ugcnetcse-dec2012-paper2
computer-networks
network-security
+
–
1
votes
3
answers
49
UGC NET CSE | December 2012 | Part 2 | Question: 35
Which of the following is the most powerful parsing method? LL(I) Canonical LR SLR LALR
Which of the following is the most powerful parsing method?LL(I)Canonical LRSLRLALR
Sanjay Sharma
2.1k
views
Sanjay Sharma
asked
Apr 25, 2016
Theory of Computation
ugcnetcse-dec2012-paper2
compiler-design
parsing
+
–
2
votes
4
answers
50
UGC NET CSE | December 2012 | Part 2 | Question: 25
Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to $4$ other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if none ... out the letter? $122$ & $22$ $111$ & $11$ $133$ & $33$ $144$ & $44$
Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to $4$ other people. Some people do this, while some do not se...
Shimpy Goyal
6.7k
views
Shimpy Goyal
asked
Jun 23, 2015
DS
ugcnetcse-dec2012-paper2
tree
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register