MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1917 Mcqs, each offering curated multiple-choice questions to sharpen your UGC-NET knowledge and support exam preparation. Choose a topic below to get started.
| 1601. |
Which of the following is false regarding the evaluation of computer programming languages? |
| A. | Application oriented features |
| B. | Efficiency and Readability |
| C. | Software development |
| D. | Hardware maintenance cost |
| Answer» E. | |
| 1602. |
Block or Buffer caches are used to |
| A. | improve disk performance |
| B. | handle interrupts |
| C. | increase the capacity of main memory |
| D. | speed up main memory Read operations |
| Answer» E. | |
| 1603. |
Recursive functions are executed in a |
| A. | First in first out-order |
| B. | Last in first out-order |
| C. | Parallel fashion |
| D. | Load balancing |
| Answer» C. Parallel fashion | |
| 1604. |
Linking: |
| A. | cannot be performed before relocation |
| B. | cannot be performed after relocation |
| C. | can be performed both before and after relocation |
| D. | is not required if relocation is performed |
| Answer» C. can be performed both before and after relocation | |
| 1605. |
A Top-down Parse generates: |
| A. | Left-most derivation |
| B. | Right-most derivation |
| C. | Right-most derivation in reverse |
| D. | Left-most derivation in reverse |
| Answer» B. Right-most derivation | |
| 1606. |
Which of the following are Assembler Directives?(i) EQU(ii) ORIGIN(iii) START(iv) END |
| A. | (ii), (iii) and (iv) |
| B. | (i), (iii) and (iv) |
| C. | (iii) and (iv) |
| D. | (i), (ii), (iii) and (iv) |
| Answer» E. | |
| 1607. |
Which of the following are the principles tasks of the linker?I. Resolve external references among separately compiled program units.II. Translate assembly language to machine code.III. Relocate code and data relative to the beginning of the program.IV. Enforce access-control restrictions on system libraries. |
| A. | I and II |
| B. | I and III |
| C. | II and III |
| D. | I and IV |
| Answer» C. II and III | |
| 1608. |
In a two pass compiler, during the first pass: |
| A. | user defined address symbols are correlated with their binary equivalent |
| B. | the syntax of the statement is checked and mistakes, if any, are listed |
| C. | object program is generated |
| D. | semantic of the source program is elucidated |
| Answer» B. the syntax of the statement is checked and mistakes, if any, are listed | |
| 1609. |
A general macro processor is an in built function of: |
| A. | Loader |
| B. | Linker |
| C. | Editor |
| D. | Assembler |
| Answer» E. | |
| 1610. |
In an absolute loading scheme, which loader function is accomplished by a loader? |
| A. | Re-allocation |
| B. | Allocation |
| C. | Linking |
| D. | Loading |
| Answer» E. | |
| 1611. |
Consider the following statements related to compiler construction:I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata.II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine.Which of the above statement(s) is/are correct? |
| A. | Only l |
| B. | Only ll |
| C. | Both I and II |
| D. | Neither I nor II |
| Answer» E. | |
| 1612. |
Grammar of the programming is checked at …………… phase of compiler. |
| A. | semantic analysis |
| B. | code generation |
| C. | syntax analysis |
| D. | code optimization |
| Answer» D. code optimization | |
| 1613. |
Not an assembler directive |
| A. | XCHG |
| B. | ASSUME |
| C. | SHORT |
| D. | DB |
| Answer» B. ASSUME | |
| 1614. |
The principle of Locality of reference justifies the use of: |
| A. | Virtual memory |
| B. | Interrupts |
| C. | Cache memory |
| D. | Secondary memory |
| Answer» D. Secondary memory | |
| 1615. |
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 |
| Answer» D. None of these | |
| 1616. |
Which of the following is the most general phase structured grammar? |
| A. | Regular |
| B. | Context-sensitive |
| C. | Context free |
| D. | None of the above |
| Answer» C. Context free | |
| 1617. |
Any syntactic construct that can be described by a regular expression can also be described by a: |
| A. | Context sensitive grammar |
| B. | Non context free grammar |
| C. | Context free grammar |
| D. | None of the above |
| Answer» D. None of the above | |
| 1618. |
System calls are usually invoked by using: |
| A. | A privileged instruction |
| B. | An indirect jump |
| C. | A software interrupt |
| D. | Polling |
| Answer» D. Polling | |
| 1619. |
The family of context sensitive languages is ................. under union and ................. under reversal. |
| A. | closed, not closed |
| B. | not closed, not closed |
| C. | closed, closed |
| D. | not closed, closed |
| Answer» D. not closed, closed | |
| 1620. |
A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar.S -> xxW[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 |
| Answer» D. 2 3 3 2 1 | |
| 1621. |
In an absolute loading scheme, which loader function is accomplished by programmer? |
| A. | Allocation |
| B. | Linking |
| C. | Reallocation |
| D. | Both a and b |
| Answer» E. | |
| 1622. |
At the end of parsing, |
| A. | tokens are identified. |
| B. | set of instructions are identified. |
| C. | the syntactic groups are identified. |
| D. | machine instructions are identified. |
| Answer» B. set of instructions are identified. | |
| 1623. |
A compiler for a high level language that runs on one machine and produces code for a different machine is called: |
| A. | Optimizing |
| B. | One pass compiler |
| C. | Cross compiler |
| D. | Multipass compiler |
| Answer» D. Multipass compiler | |
| 1624. |
Which of the following is the most general phase-structured grammar ? |
| A. | Regular |
| B. | Context-sensitive |
| C. | Context free |
| D. | Syntax tree |
| Answer» C. Context free | |
| 1625. |
A single instruction in an assembly language program contains: |
| A. | one micro operation |
| B. | one macro operation |
| C. | one instruction to be completed in a single pulse |
| D. | one machine code instruction |
| Answer» C. one instruction to be completed in a single pulse | |
| 1626. |
A parse tree is an annotated parse tree if: |
| A. | it shows attribute values at each node. |
| B. | there are no inherited attributes. |
| C. | it has synthesized nodes as terminal nodes. |
| D. | every non-terminal nodes is an inherited attribute. |
| Answer» B. there are no inherited attributes. | |
| 1627. |
Which activity is not included in the first pass of two pass assembler? |
| A. | build the symbol table |
| B. | construct the intermediate code |
| C. | separate mnemonic opcode and operand field |
| D. | none of these |
| Answer» E. | |
| 1628. |
YACC builds up ................. parsing table. |
| A. | LALR |
| B. | LR |
| C. | SLR |
| D. | LLR |
| Answer» B. LR | |
| 1629. |
A Top-down Parse generates: |
| A. | Right-most derivation |
| B. | Right-most derivation in reverse |
| C. | Left-most derivation |
| D. | Left-most derivation in reverse |
| Answer» D. Left-most derivation in reverse | |
| 1630. |
Match the description of several parts of a classic optimizing compiler in List - I, with the names of those parts in List - II:List - I(a) A part of a compiler that is responsible for recognizing syntax.(b) A part of a compiler that takes as input a stream of characters and produces as output a stream of words along with their associated syntactic categories.(c) A part of a compiler that understand the meanings of variable names and other symbols and checks that they are used in ways consistent with their definitions.(d) An IR-to-IR transformer that tries to improve the IR program in some way (Intermediate representation).List - II(i) Optimizer(ii) Semantic Analysis(iii) Parser(iv) ScannerCode: (a) (b) (c) (d) |
| A. | (iii) (iv) (i) (ii) |
| B. | (iv) (iii) (ii) (i) |
| C. | (ii) (iv) (i) (iii) |
| D. | (ii) (iv) (iii) (i) |
| Answer» B. (iv) (iii) (ii) (i) | |
| 1631. |
Let A and B be two fuzzy integers defined as:A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)}B={(10,0.5), (11,1), (12,0.5)}Using fuzzy arithmetic operation given by |
| A. | {(11,0.8), (13,1), (15,1)} |
| B. | {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} |
| C. | {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} |
| D. | {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)} |
| Answer» E. | |
| 1632. |
Let A be the set of comfortable houses given as follows. Then the set of comfortable and affordable houses is |
| A. | A |
| B. | B |
| C. | C |
| D. | D |
| Answer» B. B | |
| 1633. |
Support of a fuzzy set given below, within a universal set X is given as |
| A. | A |
| B. | B |
| C. | C |
| D. | D |
| Answer» E. | |
| 1634. |
Let R and S be two fuzzy relations defined as follows. Then, the resulting relation, T, which relates elements of universe of X to elements of universe of Z using max-product composition is given by |
| A. | A |
| B. | B |
| C. | C |
| D. | D |
| Answer» E. | |
| 1635. |
Let R and S be two fuzzy relations defined as follows. Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by |
| A. | A |
| B. | B |
| C. | C |
| D. | D |
| Answer» D. D | |
| 1636. |
Consider a single perception with weights as given in the following figure. The perception can solve |
| A. | OR problem |
| B. | AND problem |
| C. | XOR problem |
| D. | All of the above |
| Answer» C. XOR problem | |
| 1637. |
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is |
| A. | 76 |
| B. | 80 |
| C. | 90 |
| D. | 96 |
| Answer» C. 90 | |
| 1638. |
If A and B are two fuzzy sets with membership functionsμA(x) = {0.6, 0.5, 0.1, 0.7, 0.8}μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5}Then the value of μ(A∪B)’(x) will be |
| A. | {0.9, 0.5, 0.6, 0.8, 0.8} |
| B. | {0.6, 0.2, 0.1, 0.7, 0.5} |
| C. | {0.1, 0.5, 0.4, 0.2, 0.2} |
| D. | {0.1, 0.5, 0.4, 0.2, 0.3} |
| Answer» D. {0.1, 0.5, 0.4, 0.2, 0.3} | |
| 1639. |
Compute the value of adding the following two fuzzy integers:A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)}B = {(0.5,11), (1,12), (0.5,13)}Where fuzzy addition is defined asμA+B(z) = maxx+y=z (min(μA(x), μB(x)))Then, f(A+B) is equal to |
| A. | {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} |
| B. | {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} |
| C. | {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} |
| D. | {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} |
| Answer» E. | |
| 1640. |
A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. |
| A. | Support |
| B. | α-cut |
| C. | Convex |
| D. | Concave |
| Answer» D. Concave | |
| 1641. |
In a single perceptron, the updation rule of weight vector is given by |
| A. | w(n + 1)=w(n)+η[d(n)-y(n)] |
| B. | w(n + 1)=w(n)–η[d(n)-y(n)] |
| C. | w(n + 1)=w(n)+η[d(n)-y(n)]* x (n) |
| D. | w(n + 1)=w(n)–η[d(n)-y(n)]* x (n) |
| Answer» D. w(n + 1)=w(n)–η[d(n)-y(n)]* x (n) | |
| 1642. |
A perceptron has input weights W1 = -3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2? |
| A. | -2.65 |
| B. | -2.30 |
| C. | 0 |
| D. | 1 |
| Answer» D. 1 | |
| 1643. |
A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. |
| A. | degenerate |
| B. | non-degenerate |
| C. | unbounded |
| D. | unbalanced |
| Answer» B. non-degenerate | |
| 1644. |
At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any non-basic variable Xj is obtained as zero, the solution under the test is |
| A. | Degenerate solution |
| B. | Unbounded solution |
| C. | Alternative solution |
| D. | Optimal solution |
| Answer» D. Optimal solution | |
| 1645. |
The golden ratio ϕ and its conjugate ϕ’ both satisfy the equation |
| A. | x^3 – x – 1 = 0 |
| B. | x^3 + x – 1 = 0 |
| C. | x^2 – x – 1 = 0 |
| D. | x^2 + x – 1 = 0 |
| Answer» D. x^2 + x – 1 = 0 | |
| 1646. |
Wireless interconnections to the PSTN are also known as: |
| A. | Localities |
| B. | CLECs |
| C. | POPs |
| D. | IXCs |
| Answer» D. IXCs | |
| 1647. |
An example of a non-adaptive routing algorithm is: |
| A. | Shortest path routing |
| B. | Centralised routing |
| C. | Baran’s hot potato routing |
| D. | Baran’s backward learning algorithm |
| Answer» B. Centralised routing | |
| 1648. |
What services does the internet layer provide?1. Quality of service2. Routing3. Addressing4. Connection oriented delivery5. Framing bits |
| A. | 1, 2, 3 |
| B. | 2, 3, 4 |
| C. | 1, 3, 4, 5 |
| D. | 2, 3, 4, 5 |
| Answer» B. 2, 3, 4 | |
| 1649. |
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 |
| Answer» E. | |
| 1650. |
After sending a message, the sender should not be able to, at a later date, deny having sent the message, is referred to as: |
| A. | Authenticity |
| B. | Non-Repudiability |
| C. | Auditability |
| D. | Repudiability |
| Answer» C. Auditability | |