UGC NET CSA JUNE 2015 Paper-3

Q1➡ |
For the 8 – bit word 00111001, the check bits stored with it would be 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory?

i ➥ 10011001

ii ➥ 00011001

iii ➥ 00111000

iv ➥ 11000110

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Number systems

Help-Line

Q2➡ |
Consider a 32 – bit microprocessor, with a 16 – bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor?

i ➥ 8 × 10 ⁶ bytes/sec

ii ➥ 4 × 10 ⁶ bytes/sec

iii ➥ 16 × 10 ⁶ bytes/sec

iv ➥ 4 × 10 ⁶ bytes/sec

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Microprocessor

Help-Line

Q3➡ |
The RST 7 instruction in 8085 microprocessor is equivalent to:

i ➥ CALL 0010 H

ii ➥ CALL 0034 H

iii ➥ CALL 0038 H

iv ➥ CALL 003C H

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Microprocessor

Help-Line

Q4➡ |
The equivalent hexadecimal notation for octal number 2550276 is:

i ➥ FADED

ii ➥ AEOBE

iii ➥ ADOBE

iv ➥ ACABE

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Number systems

Help-Line

Q5➡ |
The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memory read/ write employs one machine cycle. For execution of the programs, the system utilizes 90 percent of the CPU time. For block data transfer, an IO device is attached to the system while CPU executes the background programs continuously. What is the maximum IO data transfer rate if programmed IO data transfer technique is used?

i ➥ 500 Kbytes/sec

ii ➥ 2.2 Mbytes/sec

iii ➥ 125 Kbytes/sec

iv ➥ 250 Kbytes/sec

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Microprogrammed control unit

Help-Line

Q6➡ |
The number of flip-flops required to design a modulo – 272 counter is:

i ➥ 8

ii ➥ 9

iii ➥ 27

iv ➥ 11

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Sequential circuits

Help-Line

Q7➡ |
Let E 1 and E 2 be two entities in E-R diagram with simple single valued attributes. R₁ and R ₂ are two relationships between E ₁ and E ₂ where R ₁ is one – many and R ₂ is many – many. R ₁ and R ₂ do not have any attributes of their own. How many minimum number of tables are required to represent this situation in the Relational Model?

i ➥ 4

ii ➥ 3

iii ➥ 2

iv ➥ 1

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

ER-Model

Help-Line

Q8➡ |
The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks, DEPT_Name) Consider the following SQL Query SELECT DEPT_Name from STUDENT where SEX = ‘M’ group by DEPT_Name having avg (Marks)>SELECT avg (Marks) from STUDENT. It Returns the Name of the Department for which:

i ➥ The Average marks of Male students is more than the average marks of students in the same Department

ii ➥ The average marks of male students is more than the average marks of students in the University

iii ➥ The average marks of male students is more than the average marks of male students in the University

iv ➥ The average marks of students is more than the average marks of male students in the University

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Learn Topic Wise

Help-Line

Q9➡ |
Select the ‘False’ statement from the following statements about Normal Forms:

i ➥ Lossless preserving decomposition into 3NF is always possible

ii ➥ Lossless preserving decomposition into BCNF is always possible

iii ➥ Any Relation with two attributes is in BCNF

iv ➥ BCNF is stronger than 3NF

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Normalization

Help-Line

Q10➡ |
The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because:

i ➥ Non_key attribute V_name is dependent on V_no which is part of composite key

ii ➥ Non_key attribute V_name is dependent on Qty_sup

iii ➥ Key attribute Qty_sup is dependent on primary_key unit price

iv ➥ None of the above

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Normalization

Help-Line

Q11➡ |
The relation schemas R ₁ and R ₂ form a Lossless join decomposition of R if and only if:
R ₁ ∩ R ₂ ↠ (R ₁ – R ₂ )
R ₁ → R ₂
R ₁ ∩ R ₂ ↠ (R ₂ – R ₁ )
(R ₂ → R ₁ ) ∩ R ₂

i ➥ (a) and (b) happens

ii ➥ (a) and (d) happens

iii ➥ (a) and (c) happens

iv ➥ (b) and (c) happens

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Functional dependency

Help-Line

Q12➡ |
In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:

i ➥ The number of blocks used for index and the size of index

ii ➥ Size of Blocks and size of Address

iii ➥ Size of index

iv ➥ Size of Block

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

File system

Help-Line

Q13➡ |
Give the number of principal vanishing point(s) along with their direction for the standard perspective transformation:

i ➥ Only one in the direction K

ii ➥ Two in the directions I and J

iii ➥ Three in the directions I, J and K

iv ➥ Only two in the directions J and K

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Transformations

Help-Line

Q14➡ |
Consider a triangle A(0,0), B(1,1) and C(5,2). The triangle has to be rotated by an angle of 45 about the point P(-1, -1). What shall be the coordinates of the new triangle?

i ➥

ii ➥

iii ➥

iv ➥

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Co-ordinate geometry

Help-Line

Q15➡ |
The process of dividing an analog signal into a string of discrete outputs, each of constant amplitudes, is called:

i ➥ Strobing

ii ➥ Amplification

iii ➥ Conditioning

iv ➥ Quantization

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Signals

Help-Line

Q16➡ |
Which of the following is not a basic primitive of the Graphics Kernel System (GKS)?

i ➥ POLYLINE

ii ➥ POLYDRAW

iii ➥ FILL AREA

iv ➥ POLYMARKER

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Graphics

Help-Line

Q17➡ |
Which of the following statement(s) is/are incorrect ?

i ➥ Mapping the coordinates of the points and lines that form the picture into the appropriate coordinates on the device or workstation is known as viewing transformation.

ii ➥ The coordinate system that corresponds to the device or workstation where the image is to be displayed is known as physical device coordinate system

iii ➥ The right-handed cartesian coordinates system in whose coordinates we describe the picture is known as world coordinate system.

iv ➥ Left – handed coordinate system in which the display area of the virtual display device corresponds to the unit (|x|) square whose lower left-hand corner is at the origin of the coordinate system, is known as normalized device coordinate system.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Co-ordinate geometry

Help-Line

i ➥ (i), (b)-(ii), (c)-(iii), (d)-(iv), (e)-(v)

ii ➥ (ii), (b)-(iii), (c)-(i), (d)-(iv), (e)-(v)

iii ➥ (iii), (b)-(i), (c)-(ii), (d)-(v), (e)-(iv)

iv ➥ (iv), (b)-(v), (c)-(i), (d)-(ii), (e)-(iii)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Display system

Help-Line

Q19➡ |
Minimal deterministic finite automaton for the language L = {0 n | n ≥ 0, n ≠ 4} will have:

i ➥ 1 final state among 5 states

ii ➥ 4 final states among 5 states

iii ➥ 1 final state among 6 states

iv ➥ 5 final states among 6 states

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Finite automata

Help-Line

Q20➡ |
The regular expression corresponding to the language L where L = { x ε {0, 1}*|x ends with 1 and does not contain substring 00 } is:

i ➥ (1 + 01) * (10 + 01)

ii ➥ (1 + 01) * 01

iii ➥ (1 + 01) * (1 + 01)

iv ➥ (10 + 01) * 01

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Regular expression

Help-Line

Q21➡ |

i ➥ q ₀ and q ₀ respectively

ii ➥ q ₀ and q ₁ respectively

iii ➥ q ₀ and q ₂ respectively

iv ➥ q ₀ and q ₃ respectively

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Finite automata

Help-Line

Q22➡ |
The clausal form of the disjunctive normal form ¬A ∨ ¬B ∨ ¬C ∨ D is:

i ➥ A ∧ B ∧ C ⇒ D

ii ➥ A ∨ B ∨ C ∨ D ⇒ true

iii ➥ A ∧ B ∧ C ∧ D ⇒ true

iv ➥ A ∧ B ∧ C ∧ D ⇒ false

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Propositional logic

Help-Line

Q23➡ |
Which of the following is false for the programming language PROLOG?

i ➥ A PROLOG variable can only be assigned to a value once

ii ➥ PROLOG is a strongly typed language

iii ➥ The scope of a variable in PROLOG is a single clause or rule

iv ➥ The scope of a variable in PROLOG is a single query

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

PROLOG

Help-Line

Q24➡ |
Which one of the following is true?

i ➥ The resolvent of two Horn clauses is not a Horn clause

ii ➥ The resolvent of two Horn clauses is a Horn clause

iii ➥ If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or non-null goal

iv ➥ If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Horn clause

Help-Line

Q25➡ |
Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender?

i ➥ Broadcasting

ii ➥ Unicasting

iii ➥ Packet switching

iv ➥ Circuit switching

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Transmission techniques

Help-Line

Q26➡ |
Which of the following control fields in the TCP header is used to specify whether the sender has no more data to transmit?

i ➥ FIN

ii ➥ RST

iii ➥ SYN

iv ➥ PSH

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

TCP/IP

Help-Line

Q27➡ |
Which are the two modes of IP security?

i ➥ Transport and certificate

ii ➥ Transport and tunnel

iii ➥ Certificate and tunnel

iv ➥ Pre Shared and transport

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

IP header

Help-Line

Q28➡ |
A message “COMPUTERNETWORK” encrypted (ignore quotes) using columnar transposition cipher with a key “LAYER”. The encrypted message is :

i ➥ CTTOEWMROPNRUEK

ii ➥ MROUEKCTTPNROEW

iii ➥ OEWPNRCTTUEKMRO

iv ➥ UEKPNRMROOEWCTT

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Network security

Help-Line

Q29➡ |
Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample requires 8 bits?

i ➥ 32 kbps

ii ➥ 64 kbps

iii ➥ 128 kbps

iv ➥ 256 kbps

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Signals

Help-Line

Q30➡ |
The maximum payload of a TCP segment is:

i ➥ 65,535

ii ➥ 65,515

iii ➥ 65,495

iv ➥ 65,475

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

TCP/IP

Help-Line

Q31➡ |
An all-pairs shortest-paths problem is efficiently solved using:

i ➥ Dijkstra’ algorithm

ii ➥ Bellman-Ford algorithm

iii ➥ Kruskal algorithm

iv ➥ Floyd-Warshall algorithm

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Dynamic programming

Help-Line

Q32➡ |
The travelling salesman problem can be solved in:

i ➥ Polynomial time using dynamic programming algorithm

ii ➥ Polynomial time using branch-and-bound algorithm

iii ➥ Exponential time using dynamic programming algorithm or branch-and-bound algorithm

iv ➥ Polynomial time using backtracking algorithm

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Dynamic programming

Help-Line

Q33➡ |
Which of the following is asymptotically smaller?

i ➥ lg(lg*n)

ii ➥ lg*(lgn)

iii ➥ lg(n!)

iv ➥ lg*(n!)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Asymptotic complexity

Help-Line

Q34➡ |
Consider a hash table of size m = 100 and the hash function h(k) = floor(m(kA mod 1)) for A = frac{(sqrt5 – 1) 2 = 0.618033 Compute the location to which the key k = 123456 is placed in hash table.

i ➥ 77

ii ➥ 82

iii ➥ 88

iv ➥ 89

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Hashing

Help-Line

Q35➡ |
Let f(n) and g(n) be asymptotically nonnegative functions. Which of the following is correct?

i ➥ θ(f(n)*g(n)) = min(f(n), g(n))

ii ➥ θ(f(n)*g(n)) = max(f(n), g(n))

iii ➥ θ(f(n)+g(n)) = min(f(n), g(n))

iv ➥ θ(f(n)+g(n)) = max(f(n), g(n))

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Asymptotic complexity

Help-Line

Q36➡ |
The number of nodes of height ‘h’ in any n-element heap is ______.

i ➥ h

ii ➥ z^h

iii ➥ ⌈n/(z ^h )⌉

iv ➥ ⌈n/z ^h+1 )

Show Answer With Best Explanation

Answer: None of the above
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Heap tree

Help-Line

Q37➡ |
In Java, when we implement an interface method, it must be declared as:

i ➥ Private

ii ➥ Protected

iii ➥ Public

iv ➥ Friend

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Java

Help-Line

Q38➡ |
The Servlet Response interface enables a servlet to formulate a response for a client using the method _______.

i ➥ void log(Exception e, String s)

ii ➥ void destroy( )

iii ➥ int get ServerPort( )

iv ➥ void set ContextType(String type)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Client server application

Help-Line

Q39➡ |
Which one of the following is correct?

i ➥ Java applets can not be written in any programming language

ii ➥ An applet is not a small program

iii ➥ An applet can be run on its own

iv ➥ Applets are embedded in another applications

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Java

Help-Line

Q40➡ |
I n XML we can specify the frequency of an element by using the symbols:

i ➥ +* !

ii ➥ #*!

iii ➥ +*?

iv ➥ -*?

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

XML

Help-Line

Q41➡ |
In XML, DOCTYPE declaration specifies to include a reference to _______ file.

i ➥ Document type Definition

ii ➥ Document type declaration

iii ➥ Document transfer definition

iv ➥ Document type language

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

XML

Help-Line

Q42➡ |
Module design is used to maximize cohesion and minimize coupling. Which of the following is the key to implement this rule?

i ➥ Inheritance

ii ➥ Polymorphism

iii ➥ Encapsulation

iv ➥ Abstraction

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Coupling and cohesion

Help-Line

Q43➡ |
Verification:

i ➥ refers to the set of activities that ensure that software correctly implements a specific function

ii ➥ gives answer to the question – Are we building the product right ?

iii ➥ requires execution of software

iv ➥ both (A) and (B)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Software configuration management

Help-Line

Q44➡ |
Which design metric is used to measure the compactness of the program in terms of lines of code?

i ➥ Consistency

ii ➥ Conciseness

iii ➥ Efficiency

iv ➥ Accuracy

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Software design

Help-Line

Q45➡ |
Requirements prioritisation and negotiation belongs to:

i ➥ Requirements validation

ii ➥ Requirements elicitation

iii ➥ Feasibility study

iv ➥ Requirements reviews

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Software requirements

Help-Line

Q46➡ |
Adaptive maintenance is a maintenance which _______.

i ➥ correct errors that were not discovered till testing phase

ii ➥ is carried out to port the existing software to a new environment.

iii ➥ improves the system performance

iv ➥ both (2) and (3)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Software configuration management

Help-Line

Q47➡ |
A Design concept Refinement is a

i ➥ Top-down approach

ii ➥ Complementary of Abstraction concept

iii ➥ Process of elaboration

iv ➥ All of the above

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Software reliability

Help-Line

Q48➡ |
A software design is highly modular if:

i ➥ cohesion is functional and coupling is data type.

ii ➥ cohesion is coincidental and coupling is data type.

iii ➥ cohesion is sequential and coupling is content type.

iv ➥ cohesion is functional and coupling is stamp type.

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Software design

Help-Line

Q49➡ |
Match the following for operating system techniques with the most appropriate advantages :

i ➥ (a)-(iii), (b)-(i), (c)-(ii), (d)-(iv)

ii ➥ (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)

iii ➥ (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)

iv ➥ (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Match the following

Help-Line

Q50➡ |
Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?

i ➥ Queues have different priorities

ii ➥ Each queue may have different scheduling algorithm

iii ➥ Processes are permanently assigned to a queue

iv ➥ This algorithm can be configured to match a specific system under design

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Process scheduling

Help-Line

Q51➡ |
What is the most appropriate function of Memory Management Unit (MMU)?

i ➥ It is an associative memory to store TLB

ii ➥ It is a technique of supporting multiprogramming by creating dynamic partitions

iii ➥ It is a chip to map virtual address to physical address

iv ➥ It is an algorithm to allocate and deallocate main memory to a process

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Memory management

Help-Line

Q52➡ |
Dining Philosophers problem is a:

i ➥ Producer – consumer problem

ii ➥ Classical IPC problem

iii ➥ Starvation problem

iv ➥ Synchronization primitive

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Process synchronization

Help-Line

Q53➡ |
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.

i ➥ Index

ii ➥ Linked

iii ➥ Contiguous

iv ➥ Bitmap

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

File system

Help-Line

Q54➡ |
A unix file may be of the type:

i ➥ Regular file

ii ➥ Directory file

iii ➥ Device file

iv ➥ Any one of the above

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Unix operating system

Help-Line

Q55➡ |
Match the following :

i ➥ (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)

ii ➥ (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)

iii ➥ (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)

iv ➥ (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Knowledge representation

Help-Line

Q56➡ |
Match the following knowledge representation techniques with their applications :

i ➥ (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)

ii ➥ (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)

iii ➥ (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)

iv ➥ (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Computer science basics

Help-Line

Q57➡ |
In propositional logic P ↔ Q is equivalent to (Where ~ denotes NOT):

i ➥ ~( P ∨ Q ) ∧ ~ ( Q ∨ P )

ii ➥ ( ~P ∨ Q ) ∧ (~ Q ∨ P )

iii ➥ ( P ∨ Q ) ∧ ( Q ∨ P )

iv ➥ ~( P ∨ Q ) → ~ ( Q ∨ P )

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Propositional logic

Help-Line

Q58➡ |
Which of the following statements is true for Branch – and – Bound search?

i ➥ Underestimates of remaining distance may cause deviation from optimal path.

ii ➥ Overestimates can’t cause right path to be overlooked.

iii ➥ Dynamic programming principle can be used to discard redundant partial paths.

iv ➥ All of the above

Show Answer With Best Explanation

Answer: None of the above
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Branch and bound

Help-Line

Q59➡ |
Match the following with respect to heuristic search techniques :

i ➥ (a)-(i), (b)-(iv), (c)-(iii), (d)-(ii)

ii ➥ (a)-(iv), (b)-(i), (c)-(ii), (d)-(iii)

iii ➥ (a)-(i), (b)-(iv), (c)-(ii), (d)-(iii)

iv ➥ (a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Hill climbing algorithm

Help-Line

Q60➡ |
Match the following for methods of MIS development :

i ➥ (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)

ii ➥ (a)-(iv), (b)-(i), (c)-(ii), (d)-(iii)

iii ➥ (a)-(i), (b)-(v), (c)-(ii), (d)-(iii)

iv ➥ (a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Software design

Help-Line

Q61➡ |
A context free grammar for L = { w | n₀ (w) > n₁(w) } is given by:

i ➥ S → 0 | 0 S | 1 S S

ii ➥ S → 0 S | 1 S | 0 S S | 1 S S | 0 | 1

iii ➥ S → 0 | 0 S | 1 S S | S 1 S | S S 1

iv ➥ S → 0 S |1 S | 0 | 1

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Context free grammar

Help-Line

Q62➡ |
Given the following two statements:
S 1 :If L 1 and L 2 are recursively enumerable languages over ∑, then L 1 ∪ L 2 and L 2 ∩ L 2 are also recursively enumerable.
S 2 : The set of recursively enumerable languages is countable. Which of the following is correct ?

i ➥ S 1 is correct and S 2 is not correct

ii ➥ S 1 is not correct and S 2 is correct

iii ➥ Both S 1 and S 2 are not correct.

iv ➥ Both S 1 and S 2 are not correct.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Recursive and recursive enumerable language

Help-Line

i ➥ G 1 is ambiguous and G 2 is unambiguous grammars

ii ➥ G 1 is unambiguous and G 2 is ambiguous grammars

iii ➥ both G 1 and G 2 are ambiguous grammars

iv ➥ both G 1 and G 2 are unambiguous grammars

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Context free grammar

Help-Line

Q64➡ |
Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30, and 12/30 respectively. The average Huffman code size in bits per symbol is:

i ➥ 67/30

ii ➥ 70/30

iii ➥ 76/30

iv ➥ 78/30

Show Answer With Best Explanation

Answer: None of the above
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Greedy approach

Help-Line

Q65➡ |
The redundancy in images stems from:

i ➥ pixel decorrelation

ii ➥ pixel correlation

iii ➥ pixel quantization

iv ➥ image size

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Graphics

Help-Line

Q66➡ |
In a binary Hamming Code the number of check digits is r then number of message digits is equal to:

i ➥ 2 ^r – 1

ii ➥ 2 ^r – r – 1

iii ➥ 2 ^r – r + 1

iv ➥ 2 ^r + r – 1

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Number systems

Help-Line

Q67➡ |
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost is equal to the number of:

i ➥ rows or columns

ii ➥ rows + columns

iii ➥ rows + columns – 1

iv ➥ rows + columns + 1

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Assignment problem

Help-Line

Q68➡ |
Consider the following transportation problem:

The initial basic feasible solution of the above transportation problem using Vogel’s Approximation Method (VAM) is given below:

The solution of the above problem.

i ➥ is degenerate solution

ii ➥ is optimum solution

iii ➥ needs to improve

iv ➥ is infeasible solution

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Transportation problem

Help-Line

Q69➡ |
Given the following statements with respect to linear programming problem:
S 1 : The dual of the dual linear programming problem is again the primal problem
S 2 : If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.
S 3 : If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.
Which of the following is true?

i ➥ S 1 and S 2

ii ➥ S 1 and S 3

iii ➥ S 2 and S 3

iv ➥ S 1 , S 2 and S 3

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Duality

Help-Line

Q70➡ |
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

i ➥ {(11, 0.8), ,(13, 1), (15, 1)}

ii ➥ {(11, 0.3), ,(12, 0.5), (13, 1), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}

iii ➥ {(11, 0.3), ,(12, 0.5), (13, 0.6), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}

iv ➥ {(11, 0.3), ,(12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Fuzzy logic

Help-Line

Q71➡ |
Suppose the function y and a fuzzy integer number around – 4 for x are given as y = (x – 3) ² + 2.
Around – 4 = {(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f (Around – 4) is given by:

i ➥ {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)}

ii ➥ {(2, 0.6), (3, 1), (6, 1), (11, 0.3)}

iii ➥ {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)}

iv ➥ {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Fuzzy logic

Help-Line

Q72➡ |
Match the following for unix system calls :

i ➥ (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)

ii ➥ (a)-(iii), (b)-(ii),(c)-(iv), (d)-(i)

iii ➥ (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)

iv ➥ (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Learn Topic Wise

Help-Line

Q73➡ |
WOW32 is a:

i ➥ Win 32 API library for creating processes and threads.

ii ➥ Special kind of file system to the NT namespace.

iii ➥ Kernel – mode objects accessible through Win 32 API

iv ➥ Special execution environment used to run 16 bit Windows applications on 32 – bit machines.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Win32

Help-Line

Q74➡ |
The unix command: $vi file1 file2

i ➥ Edits file1 and stores the contents of file1 in file2

ii ➥ Both files i.e. file1 and file2 can be edited using ‘ex’ command to travel between the files

iii ➥ Both files can be edited using ‘mv’ command to move between the files

iv ➥ Edits file1 first, saves it and then edits file2

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion

Explanation On YouTube

Unix operating system

Help-Line