UGC NET Computer Science and Applications, June 2005: Fully Solved

Leave a Comment
This is the Fully Solved Question paper of UGC NET examination on Computer Science and Applications Paper II, examination held on June 2005. We have a compilation of 10 years question paper of UGC NET Computer Science and Applications. You can browse through all solved UGC NET question papers visiting the links below.

<<Previous UGC NET Paper                                                            Next UGC NET Paper>>

1. Which of the following is not true?
(A) Power of deterministic automata is equivalent to power of non-deterministic automata.
(B) Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata.
(C) Power of deterministic turing machine is equivalent to power of non-deterministic
turing machine.
(D) All the above
Ans: B
2. Identify the language which is not context - free.
(A) L={ωωR|ωϵ{0,1}*}
(B) L={anbn|n≥0}
(C) L={ωω|ωϵ{0,1}*}
(D) L={anbmcmdn | n, m≥0 }
Ans: B
3. The transitive closure of a relation R on set A whose relation matrix

Ans: B
4. Consider the relation on the set of non-negative integers defined by x≡y if and only if:
(A) x mod 3=3 mod y (B) 3 mod x≡3 mod y
(C) x mod 3=y mod 3 (D) None of the above
Ans: C
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:
(A) 2 (B) 20
(C) 11 (D) None of these
Ans: C
6. (101011)2=(53)b, then b is equal to:
(A) 4 (B) 8
(C) 10 (D) 16
Ans: B
7. The logic expression x’yz’+x’yz+xyz’+xyz reduces to:
(A) x’z (B) xyz
(C) y (D) y z
Ans: C
8. Which of the following logic has the maximum fan out?
Ans: D
9. Which of the following binary number is the same as its 2’s complement:
(A) 1010 (B) 0101
(C) 1000 (D) 1001
Ans: C
10. Identify the logic function performed by the circuit shown

(A) Exclusive-OR (B) AND
(C) Exclusive-NOR (D) NOR
Ans: C
11. After 3 calls of the c function bug() below, the values of i and j will be:
int j=1;
{ Static int i=0; int j=0;
i++; j++;
return (i) ; }
(A) i=0, j=0 (B) i=3, j=3
(C) i=3, j=0 (D) i=3, j=1
Ans: D
12. Find the output of the following “C” code:
Main ( )
{ int x=20, y=35;
x=y++ + x++;
y=++y + ++x;
printf (“%d, %d\n”, x, y);
(A) 55, 93 (B) 53, 97
(C) 56, 95 (D) 57, 94
Ans: D
13. The data hiding is taken care by:
(A) Abstraction (B) Encapsulation
(C) Modularity (D) Inheritance
Ans: A
14. If a data-item is declared as a protected access specifier then it can be accessed:
(A) Anywhere in the program (B) By the base and derived classes
(C) Only by base class (D) Only by derived class
Ans: B
15. Main()
{ char *str=”abcde”;
printf(“%c”, *str);
printf(“%c”, *str++);
printf(“%c”, *(str++));
printf(“%s”, str);}
The output of the above ‘C’ code will be:
(A) a a c b c d e (B) a a c c c d e
(C) a a b c d e (D) None of these
Ans: C
16. An Entity - relationship diagram is a tool to represent:
(A) Data model (B) Process model
(C) Event model (D) Customer model
Ans: A
17. Which of the following tools is not required during system analysis phase of system development Life cycle?
(A) CASE Tool (B) RAD Tool
(C) Reverse engineering tool (D) None of these
Ans: C
18. A black hole in a DFD is a:
(A) A data store with no in bound flows
(B) A data store with only in bound flows
(C) A data store with more than one in bound flow
(D) None of these.
Ans: B
19. Multi-valued dependency among attribute is checked at which level?
(A) 2 NF (B) 3 NF
(C) 4 NF (D) 5 NF
Ans: C
20. A WINDOW into a portion of a data base is:
(A) Schema (B) View
(C) Query (D) Data Dictionary
Ans: B
21. What is the time required to insert an element in a stack with linked implementation?
(A) O (log2n) (B) O (n)
(C) O (n log2n) (D) O (1)
Ans: D
22. Which of the following statement is false?
(A) Every tree is a bipartite graph
(B) A tree contains a cycle
(C) A tree with n nodes contains n-1 edges
(D) A tree is a connected graph
Ans: B
23. In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?
(A) 1 (B) 3
(C) 7 (D) 8
Ans: B
24. If the postfix form of a string is ABC+-D*, the actual string is:
(A) (A-(B+C))*D (B) ((A-B)+C)*D
(C) ((A+B)-C)*D (D) (A+(B-C))*D
Ans: A
25. The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like : { 1, 3, 2, 5, 4, 6} is:
(A) Quick sort (B) Bubble sort
(C) Merge sort (D) Selection sort
Ans: B
26. Which of the following are Data link layer standard?
(1) Ethernet (2) HSSI (3) Frame Relay
(4) 10-base T (5)Token ring
(A) 1, 2 (B) 1, 3, 5
(C) 1, 3, 4, 5 (D) 1, 2, 3, 4, 5
Ans: C
27. Which type of Bridge would be used to connect an Ethernet Segment with a token ring Segment?
(A) Transparent Bridge (B) Source-Route Bridge
(C) Translation Bridge (D) None of these
Ans: D
28. Which type of links are used for a connection between two DTE devices?
(A) X.21 (B) Frame Relay
(C) ATM (D) Modem
Ans: D
29. Which protocol is used to encapsulate a data packet created of a higher OSI model layer?
Ans: D
30. What is the correct subnet mask to use for a class-B address to support 30 Networks and also have the most hosts possible?
(A) (B)
(C) (D)
Ans: D
31. Which of the statements related to Compilers is wrong?
(A) Lexical analysis is breaking the input into tokens
(B) Syntax analysis is for parsing the phrase
(C) Syntax analysis is for analyzing the semantic
(D) None of these
Ans: C
32. Which of the following is the most general phase - structured grammar?
(A) Regular (B) Context – Sensitive
(C) Context free (D) None of these
Ans: B
33. Which activity is not included in the first pass of two pass assemblers?
(A) Build the symbol table
(B) Construct the machine code
(C) Separate mnemonic opcode and operand fields.
(D) None of these
Ans: D
34. The dynamic binding occurs during the:
(A) Compile time (B) Run time
(C) Linking time (D) Pre-processing time.
Ans: B
35. Symbol Table can be used for:
(A) Checking type compatibility
(B) Suppressing duplication of error message
(C) Storage allocation
(D) All of these
Ans: D
36. Moving Process from main memory to disk is called:
(A) Caching (B) Termination
(C) Swapping (D) Interruption
Ans: C
37. The principle of Locality of reference justifies the use of:
(A) Virtual memory (B) Interrupts
(C) Cache memory (D) Secondary memory
Ans: C
38. Bankers algorithm is for.
(A) Dead lock Prevention (B) Dead lock Avoidance
(C) Dead lock Detection (D) Dead lock creation
Ans: B
39. Which is the correct definition of a valid process transition in an operating system?
(A) Wake up : Ready → Running
(B) Dispatch : Ready→ Running
(C) Block : Ready → Running
(D) Timer run out : Ready → Blocked
Ans: B
40. Which of the following is not an Unix Command?
(A) Whoami (B) wc
(C) ls (D) put
Ans: D
41. The capability maturity model (err) defines 5 levels:
(a) Level 1 (i) Managed
(b) Level 2 (ii) Defined
(c) Level 3 (iii) Repeatable
(d) Level 4 (iv) Initial
(e) Level 5 (v) Optimized
correct matching is:
a b c d e
(A) (i) (ii) (iii) (iv) (v)
(B) (iv) (iii) (ii) (i) (v)
(C) (v) (i) (iii) (ii) (iv)
(D) (v) (ii) (i) (iii) (iv)
Ans: B
42. Which one of the following is not a software process model?
(A) Linear sequential model (B) Prototyping model
(C) The spiral model (D) COCOMO model
Ans: D
43. System Development Life-cycle has following stages:
(I) Requirement analysis (II) Coding
(III) Design (IV) Testing
Which option describes the correct sequence of stages?
(A) III, I, IV, II (B) II, III, I, IV
(C) I, III, IV, II (D) None of the above
Ans: D
44. Which one is measure of software complexity?
(A) Number of lines of code (LOC)
(B) Number of man years
(C) Number of function points (FP)
(D) All of the above
Ans: A
45. Which type of coupling is least preferred?
(A) Content coupling (B) Data coupling
(C) Control coupling (D) Common coupling
Ans: A
46. PVM and MPI Library functions are implemented on the top of the:
(A) Universal Message Passing (UMS)
(B) Network Interface Driver (NID)
(C) Media Access Control (MAC)
(D) None of these
Ans: D
47. The frequency reuse plan is divided into cell grouping using how many cells, where the number of cells equals N?
(A) 3 (B) 10
(C) 7 (D) 21
Ans: D
48. Which interim standard describes inter-switching networking?
(A) IS - 54 (B) IS - 95
(C) DS - 45 (D) ANSI – 41
Ans: B
49. Theoretically, how many 1.25 MHz Carriers are there in a CDMA cell?
(A) 18 (B) 22
(C) 9 (D) 64
Ans: C
50. Another name of IEEE 802.11a is:
(A) WECA (B) Fast Ethernet
(C) Wi-Fi 5 (D) 802.11g

Ans: C

<<Previous UGC NET Paper                                                            Next UGC NET Paper>>


Post a Comment