UGC NET CS 2016 July – II

Question 21

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be

• n / 2 - 1
• n / 2 + 1
• (n – 1) / 2
• (n + 1) / 2

Question 22

Which of the following is not an inherent application of stack?

• Implementation of recursion

• Evaluation of a postfix expression

• Job scheduling

• Reverse a string

Question 23

In how many ways can the string A ∩ B – A ∩ B – A be fully parenthesized to yield an infix expression?

• 15

• 14

• 13

• 12

Question 24

A multiplexer combines four 100-Kbps channels using a time slot of 2 bits. What is the bit rate?

• 100 Kbps
• 200 Kbps
• 400 Kbps
• 1000 Kbps

Question 25

In a fully-connected mesh network with 10 computers, total ______ number of cables are required and ______ number of ports are required for each device.

• 40,9
• 45,10
• 45,9
• 50,10

Question 26

In TCP/IP Reference model, the job of _______ layer is to permit hosts to inject packets into any network and travel them independently to the destination. (1)Physical (2)Transport (3)Application (4)Host-to-network

• (1)

• (2) and (3)

• (3) and (4)

• (1), (2), (3) and (4)

Question 27

The number of strings of length 4 that are generated by the regular expression (0|∈)1⁺2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is :

• 08
• 10
• 11
• 12

Question 28

The content of the accumulator after the execution of the following 8085 assembly language program, is: MVI A, 42H MVI B, 05H UGC: ADD B DCR B JNZ UGC ADI 25H HLT

• 82H
• 78H
• 76H
• 47H

Question 29

Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates.

• I and IV
• I only
• II and III
• IV only

Question 30

Which of the following is FALSE?

• The grammar S → a Sb |bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.
• SLR is powerful than LALR.
• An LL(1) parser is a top-down parser.
• YACC tool is an LALR(1) parser generator.