Register
Filter

Answers by Awe111

0 votes
2
UGC NET CSE | December 2005 | Part 2 | Question: 47
Which of the following is a $\text{EDI}$ standard ? $\text{ANSI X.15}$ $\text{ANSI X.14}$ $\text{ANSI X.13}$ $\text{ANSI X.12}$
Which of the following is a $\text{EDI}$ standard ?$\text{ANSI X.15}$$\text{ANSI X.14}$$\text{ANSI X.13}$$\text{ANSI X.12}$
0 votes
3
UGC NET CSE | December 2005 | Part 2 | Question: 35
Which activities is not included in the first pass of two pass assembler? build the symbol table construct the Intermediate code separate memonic opcode and operand field. none of these
Which activities is not included in the first pass of two pass assembler?build the symbol tableconstruct the Intermediate codeseparate memonic opcode and operand field.no...
1 votes
4
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
0 votes
5
UGC NET CSE | June 2005 | Part 2 | Question: 17
Which of the following tools is not required during system analysis phase of system development Life cycle ? CASE Tool RAD Tool Reverse engineering tool None of these
Which of the following tools is not required during system analysis phase of system development Life cycle ?CASE ToolRAD ToolReverse engineering toolNone of these
0 votes
6
UGC NET CSE | June 2005 | Part 2 | Question: 5
Minimum number of individual shoes to be picked up from a dark room ( containing $10$ pair of shoes) if we have to get atleast one proper pair : $2$ $20$ $11$ None of these
Minimum number of individual shoes to be picked up from a dark room ( containing $10$ pair of shoes) if we have to get atleast one proper pair :$2$$20$$11$None of these
0 votes
7
#self doubt
What is the difference between recursive descent parser and ll(1) parser, since in both no left recursion and left factoring is allowed…..then what is the advantage of using recursive descent parser??
What is the difference between recursive descent parser and ll(1) parser, since in both no left recursion and left factoring is allowed…..then what is the advantage of ...
0 votes
8
#self doubt
Every unambiguous grammar is LR(0) grammar?
Every unambiguous grammar is LR(0) grammar?
0 votes
9
UGC NET CSE | December 2004 | Part 2 | Question: 44
In transform analysis, input portion is called : Afferent branch Efferent branch Central Transform None of the above
In transform analysis, input portion is called :Afferent branchEfferent branchCentral TransformNone of the above
0 votes
10
UGC NET CSE | December 2004 | Part 2 | Question: 33
Code optimization is responsibility of : Application programmer System programmer Operating system All of the above
Code optimization is responsibility of :Application programmerSystem programmerOperating systemAll of the above
0 votes
11
UGC NET CSE | June 2007 | Part 2 | Question: 10
What is the maximum counting speed of a $4$-bit binary counter which is composed of Flip-Flop with a propagation delay of $25\:ns$? $1 \text{MHz}$ $10 \text{MHz}$ $100 \text{MHz}$ $4 \text{MHz}$
What is the maximum counting speed of a $4$-bit binary counter which is composed of Flip-Flop with a propagation delay of $25\:ns$?$1 \text{MHz}$$10 \text{MHz}$$100 \text...
0 votes
12
UGC NET CSE | June 2007 | Part 2 | Question: 6
$2$’s complement of $-100$ is: $00011100$ $10011101$ $10011100$ $11100100$
$2$’s complement of $-100$ is:$00011100$$10011101$$10011100$$11100100$
0 votes
13
UGC NET CSE | June 2010 | Part 2 | Question: 22
What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree
What is the most appropriate data structure to implement a priority queue ?HeapCircular arrayLinked listBinary tree
0 votes
14
UGC NET CSE | June 2010 | Part 2 | Question: 28
End-to-End connectivity is provided from Last-to-Last in Network layer Session layer Transport layer Data link layer
End-to-End connectivity is provided from Last-to-Last inNetwork layerSession layerTransport layerData link layer
0 votes
15
UGC NET CSE | June 2010 | Part 2 | Question: 34
Which of the following is the most general phase structured grammar ? Regular Context-sensitive Context free None of the above
Which of the following is the most general phase structured grammar ?RegularContext-sensitiveContext freeNone of the above
1 votes
18
UGC NET CSE | December 2013 | Part 2 | Question: 25
Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be m $\times$ n max(m, n) min(m, n) m+n-1
Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will bem $\times$ nmax(m, n)min(m, ...
0 votes
19
UGC NET CSE | December 2013 | Part 2 | Question: 41
Active X controls are Pentium binary programs that can be embedded in Word pages URL pages Script pages Web pages
Active X controls are Pentium binary programs that can be embedded inWord pagesURL pagesScript pagesWeb pages
0 votes
21
#Selfdoubt How L-attributed semantic rules are evaluated? Whether they are evaluated simultaneously during parsing?
If the grammar has only S-attributed semantic definitions, in a top down parser we will add the semantic action at the end of production and it will we executed when we...
0 votes
22
UGC NET CSE | December 2005 | Part 2 | Question: 29
__________ provide a method to recover data that has been delivered but not get used : Segmentation Concatenation Transalation Synchronization
__________ provide a method to recover data that has been delivered but not get used :SegmentationConcatenationTransalationSynchronization
0 votes
23
UGC NET CSE | December 2005 | Part 2 | Question: 25
Which traversal techniques lists the nodes of a binary search tree in ascending order? post – order in – order pre – order linear – order
Which traversal techniques lists the nodes of a binary search tree in ascending order?post – orderin – orderpre – orderlinear – order
0 votes
24
UGC NET CSE | December 2005 | Part 2 | Question: 14
Function over loading done at : Runtime Compile time Linking time Switching from function to function
Function over loading done at :RuntimeCompile timeLinking timeSwitching from function to function
0 votes
25
UGC NET CSE | December 2005 | Part 2 | Question: 45
Sliding window concept of software project management is : Preparation of comprehenciable plan Preparation of the various stages of development Ad-hoc planning Requirement analysis
Sliding window concept of software project management is :Preparation of comprehenciable planPreparation of the various stages of developmentAd-hoc planningRequirement an...
0 votes
26
UGC NET CSE | December 2007 | Part 2 | Question: 19
The end of an SQL command is denoted by : an end-of-line character an ‘enter-key’ marker entering F4 key a semicolon (;)
The end of an SQL command is denoted by :an end-of-line characteran ‘enter-key’ markerentering F4 keya semicolon (;)
0 votes
27
UGC NET CSE | December 2007 | Part 2 | Question: 5
Consider a Moore machine $M$ whose digraph is : Then $L(M)$, the language accepted by the machine M, is the set of all strings having : two or more b’s three or more b’s two or more a’s three or more a’s
Consider a Moore machine $M$ whose digraph is :Then $L(M)$, the language accepted by the machine M, is the set of all strings having :two or more b’sthree or more b’s...
0 votes
28
#self doubt
What are best books solving questions in gate?plz suggest anybody along with the pdf….it’s highly required
What are best books solving questions in gate?plz suggest anybody along with the pdf….it’s highly required
0 votes
29
UGC NET CSE | December 2005 | Part 2 | Question: 10
When an inventor is placed between both inputs of an $\text{S-R}$ flip flop, the resulting flip flop is : $JK$ flip-flop $D$ flip-flop $T$ flip-flop None of these
When an inventor is placed between both inputs of an $\text{S-R}$ flip flop, the resulting flip flop is :$JK$ flip-flop$D$ flip-flop$T$ flip-flopNone of these
0 votes
30
UGC NET CSE | December 2005 | Part 2 | Question: 50
The mechanism with which several uses can share a medium without interference is : Frequency modulation Amplitude modulation Multiplexing None of these
The mechanism with which several uses can share a medium without interference is :Frequency modulationAmplitude modulationMultiplexingNone of these
Page: