UGC NET CS 2009 Dec-Paper-2

Question 1
If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is ____________. (i) commutative (ii) transitive (iii) implicative (iv) equivalence
A
(i) and (ii)
B
(iii)
C
(i), (ii), (iii) and (iv)
D
None of these
       Engineering-Mathematics       Set-Theory
Question 1 Explanation: 
→ Initially calculate the possible cases of a relation i.e., R={(A,B), (C,B), (A,C)}
→ Now check whether the relation is transitive or commutative or etc..,
If a relation is commutative then if (A,B) present in the relation then (B,A) also need to exists. but in the relation (B,A) is not present. so given relation is not commutative.
Question 2
Circle has ____________
A
No vertices
B
Only 1 vertex
C
∞ vertices
D
None of these
       Engineering-Mathematics       Co-ordinate-Geometry
Question 2 Explanation: 
In graph theory, a circle graph is the intersection graph of a set of chords of a circle.
→ A circle graph is an undirected graph whose vertices can be associated with chords of a circle such that two vertices are adjacent if and only if the corresponding chords cross each other.
→ Circle does not have vertices.

Question 3
If in an error detection and correction code a message M : “You are good students” is stored as M' : Youare areyou aregood goodare goodstudents studentsgood. What is the space required to store M' in general ? (assume that ‘n’ is the length of M)
A
2n
B
3n
C
4n
D
less than 4n
       Digital-Logic-Design       Digital-Logic-Design
Question 3 Explanation: 
Message M: “You are good students” is stored as M'
The message length is "n".
The following string is "Youare areyou aregood goodare goodstudents studentsgood" divided as follows
You are good students --- n
are you students good ---- n
are good ----- n
good are ----- n
Then total messages length is 4n.
Question 4
P: “Program is a step by step execution of the instructions”. Given P, which of the following is true ?
A
Program is a subset of an instruction set.
B
Program is a sequence of a subset of an instruction set.
C
Program is a partially ordered set of an instruction set.
D
All of the above
Question 4 Explanation: 
→ Set A is a subset of another set B if all elements of the set A are elements of the set B Program is a collection of statements and that collection may be subset so the option(a) is true.
→ In the program, the execution of instructions will be performed sequentially.So option (b) also true.
→ A partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. According to the above definition, the option (c) also true.
Question 5
In a MIU puzzle, either of the letters M, I or U could go as a start symbol. Production rules are given below :
R1 : U → IU
R2 : M.x → M.x.x where . .. is string concatenation operator. Given this, which of the following holds for
(i) MIUIUIUIUIU
(ii) MIUIUIUIUIUIUIUIU
A
Either (i) or (ii) but not both of these are valid words.
B
Both (i) and (ii) are valid words and they take identical number of transformations for the production.
C
Both (i) and (ii) are valid words but they involve different number of transformations in the production.
D
None of these
Question 5 Explanation: 
(i) string-> MIUIUIUIUIU
It has M (5 times ) IU
So start with MIU
Production 2 says: M.x-> M.x.x
So
MU-> MUU again using it
MUU-> MUUU -> MUUUU ->MUUUUU
Now using prod 1: Last U-> IU
MUUUUU -> MIUUUUU
MIUUUUU -> MIUIUUUU
MIUIUUU ----------------> MIUIUIUIUIU
Question 6
The simplified form of the Boolean expression (X + Y + XY) (X + Z) is
A
X + Y + ZX + Y
B
XY – YZ
C
X + YZ
D
XZ + Y
       Digital-Logic-Design       Boolean-Expression
Question 6 Explanation: 
Given boolean expression is (X+Y+XY) (X+Z)
Step-1: (X (1+Y)+Y) (X+Z) /* To take common as X */
Step-2: (X+Y) (X+Z) /* To take common as X */
Step-3: (X+YZ)
Question 7
Identify the logic function performed by the circuit shown

A
exclusive OR
B
exclusive NOR
C
NAND
D
NOR
       Digital-Logic-Design       Logic-Gates
Question 7 Explanation: 
We can solve this problem by two methods
1. Using Boolean expression
2. Using truth table

Question 8
The highest noise margin is offered by
A
BICMOS
B
TTL
C
ECL
D
CMOS
Question 8 Explanation: 
Emitter Coupled Logic (ECL)
The storage time is eliminated as the transistors are used in difference amplifier mode and are never driven into saturation.
1. Fastest among all logic families
2. Lowest propagation delay.
Complementary metal oxide semiconductor(CMOS)
The power dissipation is usually 10nW per gate depending upon the power supply voltage, output load etc.
1. Lowest power dissipation
2. Excellent noise immunity
3. High packing density
4. Wide range of supply voltage
5. Highest fan out among all logic families
Question 9
The answer of the operation (10111)2* (1110)2 in hex equivalence is
A
150
B
241
C
142
D
101011110
       Digital-Logic-Design       Number-Systems
Question 9 Explanation: 

Question 10
How many 1’s are present in the binary representation of 3 × 512 + 7 × 64 + 5 × 8 + 3
A
8
B
9
C
10
D
11
       Digital-Logic-Design       Number-Systems
Question 10 Explanation: 
Given expression is 3 × 512 + 7 × 64 + 5 × 8 + 3
We can write above statement based on precedence is (3 * 512) + (7 * 64) + (5 * 8) + 3
Step-1: 1536+448+40+3
Step-2: (2027)10
Step-3: Equivalent binary number is (‭011111101011‬)2
Note: Total number of 1’s is 9.
Question 11
Recursive functions are executed in a
A
First in first out-order
B
Last in first out-order
C
Parallel fashion
D
Load balancing
       Data-Structures       Recursion
Question 11 Explanation: 
Recursive functions are executed in a last in first out-order. It is using stack data structure to evaluate recursive functions.
Question 12
What would be the output of the following program, if run from the command line as “myprog 123”?
main(int argc,char∗argv[ ])
{
int i;
i=argv[1] + argv[2] + argv[3];
printf (“%d”, i);
}
A
123
B
6
C
Error
D
“123”
       Programming       Command-Line-Arguements
Question 12 Explanation: 
The input given in string type. But we need to print the value in integer type. For this we have to use type casting (or) atoi function. So, it will give output is “error”
Note: argv[1], argv[2] and argv[3] is string type.
Question 13
A __________ is a special method used to initialize the instance variable of a class.
A
Member function
B
Destructor
C
Constructor
D
Structure
       Programming-in-c++       Virtual-Functions
Question 13 Explanation: 
→ A constructor is a special method used to initialize the instance variable of a class.
→ Constructor is a special type of subroutine called to create an object. It prepares the new object for use, often accepting arguments that the constructor uses to set required member variables.
Question 14
Encapsulation is
A
Dynamic binding
B
A mechanism to associate the code and data
C
Data abstraction
D
Creating new class
       Programming-in-c++       Properties
Question 14 Explanation: 
→ Encapsulation is a mechanism to associate the code and data.
→ Encapsulation is wrapping up of data into single unit.
Question 15
Which of the statements are true?
I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.
A
I, II, III
B
II, III, V
C
III, IV, V
D
I, II, IV
       Programming-in-c++       Properties
Question 15 Explanation: 
FALSE: Function overloading is done at run time.
TRUE: Protected members are accessible to the member of derived class.
TRUE: A derived class inherits constructors and destructors.
FALSE: A friend function of a class is defined outside that class scope but it has the right to access all private and protected members of the class. Even though the prototypes for friend functions appear in the class definition, friends are not member functions.
1. A function can only be declared a friend by a class itself.
2. It can have access to all members of the class, even private ones.
TRUE: Nested class is a derived class.
Question 16
The E-R model is expressed in term of
I. Entities
II. The relationship among entities.
III. The attributes of the entities.
IV. Functional relationship.
A
I, II
B
I, II, IV
C
II, II, IV
D
I, II, III
       Database-Management-System       ER-Model
Question 16 Explanation: 
The E-R model is expressed in term of Entities, relationship among entities and attributes of the entities.
Question 17
Specialization is __________ process.
A
top-down
B
bottom up
C
both (A) and (B)
D
none of these
Question 17 Explanation: 
→ Generalization - the process of defining a general entity type from a collection of specialized entity types.
→ Specialization - the opposite of generalization, since it defines subtypes of the supertype and determines the relationship between the two.
→ Specialization is a top down approach. The following example "Employee" could be a developer or a tester.
Question 18
Match the following :
A
1 – d, 2 – b, 3 – a, 4 – c
B
2 – d, 3 – a, 1 – b, 4 – c
C
4 – a, 3 – b, 2 – c, 1 – d
D
3 – a, 4 – b, 1 – c, 2 – d
       Database-Management-System       Functional-Dependency
Question 18 Explanation: 
Determinants→ Group of attributes on the left hand side of arrow of function dependency.
Candidate key→ Uniquely identified a row. Candidate key is minimal super key.
Non-redundancy→ No attribute can be added
Functional dependency→ A constraint between two attribute
Question 19
A function that has no partial functional dependencies is in __________ form.
A
3 NF
B
2 NF
C
4 NF
D
BCNF
       Database-Management-System       Functional-Dependency
Question 19 Explanation: 
To qualify for second normal form a relation must:
(1) be in first normal form (1NF)
(2) not have any non-prime attribute that is dependent on any proper subset of any candidate key of the relation. A non-prime attribute of a relation is an attribute that is not a part of any candidate key of the relation.
Question 20
Which of the following statement is wrong ?
I. 2-phase locking protocol suffer from deadlock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.
A
I, II, II
B
II, III, IV
C
III, IV, V
D
II, IV, V
       Database-Management-System       Transactions
Question 20 Explanation: 
ER- model: This model and its variations are frequently used for the conceptual design of database applications, and many database design tools employ its concepts. Hence statement 5 is wrong.
3NF: This normal form is responsible for checking transitive dependency. It is 4NF which checks multivalued dependency. Hence statement 4 is wrong.
2-Phase locking: It provides a serializable schedule but does not provides a deadlock free serializable schedule. Deadlock might occur using this concurrency control mechanism.
Time Stamp Protocol: It suffers more aborts in comparison of other concurrency control protocols because of allowing the execution of the transactions based upon their time stamp ordering. A transaction with higher timestamp is allowed to execute otherwise if a transaction with lower timestamp requests for execution then in that case that transaction will be aborted.
Hence only option A is correct.
Question 21
If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in the tree ?
A
It is an odd number.
B
It is an even number.
C
It cannot be equal to the number of leaves.
D
It is always greater than twice the number of leaves.
       Data-Structures       Data-Structures
Question 21 Explanation: 
Strictly binary tree with n leaf nodes always has 2n-1 nodes.
Ex: n=5
= (2*5)-1
= 9
Question 22
The number of edges in a complete graph of n vertices is
A
n
B
n(n – 1)/2
C
n(n + 1)/2
D
n2/2
       Engineering-Mathematics       Graph-Theory
Question 22 Explanation: 
Complete graph is an undirected graph in which each vertex is connected to every vertex, other than itself. If there are ‘n’ vertices then total edges in a complete graph is n(n-1)/2.
Ex:

n=5 and complete graph
Using formula to find number of edges is n(n-1)/2
=5*(5-1)/2
=(5*4)/2
=10
Question 23
At a hill station, the parking lot is one long driveway snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the parking lot more like
A
An array
B
A stack
C
A queue
D
A linked list
       Data-Structures       Queues-and-Stacks
Question 23 Explanation: 
The above data clearly using first in first out(FIFO) condition. FIFO we are using queue data structure.
Question 24
With regard to linked list, which of the following statement is false ?
A
An algorithm to search for an element in a singly linked list requires 0(n) operations in the worst case.
B
An algorithm for deleting the first element in a singly linked list requires 0(n) operations in the worst case.
C
An algorithm for finding the maximum value in a circular linked list requires 0(n) operations.
D
An algorithm for deleting the middle node of a circular linked list requires 0(n) operations.
       Data-Structures       Linked-List
Question 24 Explanation: 
Deleting the first element in a singly linked list requires 0(1) operations in the worst case.
Question 25
A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11 ?
A
3
B
4
C
5
D
6
       Data-Structures       Hashing
Question 25 Explanation: 
Given data, insertion order is 37, 38, 72, 48, 98, 11
Hash function = f(key) = key mod 7

Question 26
Device on one network can communicate with devices on another network via a
A
Hub/Switch
B
Utility server
C
File server
D
Gateway
       Computer-Networks       Hardware-and-various-devices-in-networking
Question 26 Explanation: 
→ Gateway allows data to flow from one discrete network to another.
→ Gateways are distinct from routers or switches in that they communicate using more than one protocol and can operate at any of the seven layers of the open systems interconnection model (OSI).
Question 27
What is the maximum window size in sliding window protocol used in a computer network ?
A
4
B
8
C
15
D
16
       Computer-Networks       Sliding-Window-Protocol
Question 27 Explanation: 
There should be given the number of bits is used for the packet sequence number.
Note: If they given number of bits then we are using 2n-1
Question 28
Which of the following are Data Link Layer standard ?
1.Ethernet
2.HSSI
3.Frame Relay
4.10Base-T
5.Token Ring
A
1, 2, 3
B
1, 3, 5
C
1, 3, 4, 5
D
1, 2, 3, 4, 5
       Computer-Networks       Data-Link-Layer
Question 28 Explanation: 
→ HSSI is a physical layer standard.
→ Ethernet, Frame Relay, 10Base-T and Token Ring is using data link layer.
Question 29
In case of Bus/Tree topology signal balancing issue is overcome by
A
Modulation
B
Polling
C
Segmentation
D
Strong transmitter
Question 29 Explanation: 
→ In case of BUS/Tree topology there are multiple connections because of which there can be interference if 2 stations transmit at same time.
→ Media Access control (MAC) protocol is required. Signal balancing is difficult for multiple connections, the no.of constrained signal is n*(n-1) where n is no. of stations on same subnet, it’s solution is to segment the network. Use amplifiers and repeaters between segments.
Question 30
Match the following :
A
i – d, ii – a, iii – b, iv – c
B
i – a, ii – d, iii – b, iv – c
C
i – d, ii – d, iii – c, iv – b
D
i – d, ii – c, iii – b, iv – a
       Computer-Networks       Match-The-Following
Question 30 Explanation: 
Ethernet→ Checking valid address
Token Ring→ Deterministic
Cut-through switch→ Utilize the full wire speed
Spanning tree→ Prevent looping
Question 31
In an absolute loading scheme which loader function is accomplished by assembler ?
A
re-allocation
B
allocation
C
linking
D
loading
       Compiler-Design       Compilers
Question 31 Explanation: 
→ Loader loads the executable code into memory, program and data stack are created, register gets initialized.
→ Re-allocation is an absolute loading scheme which loader function is accomplished by assembler
Question 32
Which of the following grammar is LR (1) ?
A
A → a A b, A → b A b, A → a , A →b
B
A → a A a, A → a A b, A → c
C
A → A + A, A → a
D
Both (A) and (B)
       Compiler-Design       Parsers
Question 32 Explanation: 
LR(1)is default name of CLR(1). Hence LR(1) and CLR(1) is same.
Option(A):
Since here we are having no Reduce-reduce OR shift-reduce conflict so it is CLR(1).




Question 33
A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar.
S → x x W [ print “1”]
S → y [print “2”]
W → S2 [print “3”]
what is the translation of “x x x x y z z” ?
A
1 1 2 3 1
B
1 1 2 3 3
C
2 3 1 3 1
D
2 3 3 2 1
       Compiler-Design       Syntax-Directed-Translation
Question 33 Explanation: 

⇒ 23131
SR is bottom up parser.
Note : Instead of Sz they given S2 and what operation will perform they are not mentioned
Question 34
Context-free Grammar (CFG) can be recognized by
A
Finite state automata
B
2-way linear bounded automata
C
pushdown automata
D
both (B) and (C)
       Theory-of-Computation       Context-Free-Grammar
Question 34 Explanation: 
Context-free Grammar (CFG) can be recognized by finite state automata and linear bounded automata(LBA).

Question 35
Synthesized attribute can be easily simulated by a
A
LL grammar
B
Ambiguous grammar
C
LR grammar
D
None of the above
       Compiler-Design       Synthesized-Attribute
Question 35 Explanation: 
→ Synthesized Attributes are such attributes that depend only on the attribute values of children nodes. It can be easily simulated by LR grammar
→ Inherited Attributes are such attributes that depend on parent and/or siblings attributes.
Question 36
In the process management Round-robin method is essentially the preemptive version of _________
A
FILO
B
FIFO
C
SSF
D
Longest time first
       Operating-Systems       Disk-Scheduling
Question 36 Explanation: 
In the process management Round-robin method is essentially the preemptive version of FIFO. The processes are having same burst time, then it is following FIFO order.
Question 37
A page fault
A
is an error specific page.
B
is an access to the page not currently in memory.
C
occur when a page program occur in a page memory.
D
page used in the previous page reference.
       Operating-Systems       Memory-Management
Question 37 Explanation: 
A page fault is the page is not in main memory.
Question 38
A semaphore count of negative n means (s = – n) that the queue contains ________ waiting processes.
A
n + 1
B
n
C
n – 1
D
0
       Operating-Systems       Semaphores
Question 38 Explanation: 
A semaphore count of negative ‘n’ means (s=-n) that the queue contains ‘n’ waiting processes.
Question 39
A program is located in the smallest available hole in the memory is _________
A
best – fit
B
first – bit
C
worst – fit
D
buddy
       Operating-Systems       Memory-Management
Question 39 Explanation: 
First fit: Allocate the first hole that is big enough. Searching can start either at the beginning of the set of holes or at the location where the previous first-fit search ended. We can stop searching as soon as we find a free hole that is large enough.
Best fit: Allocate the smallest hole that is big enough. We must search the entire list, unless the list is ordered by size. This strategy produces the smallest leftover hole.
Worst fit: Allocate the largest hole. Again, we must search the entire list, unless it is sorted by size. This strategy produces the largest leftover hole, which may be more useful than the smaller leftover hole from a best-fit approach.
Question 40
The Unix command used to find out the number of characters in a file is
A
nc
B
wc
C
chcnt
D
lc
       Operating-Systems       UNIX-Operating-System
Question 40 Explanation: 
Word Count(wc) is perform following operations in a file
1. Newline count
2. Word count
3. Byte count
Question 41
Software Engineering is a discipline that integrates _________ for the development of computer software.
A
Process
B
Methods
C
Tools
D
All
       Software-Engineering       Software-Development
Question 41 Explanation: 
Software Engineering is a discipline that integrates process,methods and tools for the development of computer software.
Process:
- Foundation for software engineering is the Process Layer.
- Software engineering process holds all the technology layers together and enables the timely development of computer software.
- It forms the base for management control of software project.
Methods:
- Software engineering methods provide the "Technical Questions" for building Software.
- Methods contain a broad array of tasks that include communication requirement analysis, design modelling, program construction testing and support.
Tools:
- Software engineering tools provide automated or semi-automated support for the "Process" and "Methods".
- Tools are integrated so that information created by one tool can be used by another.
Question 42
Any error whose cause cannot be identified anywhere within the software system is called ________
A
Internal error
B
External error
C
Inherent error
D
Logic error
       Software-Engineering       Software-testing
Question 42 Explanation: 
Internal errors are due to faulty logic or coding in the program.
1. Bounds errors
2. Inserting a null pointer into a collection
3. Attempting to use a bad date
External errors are due to events beyond the scope of the program.
1. Not easily predicted in advance
2. Encountered at more abstract levels
3. Not costly to detect
4. Detected in both the production and the debug versions of the library
Logical errors(or) semantic errors:
Logical errors are syntactically correct but it will generate error during execution.
1. Divide by zero
Inherent errors in the statement of the problem are called inherent errors.
Question 43
Recorded software attributes can be used in the following endeavours :
(i) Cost and schedule estimates.
(ii) Software product reliability predictions.
(iii) Managing the development process.
(iv) Nowhere
A
(i) (ii) (iv)
B
(ii) (iii) (iv)
C
(i) (ii) (iii)
D
(i) (ii) (iii) (iv)
       Software-Engineering       Software-configuration-management
Question 43 Explanation: 
Recorded software attributes can be used to
1. Cost and schedule estimates.
2. Software product reliability predictions.
3. Managing the development process.
Question 44
Black Box testing is done
A
to show that s/w is operational at its interfaces i.e. input and output.
B
to examine internal details of code.
C
at client side.
D
none of above.
       Software-Engineering       Software-testing
Question 44 Explanation: 
Black Box testing is done to show that s/w is operational at its interfaces i.e. input and output.
Black box testing methods are
1. Graph-Based Testing Methods
2. Equivalence Partitioning
3. Boundary Value Analysis
4. Orthogonal Array Testing
Question 45
The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called
A
Batch.Exe
B
Trans.Exe
C
Opt.Exe
D
Edit.Exe
Question 45 Explanation: 
The transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called Opt.Exe.
Question 46
The single stage network is also called
A
one sided network
B
two sided network
C
recirculating network
D
pipeline network
Question 46 Explanation: 
→ A single-stage network is a switching network with N input selectors (IS) and N output selectors.
→ The single-stage network is also called a recirculating network. Data items may have to recirculate through the single stage several times before reaching their final destinations.
Question 47
Analysis of large database to retrieve information is called
A
OLTP
B
OLAP
C
OLDP
D
OLPP
Question 47 Explanation: 
Analysis of large database to retrieve information is called OLAP.
Question 48
Which technology is sometime referred to as wireless cable ?
A
MMDS
B
ATM
C
LMDS
D
CDMA
Question 48 Explanation: 
→ Multipoint Multichannel Distribution Service(MMDS) is sometime referred to as wireless cable.
Question 49
Another name of IEEE 802.11a is ____________
A
Wi-Max
B
Fast Ethernet
C
Wi-Fi
D
802.11 g
       Computer-Networks       IEEE-802.11
Question 49 Explanation: 
IEEE 802.11a (or) Wi-Fi 5: It operates in the 5 GHz band with a maximum net data rate of 54 Mbit/s, plus error correction code, which yields realistic net achievable throughput in the mid-20 Mbit/s.
802.11b typically has a higher range at low speeds (802.11b will reduce speed to 5.5 Mbit/s or even 1 Mbit/s at low signal strengths). 802.11a also suffers from interference.
Question 50
The unlicensed National Information Infrastructure band operates at the __ frequency
A
2.4 GHz
B
5 GHz
C
33 MHz
D
5 MHz
Question 50 Explanation: 
The unlicensed National Information Infrastructure band operates at the 5 GHz frequency.
There are 50 questions to complete.
PHP Code Snippets Powered By : XYZScripts.com