UGC NET Computer Science

Monday, June 30, 2014

Answer Key of UGC NET Computer Science June 2014

PAPER II

1-C 2-A 3-D 4- A 5-A 6-B 7- C 8-C 9-D 10-C 11-A 12-D 13-C 14-C 15-D 16-D 17-D 18-DC 19-D 20-D 21-C 22-A 23-C 24-B 25-A 26-B 27-D 28-B 29-C 30-A 31-D 32-D 33-B 34-A 35-C 36-B 37-B 38-C 39-B 40-B 41-B 42-C 43-D 44-D 45-A 46-A 47-D 48-A 49-B 50-B

PAPER III

1-C 2-D 3-C 4-A 5-D 6-C 7-D 8-D 9-A 10-B 11-A 12-A 13-A 14-C 15-B 16-D 17-B 18-C 19-A 20-D 21-D 22-D 23-B 24-A 25-D 26-D 27-B 28-D 29-C 30-B 31-C 32-B 33-C 34-B 35-B 36-C 37-C 38-C 39-C 40-D 41-A 42-C 43-C 44-C 45-C 46-C 47-D 48-D 49-C 50-B 51-A 52-D 53-C 54-C 55-B 56-C 57-A 58-A 59-B 60-A 61-B 62-B 63-C 64-A 65-B 66-A 67-B 68-B 69-D 70-D 71-C 72-C 73-D 74-C 75-D 66-A 67-B 68-B 69-D 70-D 71-C 72-C 73-D 74-D 75-D

Thursday, January 2, 2014

THE ANSWER KEY OF UGC NET COMPUTER SCIENCE DECEMBER 2013

PAPER II

1- B 2-C 3-D 4-A 5-B 6-A 7-C 8-D 9-C 10-B 11-A 12-A 13-A 14-B 15-A 16-B 17-D 18-D 19-B
20-A 21-D 22-C 23-A 24-C 25-D 26- D 27-D 28-C 29-D 30-A 31-C 32-D 33-D 34-C 35-B 36-B 37-A 38-A 39-C 40-D 41-D 42-D 43-B 44-B 45-D 46-D 47-C 48-A 49-A 50-B

PAPER III

1-C 2-D 3-C 4-B 5-A 6-B 7-B 8-B 9-D 10-A 11-A 12-C 13-C 14-D 15-C 16-C 17-C 18-D 19-D 20-A 21-B 22-D 23-A 24-B 25-B 26-C 27- A 28-D 29-C 30-D 31-B 32-C 33-D 34-C 35-B 36-B 37-C 38-D 39-D 40-B 41-D 42-D 43-C 44-C 45-C 46-D 47-C 48-A 49-C 50-D 51-D 52-C 53-C 54-B 55-B 56-A 57-C 58-A 59-D 60-D 61-D

62-D 63-C 64-D 65-C 66-D 67-C 68- B 69-D 70-C 71-A 72-A 73-C 74- D 75-C

UGC NET COMPUTER SCIENCE DECEMBER 2013 PAPER-II Answer Key

1. When data and acknowledgement are sent in the same frame, this is called as
(A) Piggy packing
(B) Piggy backing
(C) Back packing
(D) Good packing

2. Encryption and Decryption is the responsibility of Layer.
(A) Physical
(B) Network
(C) Application
(D) Datalink

3. An analog signal carries 4 bits in each signal unit. If 1000 signal units are sent per second, then baud rate and bit rate of the signal are and
(A) 4000 bauds \ sec & 1000 bps
(B) 2000 bauds \ sec & 1000 bps
(C) 1000 bauds \ sec & 500 bps
(D) 1000 bauds \ sec & 4000 bps

4. The VLF and LF bauds use propagation for communication.
(A) Ground (B) Sky
(C) Line of sight (D) Space

5. Using the RSA public key crypto system, if p = 13, q = 31 and d = 7, then the value of e is
(A) 101 (C) 105
(B) 103 (D) 107

6. FAN IN of a component A is defined as
(A) Number of components that can call or pass control to component A.
(B) Number of components that are called by component A.
(C) Number of components related to component A.
(D) Number of components dependent on component A.

7. The relationship of data elements in a module is called
(A) Coupling
(B) Modularity
(C) Cohesion
(D) Granularity

8. Software Configuration Management is the discipline for systematically controlling
(A) the changes due to the evolution of work products as the project proceeds.
(B) the changes due to defects (bugs) being found and then fixed.
(C) the changes due to requirement changes
(D) all of the above
9. Which one of the following is not a step of requirement engineering ?
(A) Requirement elicitation
(B) Requirement analysts
(C) Requirement design
(D) Requirement documentation

10. Testing of software with actual data and in actual environment is called
(A) Alpha testing
(B) Beta testing
(C) Regression testing
(D) None of the above

11. The student marks should not be greater than 100. This is
(A) Integrity constraint
(B) Referential constraint
(C) Over-defined constraint
(D) Feasible constraint

12. GO BOTTOM and SKTP-3 commands are given one after another in a database file of 30 records. It shifts the control to
(A) 28th record      (B) 27th record
(C) 3rd record       (D) 4th record

13. An ER Model includes
I.   An ER diagram portraying entity types.
II. Attributes for each entity type
III. Relationships among entity types.
IV. Semantic integrity constraints that reflects the business rules about data not captured in the ER diagram.
(A) I, II, III & IV   (B) I&IV
(C) I, II & IV        (D) I & III

14. Based on the cardinality ratio and participation associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design.
(A) Entity   (B) Constraints
(C) Rules   (D) Keys

15. Data Integrity control uses
(A) Upper and lower limits on numeric data.
(B) Passwords to prohibit unauthorised access to files.
(C) Data dictionary to keep the data
(D) Data dictionary to find last access of data

16. What does the following declaration mean ?
int (*ptr) [10];
(A) ptr is an array of pointers of 10 integers.
(B) ptr is a pointer to an array of 10 integers.
(C) ptr is an array of 10 integers.
(D) none of the above.

17. Which of the following has compilation error in C ?
(A) int n = 32 ;
(B) char ch = 65 ;
(C) float f= (float) 3.2;
(D) none of the above

18. Which of the following operators can not be overloaded in C+ + ?
(A) *   (B) + =
(C) = =   (D) ::

19. allows to create classes which are derived from other classes, so that they automatically include some of its "parent's" members, plus its own members.
(A) Overloading
(B) Inheritance
(C) Polymorphism
(D) Encapsulation

20. The correct way to round off a floating number x to an integer value is
(A) y = (int)(.r + 0.5)
(B) y = int (x + 0.5)
(C) y = (int)*+ 0.5
(D) y = (int)((im> + 0.5)

21. What is the value of the postfix expression ?
a b c d + - * (where a = 8, b = 4, c = 2 and d = 5)
(A) -3/8   (B) -8/3
(C) 24       (D) -24

22. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue ?
(A) Neither of the pointers change
(B) Only front pointer changes
(C) Only rear pointer changes
(D) Both of the pointers changes

23. _________ is often used to prove the correctness of a recursive function.
(A) Diagonaliization
(B) Communitivity
(C) Mathematical Induction
(D) Matrix Multiplication

24. For any B-tree of minimum degree t > 2, every node other than the root must have atleast _________ keys and every   node can have at, most ________ keys.
(A) t-1,2t+1
(B) t+1,2t+1
(C) t-1,2t-1
(D) t+1,2t-1

25. Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case
by the merge sort algorithm will be
(A) m x n
(B) max (m, n)
(C) min (m, n)
(D) m + n - 1

26. Given the following statements :
S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser.
S2 : LR grammar is a larger subclass of context free grammar as compared to that SLR and LALR grammars.
Which of the following is true ?
(A) S1 is not correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
27. The context free grammar for the language
L={aⁿb^m|n≤m+3,n≥0.m≥0}is
(A)   S→aaaA; A→aAb|B, B→Bb | λ, (B)    S → aaaA|λ, A -> aAb | B, B -*Bb|λ
(C) S→aaaA | aa A |λ , A -> aAb | B|λ, B→ Bb|λ
(D)   S→aaaA | aa A | aA |λ , A → aAb | B, B→ Bb | λ
28. Given the following statements :
S1 :    If L is a regular language then the language {uv | u Є L, v Є L^R} is also regular.
S2 :    L = {ww^R}is regular language.
Which of the following is true ?
(A) S1 is not correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.

29. The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called   ____________
(A) Symbol resolution
(B) Parsing
(C) Assembly
(D) Relocation

30. Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right.
(A) Leftmost derivation
(B) Leftmost derivation traced out in reverse
(C) Rightmost derivation traced out in reverse
(D) Rightmost derivation

31. The dual of a Boolean expression is obtained by interchanging
(A) Boolean sums and Boolean products
(B) Boolean sums and Boolean products or interchanging 0's and 1 's
(C) Boolean sums and Boolean products and interchanging 0's & 1's
(D) Interchanging 0's and 1's

32. Given that (292) 10 = (1204)x in some number system x. The base x of that number system is
(A) 2
(B) 8
(C) 10
(D) None of the above
33. The sum of products expansion for the function
F(x, y, z) = (x + y)z is given as
(A) xyz + xyz + xyz
(B) xyz + xyz + xyz
(C) xyz + xyz + xyz
(D) xyz + xyz + xyz

34. Let P(m, n) be the statement
    "m divides n" where the universe of   discourse for both the variables is the set of positive integers. Determine the truth values of each of the following propositions:
   I: VmVnP(m,n),
   II. Ǝm Vn P(m, n)
(A) Both I and II are true
(B) Both I and II are false
(C) I - false & II - true
(D) I - true & II - false

35. Big - 0 estimate for
    f(x) = (x + 1) log(x^2 + 1) + 3x^2 is given as
(A) O(xlogx)
(B) O(x^2)
(C) O(x^3)
(D) O(x2logx)

36. How many edges are there in a forest of t-trees containing a total of n vertices ?
(A) n+1
(B) n-t
(C) n*t
(D) nt

37. Let f and g be the functions from the set of integers to the set integers defined by
f(x) = 2x + 3 and g(x) = 3x + 2
Then the composition of f and g and g and f is given as
(A) 6x + 7, 6x + 11
(B) 6x + 11, 6x + 7
(C) 5x + 5, 5x + 5
(D) None of the above

38. If n and r are non-negative integers and n > r, then p(n + 1, r) equals to
(A) P(n,r)(n + 1) / (n + 1 - r)
(B) P(n,r)(n+1) / (n - 1 + r)
(C) p(n,r)(n-l) / (n + 1 - r)
(D) p(n,r)(n + l) / (n + 1 + r)

39. A graph is non-planar if and only if it contains a subgraph homomorphic to
(A) K3,2 or K5       (B) K3,3 and K6
(C) K3,3 or K5       (D) K2,3 and K5

40. Which of the following statements are true ?
I.   A circuit that adds two bits, producing a sum bit and a carry bit is called half adder.
II. A circuit that adds two bits, producing a sum bit and a carry bit is called full adder.
III. A circuit that adds two bits and a carry bit producing a sum bit and a carry bit is called full adder.
IV. A device that accepts the value of a Boolean variable as input and produces its complement is called an inverter.
(A) I & II   (B) II & III
(C) I,II,III   (D) I,III & IV

41 Active X controls are Pentium binary programs that can be embedded in ____________
(A) Word pages
(B) URL pages
(C) Script pages
(D) Web pages

42.    Match the following :
List-I                                                       List - II
a. Wireless Application Environment      i. HTTP
b. Wireless Transaction Protocol           ii. IP
c. Wireless Datagram Protocol iii   Scripts
d. Wireless iv. UDP
Codes :
   a     b   c   d
(A) ii    iv   i   iii
(B) iv    iii   ii   i
(C) iv    iii   i   ii
(D) iii    i   iv   ii
43. Which of the following is widely used inside the telephone system for long-haul data traffic ?
(A) ISDN
(B) ATM
(C) Frame Relay
(D) ISTN

44. The document standards for EDI were first developed by large business house during the 1970s and are now under the control of the following standard organisation :
(A) ISO
(B) ANSI
(C) ITU-T
(D) IEEE

45. Electronic Data Interchange Software consists of the following four layers :
(A) Business application, Internal format conversion, Network translator, EDI envelope
(B) Business application, Internal format conversion, EDI translator, EDI envelope
(C) Application layer, Transport layer, EDI translator, EDI envelope
(D) Application layer, Transport layer, IP layer, EDI envelope
46. Consider a preemptive priority based scheduling algorithm based on dynamically changing priority.
Larger priority number implies higher priority. When the process is waiting for CPU in the ready queue
(but not yet started execution), its priority changes at a rate a = 2. When it starts running, its priority changes at a rate b = 1. All the processes are assigned priority value 0 when they enter ready queue. Assume that the following processes want to execute :
Process      Arrival Service
ID          Time   Time
PI 0 4
P2 1 1
P3 2 2
P4 3 1
The time quantum q = 1. When two processes want to join ready queue simultaneously, the process which has not executed recently is given priority. The finish time of processes PI, P2, P3 and P4 will respectively be
(A) 4, 5, 7 and 8
(B) 8, 2, 7 and 5
(C) 2, 5, 7 and 8
(D) 8, 2, 5 and 7

47. The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold
total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size
is 4 KB. The minimum size of TLB tag is
(A) 12 bits
(B) 15 bits
(C) 16 bits
(D) 20 bits

48. Consider a disk queue with request for input/output to block on cylinders
98, 183, 37, 122, 14, 124, 65, 67
in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively
(A) 236 and 252 cylinders
(B) 640 and 236 cylinders
(C) 235 and 640 cylinders
(D) 235 and 252 cylinders

49. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ?
(A) 332.8 KB
(B) 83.6 KB
(C) 266.2 KB
(D) 256.6 KB

50. Linux operating system uses
(A) Affinity Scheduling
(B) Fair Preemptive Scheduling
(C) Hand Shaking
(D) Highest Penalty Ratio Next

Tuesday, July 16, 2013

UGC NET Computer Science Paper II December -2005

1. T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

(A) T is a tree

(B) T contains no cycles

(D) All of these

2. If the proposition 7P=>Q is true, then the truth value of the proposition 7PV(P=>Q) is:

(A) True (B) Multi-Valued

3. Let A and B be two arbitrary events, then:

(A) P(A∩B)=P(A)P(B) (B) P(AUB)=P(A)+P(B)

(C) P(AUB)≤P(A)+P(B) (D) P(A/B)=P(A∩B)+P(B)

4. Which sentence can be generated by S→d/bA, A→d/ccA:

(A) bccddd (B) aabccd

5. Regular expression a+b denotes the set:

(A) {a} (B) {ϵ, a, b}

(C) {a, b} (D) None of these

6. Which of the following is divisible by 4?

(A) 100101100 (B) 1110001110001

7. A half-adder is also known as :

(A) AND Circuit (B) NAND Circuit

8. Consider the following sequence of instructions:

a=a⊕b, b=a⊕b, a=b⊕a. This sequence

(A) retains the value of the a and b

(B) complements the value of a and b

(C) swap a and b

(D) negates values of a and b

9. Consider the following circuit:

to make it a Tautology the [?] should be:

(A) NAND gate (B) AND gate

10. When an invertor is placed between both inputs of an S-R flip flop, the resulting flip flop is:

(A) JK flip-flop (B) D flip-flop

11. What is the output of the following C program main()

{printf(“%d%d%d”, sizeof(3.14f), sizeof(3.14), sizeof(3.141));}

(A) 4 4 4 (B) 4 8 8

12. The bitwise OR of 35 with 7 in C will be:

(A) 35 (B) 7

13. Data members and member function of a class by default is respectively:

(A) private and public (B) public

14. Function overloading done at:

(A) Run time (B) Compile time

15. What will be the value of i for the following expression:

int f=11, i=3;

i+=(f>3)?i&2:5;

(A) 2 (B) 5

16. A schema describes:

(A) data elements (B) records and files

17. One approach to standardizing storing of data:

(A) MIS (B) CODASYL

18. In a relational schema, each tuple is divided in fields called:

(A) Relations (B) Domains

19. An embedded printer provides:

(A) Physical record key (B) An inserted Index

(C) A secondary access path (D) All the above

20. A locked file can be:

(A) accessed by only one user

(B) modified by users with the correct password

21. In what tree, for every node the height of its left subtree and right subtree differ at least by one:

(A) Binary search tree (B) AVL tree

22. A hash function f defined as f(key)=key mod 7, with linear probing it is used to insert the key 37, 38, 72, 48, 98, 11, 56 into a table index from 0 to 6. What will be the locations of 11?

(A) 3 (B) 4

(C) 5 (D) 6

23. Consider the graph, which of the following is a valid topological sorting?

(A) ABCD (B) BACD

24. The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:

(A) 2 deletions, 3 additions (B) 3 deletions, 2 additions

25. Which traversal technique lists the nodes of a binary search tree in ascending order?

(A) post-order (B) in-order

26. The data unit in the TCP/IP application layer is called a ...............

(A) message (B) segment

27. Which of following file retrieval methods use hypermedia?

(A) HTML (B) Veronica

28. Which of following is an example of a client-server model?

(A) DNS (B) FTP

29. ................. points provide a method to recover data that has been delivered but not yet used:

(A) Segmentation (B) Concatenation

30. Encryption and decryption are the functions of the ................... layer of OSI model.

(A) transport (B) session

31. The Register or main memory location which contains the effective address of the operand is known as:

(A) Pointer (B) Indexed register

32. A Top-down Parse generates:

(A) Left-most derivation

(B) Right-most derivation

(D) Left-most derivation in reverse

33. A general macro processor is an in built function of:

(A) Loader (B) Linker

34. Which of the following is not collision Resolution Technique?

(A) Hash addressing (B) Chaining

(C) Indexing (D) None of these

35. Which activity is not included in the first pass of two pass assembler?

(A) build the symbol table

(B) construct the intermediate code

(D) none of these

36. Producer consumer problem can be solved using:

(A) semaphores (B) event counters

37. If you want to execute more than one program at a time, the systems software that are used must be capable of:

(A) word processing (B) virtual memory

38. Which of the following checks cannot be carried out on the input data to a system?

(A) Consistency check (B) Syntax check

39. Non modifiable procedures are called:

(A) Serially usable procedure (B) Concurrent procedure

(C) Re-entrant procedure (D) Top down procedure

40. Banker’s algorithm is used for ................. purpose.

(A) Deadlock avoidance (B) Deadlock removal

41. The testing of software against SRS is called:

(A) Acceptance testing (B) Integration testing

42. The lower degree of cohesion is:

(A) logical cohesion (B) coincidental cohesion

43. The reliability of the software is directly dependent upon:

(A) Quality of the design (B) Programmer’s experience

(C) Number of error (D) Set of user requirements

44. Successive layer of design in software using but ton-up design is called:

(A) Layer of Refinement (B) Layer of Construction

(C) Layer of abstraction (D) None of the above

45. Sliding window concept of software project management is:

(A) Preparation of comprehensible plan

(B) Preparation of the various stages of development

(D) Requirement analysis

46. Which of the following transmission media is used in Bluetooth technology?

(A) Radio links (B) Microwave links

47. Which of the following is a EDI standard?

(A) ANSI X.15 (B) ANSI X.14

48. Analysis of large database to retrieve information is called:

(A) OLTP (B) OLAP

49. The cost of the network is usually determined by:

(A) Time complexity (B) Switching complexity

50. The mechanism with which several users can share a medium without interference is:

(A) Frequency modulation (B) Amplitude modulation

(C) Multiplexing (D) None of these