UGC NET CS 2014 Dec - paper-3

Question 1
A hierarchical memory system that uses cache memory has cache access time of 50 nano seconds, main memory access time of 300 nanoseconds, 75% of memory requests are for read, hit ratio of 0.8 for read access and the write-through scheme is used. What will be the average access time of the system both for read and write requests ?
A
157.5 n.sec.
B
110 n.sec.
C
75 n.sec
D
82.5 n.sec.
       Computer-Organization       Memory-hierarchy
Question 1 Explanation: 
Avg. time to read the data = 0.8(50) + 0.2(300+50) = 40 + 70 = 110 ns
Avg. memory access time = (Seq. of data read request * time to read data) + (freq. Of data write request * time to write the data)
= (0.75 × 110) + (0.25 × 300)
⤿Since write through is mentioned in question. So write operation will take place in memory and not in cache.
= 82.5 + 75.0
= 157.5 ns
Question 2
For switching from a CPU user mode to supervisor mode following type of interrupt is most appropriate
A
Internal interrupts
B
External interrupts
C
Software interrupts
D
None of the above
       Computer-Organization       Interrupts
Question 2 Explanation: 
Software interrupt is caused either by an exceptional condition in the processor itself, or a special instruction in the instruction set which causes an interrupt when it is executed.
It is used for switching from a CPU user mode to supervisor mode.
Software interrupts is internal interrupt triggered by some software instruction.
There are 8 software interrupts in 8085 microprocessor. They are – RST 0, RST 1, RST 2, RST 3, RST 4, RST 5, RST 6, RST 7.
External interrupt: External interrupts are the interrupts caused by the hardware module. pressing a key on the keyboard or moving the mouse triggers hardware interrupts that cause the processor to read the keystroke or mouse position.
Question 3
In a dot matrix printer to print a character is 6 m.sec., time to space in between characters is 2 m.sec., and the number of characters in a line are 200. The printing speed of the dot matrix printer in characters per second and the time to print a character line are given by which of the following options ?
A
125 chars/second and 0.8 seconds
B
250 chars/second and 0.6 seconds
C
166 chars/second and 0.8 seconds
D
250 chars/second and 0.4 seconds
E
None of the above
       Computer-Organization       Graphics
Question 3 Explanation: 
If we have 3 characters then the space between two characters will be 2. It means if we have “n” characters in a line then the number of spaces in the line will be “(n-1)”.
So, the time to print a character line = (200*6)+(199*2)
= 1598 ms
= 1598*10-3 second
= 1.59 seconds
Printing speed of the dot matrix printer in characters per second
= 200/ 1.59 character per second
= 125.78 character per second
Question 4
A
a-iv, b-i, c-iii, d-ii
B
a-iii, b-ii, c-i, d-iv
C
a-ii, b-iii, c-i, d-iv
D
a-ii, b-iv, c-i, d-iii
       Computer-Organization       Flags
Question 4 Explanation: 
XCNG: Exchange instruction does not change any flag.
SUB: Subtraction instruction will change all the flags.
STC: Set carry instruction will affect the carry flag only.
DCR: Decrement instruction will decrease the value hence it will effect all flags but not carry flag.
Question 5
How many times will the following loop be executed ? LXI B, 0007 H LOP : DCX B MOV A, B ORA C JNZ LOP
A
05
B
07
C
09
D
00
       Computer-Organization       Machine-Instructions
Question 5 Explanation: 
LXI B, 0007 H // Load register pair B with value (00)H and C with value (07)H
LOP :
DCX B // Decrement register pair BC i.e. decrease C because B is already 0.
MOV A, B // Move value of B to A. It means A is 0 after first iteration of loop LOP.

ORA C // It means perform OR operation between register A and C and store the result into register A. So A = (06)H after first iteration of loop.
JNZ LOP // Jump to LOP if it is not zero.

So this way LOP will be executed 7 times.
Question 6
Specify the contents of the accumulator and the status of the S, Z and CY flags when 8085 microprocessor performs addition of 87 H and 79 H.
A
11, 1, 1, 1
B
10, 0, 1, 0
C
01, 1, 0, 0
D
00, 0, 1, 1
       Computer-Organization       Microprocessor
Question 6 Explanation: 

Since MSB of 8-bit result is zero, it means the number is positive. So Sign flag will be “0”.
Since 8-bit result contain zero only so Zero flag will be “1”.
Since addition operation is resulting into a carry so Carry flag will be “1”.
Question 7

Location transparency allows :

I. Users to treat the data as if it is done at one location.

II. Programmers to treat the data as if it is at one location.

III. Managers to treat the data as if it is at one location.

Which one of the following is correct ?
A
I, II and III
B
I and II only
C
II and III only
D
II only
       Computer-Networks       Security
Question 7 Explanation: 
Location Transparency: The name of a file does not reveal any hint of the file's physical storage location i.e. it makes the user, programmers to treat the data as if it is present at one location.
Question 8

Which of the following is correct ?

I. Two phase locking is an optimistic protocol.

II. Two phase locking is pessimistic protocol

III. Time stamping is an optimistic protocol.

IV. Time stamping is pessimistic protocol.
A
I and III
B
II and IV
C
I and IV
D
II and III
       Database-Management-System       Transactions
Question 9
__________ rules used to limit the volume of log information that has to be handled and processed in the event of system failure involving the loss of volatile information
A
Write-ahead log
B
Check-pointing
C
Log buffer
D
Thomas
       Database-Management-System       Transactions
Question 9 Explanation: 
Write-Ahead Log: When in-place updating is used, it is necessary to use a log for recovery. In this case, the recovery mechanism must ensure that the before image of the data item is recorded in the appropriate log entry and that the log entry is flushed to disk before the before image is overwritten with the after image in the database on disk. This process is generally known as write-ahead logging.
Checkpoint is a mechanism where all the previous logs are removed from the system and stored permanently in a storage disk. Checkpoint declares a point before which the DBMS was inconsistent state, and all the transactions were committed.
Log Buffer: A log buffer is a circular buffer that holds information about changes made to the database.
Question 10
Let R = ABCDE is a relational scheme with functional dependency set F = {A → B, B → C, AC → D}. The attribute closures of A and E are
A
ABCD,ɸ
B
ABCD, E
C
ABC, E
       Database-Management-System       Functional-Dependency
Question 10 Explanation: 
A+ = { A, B, C, D}
E+ = {E}
Question 11

Consider the following statements :

I. Re-construction operation used in mixed fragmentation satisfies commutative rule.

II. Re-construction operation used in vertical fragmentation satisfies commutative rule

Which of the following is correct
A
I
B
II
C
Both are correct
D
None of the statements are correct
       Operating-Systems       Memory-Management
Question 12
Which of the following is false ?
A
Every binary relation is never be in BCNF.
B
Every BCNF relation is in 3NF.
C
1 NF, 2 NF, 3 NF and BCNF are based on functional dependencies.
D
Multivalued Dependency (MVD) is a special case of Join Dependency (JD).
       Database-Management-System       Normalization
Question 13
Which of the following categories of languages do not refer to animation languages ?
A
Graphical languages
B
General-purpose languages
C
Linear-list notations
D
None of the above
       Computer-Organization       Graphics
Question 14
A
a-ii, b-i, c-iv, d-iii
B
a-i, b-iv, c-iii, d-ii
C
a-i, b-ii, c-iii, d-iv
D
a-iv, b-iii, c-ii, d-i
       Computer-Science-General-Aptitude       Computer-Basics
Question 14 Explanation: 
Tablet, joystick are continuous devices.
Light pen and touch screen are direct devices.
Keyboard, locator are logical devices.
Data globe and sonic pen are 3D interaction devices.
Question 15
A technique used to approximate halftones without reducing spatial resolution is known as _________.
A
Halftoning
B
Dithering
C
Error diffusion
D
None of the above
       Computer-Graphics       Dithering
Question 16
Consider a triangle represented by A(0, 0), B(1, 1), C(5, 2). The triangle is rotated by 45 degrees about a point P(–1, –1). The coordinates of the new triangle obtained after rotation shall be _______
A
B
C
D
       Engineering-Mathematics       Co-ordinate-Geometry
Question 16 Explanation: 


Question 17

In Cyrus-Beck algorithm for line clipping the value of t parameter is computed by the relation :

(Here P1 and P2 are the two end points of the line, f is a point on the boundary, n1 is inner normal)
A
(P1 – fi) × ni / (P2 – P1) × ni
B
(fi – P1) × ni / (P2 – P1) × ni
C
(P2 – fi) × ni / (P1 – P2) × ni
D
(fi – P2) × ni / (P1 – P2) × ni
       Computer-Graphics       Cyrus-Beck-Algorithm
Question 18
A
a-i, b-iii, c-iv, d-ii
B
a-ii, b-iii, c-i, d-iv
C
a-iv, b-ii, c-iii, d-i
D
a-i, b-ii, c-iii, d-iv
       Computer-Graphics       Projections
Question 18 Explanation: 
Cavalier Projection: The direction of projection is chosen so that there is no foreshortening of lines perpendicular to the xy plane.
Cabinet Projection: The direction of projection is chosen so that lines perpendicular to the xy planes are foreshortened by half their lengths.
Isometric Projection: The direction of projection makes equal angles with all of the principal axis.
Orthographic Projection: Projections are characterized by the fact that the direction of projection is perpendicular to the view plane.
Question 19

Consider the following statements S1, S2 and S3 :

S1 : In call-by-value, anything that is passed into a function call is unchanged in the caller’s scope when the function returns.

S2 : In call-by-reference, a function receives implicit reference to a variable used as argument.

S3 : In call-by-reference, caller is unable to see the modified variable used as argument.
A
S3 and S2 are true.
B
S3 and S1 are true.
C
S2 and S1 are true.
D
S1, S2, S3 are true.
       Programming       Functions
Question 20

How many tokens will be generated by the scanner for the following statement ?

x = x * (a + b) – 5;
A
12
B
11
C
10
D
07
       Compiler-Design       Lexical-Analyzer
Question 20 Explanation: 
Question 21
Which of the following statements is not true ?
A
MPI_Isend and MPI_Irecv are non-blocking message passing routines of MPI.
B
MPI_Issend and MPI_Ibsend are non-blocking message passing routines of MPI.
C
MPI_Send and MPI_Recv are non-blocking message passing routines of MPI.
D
MPI_Ssend and MPI_Bsend are blocking message passing routines of MPI.
       Operating-Systems       Inter-Process-Communication
Question 22

Given two languages :

L1 = {(ab)n ak | n > k, k ≥ 0}

L2 = {an bm | n ≠ m}

Using pumping lemma for regular language, it can be shown that
A
L1 is regular and L2 is not regular.
B
L1 is not regular and L2 is regular.
C
L1 is regular and L2 is regular.
D
L1 is not regular and L2 is not regular.
       Theory-of-Computation       Regular-Language
Question 22 Explanation: 

Pumping lemma is used to tell that a language is not regular.

If a language pass the pumping lemma test then we can’t say whether the language is regular or not but if a language fails to pass pumping lemma test then we can definitely say that the language is not regular.

And Here L1 and L2 both failed to pass pumping lemma test so we can say that L1 and L2 both are not regular languages.
Question 23
Regular expression for the complement of language L = {an bm | n ≥ 4, m ≤ 3} is
A
(a + b)* ba(a + b)*
B
a* bbbbb*
C
None of the above
       Theory-of-Computation       Regular-Expression
Question 23 Explanation: 
L= { aaaa, aaaab,aaaab,aaaabb,aaaabbb,aaaaa,..............}
Option (A) is incorrect because the smallest string it can generate is “ba” which does not belong to L.
Option (B) is incorrect because the smallest string it can generate is “bbbb” which does not belong to L.
Option (C) is incorrect because the smallest string it can generate is “λ” which does not belong to L.
Regular expression for given language L is aaaaa*(λ +b+bb+bbb)
Hence option(D) is the correct answer.
Question 24
For n devices in a network, ________ number of duplex-mode links are required for a mesh topology.
A
n(n + 1)
B
n (n – 1)
C
n(n + 1)/2
D
n(n – 1)/2
       Computer-Networks       Topologies
Question 24 Explanation: 
In a duplex mode network, if there are n nodes in the network then each node will be connected with the remaining (n-1) nodes. So this way the total number of links will be n(n-1). And since for communication between any two nodes we don’t need two links, they can communicate using a single link between them so the same way we need [n(n-1)]/2 links in a fully connected network.
Ex: Take n=5
Method-1: n(n-1)/2
= 5(5-1)/2
= 20/2
= 10
Method-2: below we are having a fully connected network of 5 nodes. And in this network number of links is 10 and [n(n-1)]/2 is the only equation calculating correctly the number of links in a fully connected network.
Question 25
How many characters per second (7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is asynchronous ? (Assuming 1 start bit and 1 stop bit)
A
300
B
320
C
360
D
400
       Computer-Organization       Synchronous-and-asynchronous-Communication
Question 25 Explanation: 
To send a 8-bit character, 1 start bit and one end bit will also be sent. So the number of bits sent per character are 10.
Bandwidth = 3200bps
It means 3200 bits can be sent---------> 1sec
So the number of characters that can be sent in 1sec = 3200/10 characters
= 320 characters
Question 26
Which of the following is not a field in the TCP header ?
A
Sequence number
B
Fragment offset
C
Checksum
D
Window size
       Computer-Networks       TCP
Question 26 Explanation: 
Question 27
What is the propagation time if the distance between the two points is 48,000 ? Assume the propagation speed to be 2.4 × 108 metre/second in cable.
A
0.5 ms
B
20 ms
C
50 ms
D
200 ms
E
None of the above
       Computer-Networks       Transmission-and-Propagation-Delay
Question 27 Explanation: 
We can’t calculate propagation time because the unit of distance is not given.
Question 28
__________ is a bit-oriented protocol for communication over point-to-point and multipoint links.
A
Stop-and-wait
B
HDLC
C
Sliding window
D
Go-back-N
       Computer-Networks       Flow-Control-Methods
Question 28 Explanation: 
High-Level Data Link Control (HDLC) is a bit-oriented code-transparent synchronous data link layer protocol developed by the International Organization for Standardization (ISO).
HDLC provides both connection-oriented and connectionless service.
HDLC can be used for point-to-multipoint connections
Question 29
Which one of the following is true for asymmetric-key cryptography ?
A
Private key is kept by the receiver and public key is announced to the public.
B
Public key is kept by the receiver and private key is announced to the public.
C
Both private key and public key are kept by the receiver.
D
Both private key and public key are announced to the public.
       Computer-Networks       Network-Security
Question 30
A
a-iv, b-ii, c-i, d-iii
B
a-ii, b-iv, c-i, d-iii
C
a-iv, b-ii, c-iii, d-i
D
a-iii, b-ii, c-iv, d-i
       Algorithms       Time-Complexity
Question 31
We can show that the clique problem is NP-hard by proving that
A
CLIQUE ≤ P 3-CNF_SAT
B
CLIQUE ≤ P VERTEX_COVER
C
CLIQUE ≤ P SUBSET_SUM
D
None of the above
       Algorithms       P-NP
Question 32
Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _________
A
Greedy algorithm, Divide-conquer algorithm
B
Divide-conquer algorithm, Greedy algorithm
C
Greedy algorithm, Dynamic programming algorithm
D
Dynamic programming algorithm, Greedy algorithm
       Algorithms       Algorithm-Paradigms
Question 32 Explanation: 
Dijkstra algorithm, which solves the single-source shortest--paths problem, is a Greedy Algorithm, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a Dynamic programming algorithm.
Question 33
Consider the problem of a chain < A1, A2, A3> of three matrices. Suppose that the dimensions of the matrices are 10 × 100, 100 × 5 and 5 × 50 respectively. There are two different ways of parenthesization : (i) ((A1 A2)A3) and (ii) (A1(A2 A3)). Computing the product according to the first parenthesization is ________ times faster in comparison to the second parenthesization.
A
5
B
10
C
20
D
100
       Algorithms       Dynamic-Programming
Question 33 Explanation: 

Question 34
Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?
A
4, 254, 403, 400, 332, 346, 399, 365
B
926, 222, 913, 246, 900, 260, 364, 365
C
927, 204,913, 242, 914, 247, 365
D
4, 401, 389, 221, 268, 384, 383, 280, 365
       Data-Structures       Binary-search-tree
Question 34 Explanation: 
Option A:



Question 35
Which methods are utilized to control the access to an object in multi-threaded programming ?
A
Asynchronized methods
B
Synchronized methods
C
Serialized methods
D
None of the above
       OOPS       Multithreading
Question 36
How to express that some person keeps animals as pets ?
A
B
C
D
       OOPS       Properties
Question 37
Converting a primitive type data into its corresponding wrapper class object instance is called
A
Boxing
B
Wrapping
C
Instantiation
D
Autoboxing
       OOPS       Class-and-object
Question 38
The behaviour of the document elements in XML can be defined by
A
Using document object
B
Registering appropriate event handlers
C
Using element object
D
All of the above
       Web-Technologies       XML
Question 39
What is true about UML stereotypes ?
A
Stereotype is used for extending the UML language.
B
Stereotyped class must be abstract
C
The stereotype indicates that the UML element cannot be changed
D
UML profiles can be stereotyped for backward compatibility
       Web-Technologies       UML
Question 40
Which method is called first by an applet program ?
A
start( )
B
run( )
C
init( )
D
begin( )
       OOPS       JAVA
Question 40 Explanation: 
Init() method is called first by an applet program. In this method variables are declared and initialized. This method is invoked only once during the lifetime of the applet.
Question 41
Which one of the following is not a source code metrics ?
A
Halstead metric
B
Function point metric
C
Complexity metric
D
Length metric
       Software-Engineering       Functional-Points
Question 42

To compute function points (FP), the following relationship is used

FP = Count – total × (0.65 + 0.01 × Σ(Fi)) where Fi (i = 1 to n) are value adjustment

factors (VAF) based on n questions. The value of n is
A
12
B
14
C
16
D
18
       Software-Engineering       Functional-Points
Question 42 Explanation: 
FP = Count – total × (0.65 + 0.01 × Σ(Fi )) where Fi (i = 1 to 14) are value adjustment factors(VAF) based on 14 questions.
Question 43

Assume that the software team defines a project risk with 80% probability of occurrence of risk in the following manner :

Only 70 percent of the software components scheduled for reuse will be integrated into the application and the remaining functionality will have to be custom developed. If 60 reusable components were planned with average component size as 100 LOC and software engineering cost for each LOC as $ 14, then the risk exposure would be
A
$ 25,200
B
$ 20,160
C
$ 17,640
D
$ 15,120
       Software-Engineering       Software-configuration-management
Question 43 Explanation: 
Risk Exposure(RE) = P × C
Where, P= Probability of occurrence of risk
C= Cost of risk
Only 70 percent of the software components scheduled for reuse will be integrated into the application .
It means 30% of total 60 reusable components have to be custom developed i.e. 60 ×(30/100) = 18.
18 components will be developed. Now Average component size is 100 LOC and cost of each LOC is $14.
So cost of risk = 18×100×14
= 25200
Risk Exposure(RE) = 0.8 ×25200
= 20160
Question 44
Maximum possible value of reliability is
A
100
B
10
C
1
D
0
       Software-Engineering       Software-Reliabiliy
Question 44 Explanation: 
Reliability of a software can be defined as its ability to perform an operation for a specified period of time in a specified environment. It varies from 0 to 1.
Question 45
‘FAN IN’ of a component A is defined as
A
Count of the number of components that can call, or pass control, to a component A
B
Number of components related to component A
C
Number of components dependent on component A
D
None of the above
       Software-Engineering       FAN-IN-AND-OUT
Question 45 Explanation: 
FAN-IN: FAN-IN counts the number of components that can call, or pass control, to a component.
Question 46
Temporal cohesion means
A
Coincidental cohesion
B
Cohesion between temporary variables
C
Cohesion between local variables
D
Cohesion with respect to time
       Software-Engineering       Coupling-and-Cohesion
Question 46 Explanation: 
Temporal cohesion: When a module contains tasks that are related by the fact that all must be executed with the same span of time, the module exhibits temporal cohesion.
Question 47
Various storage devices used by an operating system can be arranged as follows in increasing order of accessing speed :
A
Magnetic tapes → magnetic disks → optical disks → electronic disks → main memory → cache → registers
B
Magnetic tapes → magnetic disks → electronic disks → optical disks → main memory → cache → registers
C
Magnetic tapes → electronic disks → magnetic disks → optical disks → main memory → cache → registers
D
Magnetic tapes → optical disks → magnetic disks → electronic disks → main memory → cache → registers
       Operating-Systems       Types of storage devices
Question 47 Explanation: 
Question 48
How many disk blocks are required to keep list of free disk blocks in a 16 GB hard disk with 1 kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in 32 bits.
A
1024 blocks
B
16794 blocks
C
20000 blocks
D
1048576 blocks
E
None of the above
       Operating-Systems       File system
Question 49
Consider an imaginary disk with 40 cylinders. A request come to read a block on cylinder 11. While the seek to cylinder 11 is in progress, new requests come in for cylinders 1, 36, 16, 34, 9 and 12 in that order. The number of arm motions using shortest seek first algorithm is
A
111
B
112
C
60
D
61
       Operating-Systems       Disk-Scheduling
Question 49 Explanation: 
Question 50
An operating system has 13 tape drives. There are three processes P1, P2 & P3. Maximum requirement of P1 is 11 tape drives, P2 is 5 tape drives and P3 is 8 tape drives. Currently, P1 is allocated 6 tape drives, P2 is allocated 3 tape drives and P3 is allocated 2 tape drives. Which of the following sequences represent a safe state ?
A
P2 P1 P3
B
P2 P3 P1
C
P1 P2 P3
D
P1 P3 P2
       Operating-Systems       Deadlock
Question 50 Explanation: 
Question 51
Monitor is an Interprocess Communication (IPC) technique which can be described as
A
It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package.
B
It is a non-negative integer which apart from initialization can be acted upon by wait and signal operations
C
It uses two primitives, send and receive which are system calls rather than language constructs.
D
It consists of the IPC primitives implemented as system calls to block the process when they are not allowed to enter critical region to save CPU time.
       Operating-Systems       Inter-Process-Communication
Question 51 Explanation: 
Interprocess Communication (IPC) refers specifically to the mechanisms an operating system provides to allow the processes to manage shared data. It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package.
Semaphores: It is a non-negative integer which apart from initialization can be acted upon by wait and signal operations.
Message Passing: It uses two primitives, send and receive which are system calls rather than language constructs.
Question 52
In a distributed computing environment, distributed shared memory is used which is
A
Logical combination of virtual memories on the nodes.
B
Logical combination of physical memories on the nodes.
C
Logical combination of the secondary memories on all the nodes.
D
All of the above
       Computer-Organization       Memory-hierarchy
Question 52 Explanation: 
Distributed Shared Memory (DSM) is a form of memory architecture where physically separated memories can be addressed as one logically shared address space. Here, the term "shared" does not mean that there is a single centralized memory, but that the address space is "shared" (same physical address on two processors refers to the same location in memory)
Question 53

Equivalent logical expression for the Well Formed Formula (WFF),

~(∀x) F[x]

is
A
∀x (~F[x])
B
~(∃x) F[x]
C
∃x (~F[x])
D
∀x F[x]
       Engineering-Mathematics       Propositional-Logic
Question 53 Explanation: 
~(∀x) F[x] = ∃x (~F[x])
Question 54
An A* algorithm is a heuristic search technique which
A
is like a depth-first search where most promising child is selected for expansion
B
generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost.
C
saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion.
D
none of the above
       Artificial-intelligence       AO* -algorithm
Question 55

The resolvent of the set of clauses

(A v B, ~A v D, C v ~B) is
A
A v B
B
C v D
C
A v C
D
A v D
       Engineering-Mathematics       Propositional-Logic
Question 56
A
a-iv, b-ii, c-i, d-iii
B
a-iv, b-iii, c-ii, d-i
C
a-ii, b-iii, c-iv, d-i
D
a-i, b-iii, c-iv, d-ii
       Computer-Science-General-Aptitude       Computer-Basics
Question 57
A
a-i, b-iii, c-iv, d-ii
B
a-iv, b-iii, c-i, d-ii
C
a-i, b-iii, c-ii, d-iv
D
a-iv, b-i, c-iii, d-ii
       Artificial-intelligence       Knowledge-representation
Question 58

A computer based information system is needed :

I. as it is difficult for administrative staff to process data.

II. due to rapid growth of information and communication technology.

III. due to the growing size of organizations which need to process large volumes of data.

IV. as timely and accurate decisions are to be taken.

Which of the above statement(s) is/are true ?
A
I and II
B
III and IV
C
II and III
D
II and IV
       Database-Management-System       MIS
Question 59
Given the recursively enumerable language (LRE), the context sensitive language (LCS), the recursive language (LREC), the context free language (LCF) and deterministic context free language (LDCF). The relationship between these families is given by
A
LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC
B
LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE
C
LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC
D
LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE
       Theory-of-Computation       Languages-and-Grammars
Question 59 Explanation: 
Question 60
A
a-ii, b-iv, c-iii, d-i
B
a-ii, b-iv, c-i, d-iii
C
a-iv, b-i, c-ii, d-iii
D
a-i, b-iv, c-iii, d-ii
       Theory-of-Computation       Languages-and-Grammars
Question 60 Explanation: 
Question 61

According to pumping lemma for context free languages :

Let L be an infinite context free language, then there exists some positive integer m such

that any w ∈ L with | w | ≥ m can be decomposed as w = u v x y z
A
with | vxy | ≤ m such that uvi xyi z ∈ L for all i = 0, 1, 2
B
with | vxy | ≤ m, and | vy | ≥ 1, such that uvi xyi z ∈ L for all i = 0, 1, 2, …….
C
with | vxy | ≥ m, and | vy | ≤ 1, such that uvi xyi z ∈ L for all i = 0, 1, 2, …….
D
with | vxy | ≥ m, and | vy | ≥ 1, such that uvi xyi z ∈ L for all i = 0, 1, 2, …….
       Theory-of-Computation       Context-Free-Language
Question 61 Explanation: 
Let L be an infinite context free language, then there exists some positive integer m such that any w ∈ L with | w | ≥ m can be decomposed as w = u v x y z with | vxy | ≤ m, and | vy | ≥ 1, such that uvi xy i z ∈ L for all i = 0, 1, 2, …….
Question 62
Given two spatial masks

The Laplacian of an image at all points (x, y) can be implemented by convolving the image with spatial mask. Which of the following can be used as the spatial mask ?
A
only S1
B
only S2
C
Both S1 and S2
D
None of these
       Image-Processing       convolution
Question 63
Given a simple image of size 10 × 10 whose histogram models the symbol probabilities and is given by

The first order estimate of image entropy is maximum when
A
a = 0, b = 0, c = 0, d = 1
B
a =1/2, b =1/2, c = 0, d = 0
C
a =1/3, b =1/3, c =1/3, d = 0
D
a =1/4, b =1/4, c =1/4, d =1/4
       Image-Processing       Entropy
Question 64
A Butterworth lowpass filter of order n, with a cutoff frequency at distance D0 from the origin, has the transfer function H(u, v) given by
A
B
C
D
       Image-Processing       Filters
Question 65
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is
A
Optimum
B
Infeasible
C
Unbounded
D
Degenerate
       LPP       Simplex
Question 66
The occurrence of degeneracy while solving a transportation problem means that
A
total supply equals total demand
B
total supply does not equal total demand
C
the solution so obtained is not feasible
D
none of these
       LPP       Transportation-Problem
Question 66 Explanation: 
The occurrence of degeneracy while solving a transportation problem means that the solution so obtained is not feasible.
Question 67
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :

Find out the minimum time required to complete all the jobs.
A
5
B
11
C
13
D
15
       LPP       Assignment-Problem
Question 68

Consider the following statements about a perception :

I. Feature detector can be any function of the input parameters
.
II. Learning procedure only adjusts the connection weights to the output layer.

Identify the correct statement out of the following :
A
I is false and II is false.
B
I is true and II is false.
C
I is false and II is true.
D
I is true and II is true.
       Artificial-intelligence       Perceptron
Question 69
A
a-i, b-ii, c-iii, d-iv
B
a-i, b-iii, c-ii, d-iv
C
a-ii, b-iv, c-iii, d-i
D
a-ii, b-iii, c-iv, d-i
       Artificial-intelligence       Supervised-And-Unsupervised-Learning
Question 70
Which of the following versions of Windows O.S. contain built-in partition manager, which allows us to shrink and expand pre-defined drives ?
A
Windows Vista
B
Windows 2000
C
Windows NT
D
Windows 98
       Operating-Systems       Windows-Operating-System
Question 70 Explanation: 
Windows Vista contain built-in partition manager which allows us to shrink and expand pre-defined drives
Question 71
A Trojan horse is
A
A program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefarious purposes like attacks on message security or impersonation.
B
A piece of code that can attach itself to other programs in the system and spread to other systems when programs are copied or transferred.
C
A program that spreads to other computer systems by exploiting security holes like weaknesses in facilities for creation of remote processes
D
All of the above
       Computer-Networks       Security
Question 71 Explanation: 
Trojan horse: It is a program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefarious purposes like attacks on message security or impersonation. Virus: A piece of code that can attach itself to other programs in the system and spread to other systems when programs are copied or transferred. Worm: A program that spreads to other computer systems by exploiting security holes like weaknesses in facilities for creation of remote processes
Question 72
Which of the following computing models is not an example of distributed computing environment ?
A
Cloud computing
B
Parallel computing
C
Cluster computing
D
Peer-to-peer computing
       Database-Management-System       Distributed-Computing
Question 72 Explanation: 
Parallel computing is a type of computation in which many calculations or the execution of processes are carried out simultaneously. Large problems can often be divided into smaller ones, which can then be solved at the same time. Parallel computers can be roughly classified according to the level at which the hardware supports parallelism, with multi-core and multi-processor computers having multiple processing elements within a single machine.
Cloud computing is the on-demand availability of computer system resources, especially data storage and computing power, without direct active management by the user. The term is generally used to describe data centers available to many users over the Internet. Large clouds, predominant today, often have functions distributed over multiple locations from central servers.
There are 72 questions to complete.