UGC NET CS Jun 2023
UGC NET JRF Computer Science · 2023 · with answers and explanations
- questions
- 9
- Total marks
- 18
- Duration
- 180 minutes
- Negative marking
- No
Subjects: Computer Science
Question 1
Computer Science · 2 marksIn 16-bit 2's complement representation, the decimal number -28 is
- B.1111 1111 1111 0100
- C.1111 1111 1110 0100
- D.1111 1111 1110 0011
- A.1111 1111 0001 1100
Correct answer: C
Explanation: 28 in binary = 0000 0000 0001 1100. 1's complement = 1111 1111 1110 0011. 2's complement = 1111 1111 1110 0100.
Question 2
Computer Science · 2 marksAllowing different derived classes to be used interchangeably through the interface provided by a common base class is called
- A.Derived Polymorphism
- B.Compile time Polymorphism
- C.Static Polymorphism
- D.Run time Polymorphism
Correct answer: D
Explanation: Using derived classes interchangeably through a base class interface (via virtual functions and pointers/references) is runtime (dynamic) polymorphism.
Question 3
Computer Science · 2 marksModel of protection can be viewed as
- B.Domain matrix
- A.Owner matrix
- C.Global matrix
- D.Access matrix
Correct answer: D
Explanation: The protection model in operating systems is viewed as an access matrix, where rows represent domains (subjects) and columns represent objects.
Question 4
Computer Science · 2 marksIn a ______ curve, the last and first vertices of the polygon lie on the curve and all other vertices define the derivatives, order and shape of the curve.
- A.B-Spline curve
- B.Boxline curve
- C.Bezier curve
- D.Gaussian curve
Correct answer: C
Explanation: In a Bezier curve, only the first and last control points lie on the curve. The intermediate control points influence the shape and direction.
Question 5
Computer Science · 2 marksIn a ______, the left and right subtrees for any given node differ in height by more than one.
- D.Binary search tree
- C.Height balance tree
- A.Balanced binary tree
- B.Weight balanced binary tree
Correct answer: D
Explanation: A general binary search tree has no height balance constraint. AVL trees (height balanced) and balanced trees enforce the condition that subtrees differ by at most 1. An unbalanced BST can have arbitrary height difference.
Question 6
Computer Science · 2 marksWhat is the minimum Hamming distance in block code if we want to be able to detect up to S errors?
- A.S
- B.S + 1
- C.1
- D.0
Correct answer: B
Explanation: To detect up to S errors, the minimum Hamming distance must be at least S + 1.
Question 7
Computer Science · 2 marksFuzzy logic is a form of
- D.Many valued logic
- A.Two valued logic
- B.Crisp set logic
- C.Binary set logic
Correct answer: D
Explanation: Fuzzy logic is a form of many-valued logic where truth values can range between 0 and 1, unlike classical binary logic.
Question 8
Computer Science · 2 marksWhich protocol is used to acquire the MAC address of a host whose IP address is known?
- A.Dynamic Host Control Protocol
- B.Address Resolution Protocol
- C.Reverse Address Resolution Protocol
- D.User Datagram Protocol
Correct answer: B
Explanation: ARP (Address Resolution Protocol) is used to resolve an IP address to a MAC address. RARP does the reverse (MAC to IP).
Question 9
Computer Science · 2 marksIn CRC coding, if the data word is 111111, divisor is 1010 and the remainder is 110, which of the following code is true?
- A.011111101
- B.001010110
- C.111111110
- D.110111111
Correct answer: C
Explanation: CRC transmitted code = data word appended with remainder. 111111 + 110 = 111111110.