UGCNET Computer Science December 2013 Paper III

Q1. If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have

(A) feasible solution

(B) alternative solution

(D) no bounded solution at all

Ans .

Explanation :

Q2. Given the problem to maximize f(x), X=(x1,x2,...xn) subject to m number of inequality constraints.
gi(x)≤bi, i=1,2.....,m
including the non-negativity constraints x≥0.
Which one of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at x’ ?

(A) ∂L(X’, λ’, S’)/∂xj = 0, j = 1, 2,...m

(B) λi’[gi(X’)-bi] = 0, i = 1, 2,...m

(D) All of these

Ans .

(D) All of these

Explanation :

Q3. The following Linear Programming problem has:
Max Z = x1+x2
Subject to x1-x2≥0 3x1-x2≤-3 and x1, x2≥0

(A) Feasible solution

(B) No feasible solution

(D) Single point as solution

Ans .

(B) No feasible solution

Explanation :

Q4. Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be

(A) 4, 5

(B) 5, 4

(D) 13, 8

Ans .

(B) 5, 4

Explanation :

Q5. Function points can be calculated by

(A) UFP*CAF

(B) UFP*FAC

(D) UFP*Productivity

Ans .

(A) UFP*CAF

Explanation :
UFP (Unadjusted Function Point)
CAF (Complexity Adjustment Factor)
Function Point FP = UFP*CAF

Q6. Match the following:

(A) iii ii i iv

(B) ii iii i iv

(D) iii ii iv i

Ans .

(B) ii iii i iv

Explanation :

Q7.A process which defines a series of tasks that have the following four primary objectives is known as
1. to identify all items that collectively define the software configuration.
2. to manage changes to one or more of these items.
3. to facilitate the construction of different versions of an application.
4. to ensure that software quality is maintained as the configuration evolves over time.

(A) Software Quality Management Process

(B) Software Configuration Management Process

(D) Software Change Management Process

Ans .

(B) Software Configuration Management Process

Explanation :

Q8. One weakness of boundary value analysis and equivalence partitioning is

(A) they are not effective.

(B) they do not explore combinations of input circumstances.

(D) none of the above

Ans .

(B) they do not explore combinations of input circumstances.

Explanation :

Q9. Which one of the following is not a software myth?

(A) Once we write the program and get it to work, our job is done.

(B) Project requirements continually change, but change can be easily accommodated because software is flexible.

(D) If an organization does not understand how to control software projects internally, it will invariably struggle when it outsources software projects.

Ans .

(D) If an organization does not understand how to control software projects internally, it will invariably struggle when it outsources software projects.

Explanation :

Q10. Match the following with respect to relationship between objects and classes:

(A) iv i ii iii

(B) ii iii iv i

(D) ii iv i iii

Ans .

(A) iv i ii iii

Explanation :

Q11. Match the following style rules for reusability:

(A) iv iii ii i

(B) ii i iv iii

(D) ii iii iv i

Ans .

(A) iv iii ii i

Explanation :

Q12. Which is the protocol for performing RPCs between applications in a language and system independent way?

(A) Hyper Text Transmission Protocol (HTTP)

(B) Simple Network Management Protocol (SNMP)

(D) Simple Mail Transfer Protocol (SMTP)

Ans .

Explanation :

Q13. The document that is used by XSLT to indicate, how to transform the elements of the XML document to another format is

(A) HTML page

(B) DOC type procedure

(D) Stored procedure

Ans .

Explanation :

Q14. Which of the following concepts means adding new concepts to a program as it runs?

(A) Data hiding

(B) Dynamic loading

(D) Dynamic binding

Ans .

(B) Dynamic loading

Explanation :

Q15. Which of the following correctly describes overloading of functions?

(A) Virtual polymorphism

(B) Transient polymorphism

(D) Pseudo polymorphism

Ans .

Explanation :

Q16. Match the following with respect to programming languages:

(A) iii iv i ii

(B) iv iii ii i

(D) ii iii iv i

Ans .

(A) iii iv i ii

Explanation :

Q17. The compiler converts all operands upto the type of the largest operand is called

(A) Type Promotion

(B) Type Evaluation

(D) Type Declaration

Ans .

(A) Type Promotion

Explanation :

Q18. C++ actually supports the following two complete dynamic allocation systems:

(A) One defined by C++ and the other not defined by C.

(B) One defined by C and one specific to C++.

(D) Both of them are improvements of C.

Ans .

(B) One defined by C and one specific to C++.

Explanation :

Q19. Important advantage of using new and delete operation in C++ is

(A) Allocation of memory

(B) Frees the memory previously allocated

(D) Allocation of memory and frees the memory previously allocated.

Ans .

(D) Allocation of memory and frees the memory previously allocated.

Explanation :

Q20. Match the following control strategies of prolog:

(A) iv i ii iii

(B) ii iv i iii

(D) ii iii iv i

Ans .

(A) iv i ii iii

Explanation :

Q21. Given the following statements:
S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent.
S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent.
Which of the following is true?

(A) S1 is correct and S2 is not correct.

(B) Both S1 and S2 are correct

(D) Both S1 and S2 are not correct.

Ans .

(A) S1 is correct and S2 is not correct.

Explanation :

Q22. What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below:

(A) 11

(B) 10

(D) 00

Ans .

(D) 00

Explanation :
T flip flop toggles the state if input T is 1, and does not change state if input T is 0.
T flip flop is a clocked (synchronous or edge-triggered) flip flop.
Edge triggered flip flops can only change its values at the edge of a clock,
in absence of edge does not change its state, remains same.
In given circuit, clock symbol is showing that it is positive edge triggering (low to high change).
Now, we need to find out Q0Q1 after 4 clock cycles. Initial: 00 States Q0 and Q1 are zero
Clock 1: 11 State Q0 changed to 1 because input T is 1 and previous state was 0 and State Q1 changed to 1 because input T is 1 and previous state was 0.
Clock 2: 01 State Q0 changed to 0 because input T is 1 and previous state was 1 and State Q1 remains same because clk value is 0.
Clock 3: 10 State Q0 changed to 1 because input T is 1 and previous state was 0 and State Q1 changed to 0 because input T is 1 and previous state was 1.
Clock 4: 00 State Q0 changed to 0 because input T is 1 and previous state was 1 and State Q1 remains same because clk value is 0.

Q23. High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences?

(A) Morphological

(B) Syntactic

(D) Pragmatic

Ans .

(D) Pragmatic

Explanation :

Q24. The objective of ______________ procedure is to discover at least one _____________ that causes two literals to match.

(A) unification, validation

(B) unification, substitution

(D) minimax, maximum

Ans .

(B) unification, substitution

Explanation :

Q25. If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if

(A) h* us equal to h

(B) h* overestimates h

(D) none of these

Ans .

Explanation :

Q26. The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called

(A) backward planning

(B) goal stack planning

(D) operator overloading

Ans .

Explanation :

Q27. In alpha-beta pruning,__________ is used to cut off the search at maximizing level only and ______________ is used to cut off the search at minimizing level only.

(A) alpha, beta

(B) beta, alpha

(D) beta, beta

Ans .

(B) beta, alpha

Explanation :

Q28. If A and B are two fuzzy sets with membership functions
µA(X) = {0.2, 0.5, 0.6, 0.1, 0.9}
µB(X) = {0.1, 0.5, 0.2, 0.7, 0.8}
Then the value of µA∩B will be

(A) {0.2, 0.5, 0.6, 0.7, 0.9}

(B) {0.2, 0.5, 0.2, 0.1, 0.8}

(D) {0.1, 0.5, 0.2, 0.1, 0.8}

Ans .

(D) {0.1, 0.5, 0.2, 0.1, 0.8}

Explanation :
μA∩B(x) = min [μA(x), μB(x)]

Q29. The height of h(A) of a fuzzy set A is defined as
h(A) = sup A(x)
xϵA
Then the fuzzy set A is called normal when

(A) h(A) = 0

(B) h(A) < 0

(D) h(A) < 1

Ans .

Explanation :

Q30. An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum _____________ is computed to be passed on to a non-linear filter ϕ called activation function to release the output.

(A) Σ wi

(B) Σ xi

(D) Σ wi . Σ xi

Ans .

(D) Σ wi . Σ xi

Explanation :

Q31. Consider the formula in image processing
RD = 1 - (1/CR) Where CR = n1/n2
CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ___________ of the first data set.

(A) Data Compression

(B) Data Redundancy

(D) Data Representation

Ans .

(B) Data Redundancy

Explanation :

Q32. Find the false statement:

(A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption.

(B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product.

(D) Public key algorithms use two different keys for Encryption and Decryption.

Ans .

Explanation :

Q33. The message 11001001 is to be transmitted using the CRC polynomial x3+1 to protect it from errors. The message that should be transmitted is

(A) 110010011001

(B) 11001001

(D) 11001001011

Ans .

(D) 11001001011

Explanation :

Q34. ______________ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.

(A) 2n-2

(B) n + floor(lg n) - 2

(D) 2 lg n – 2

Ans .

Explanation :

Q35. Let A and B be two n x n matrices. The efficient algorithm to multiply the two matrices has the time complexity

(A) O(n3)

(B) O(n2.81)

(D) O(n2)

Ans .

(B) O(n2.81)

Explanation :

Q36. The recurrence relation T(n)=mT(n/2)an2 is satisfied by

(A) O(n2)

(B) O(nlg m)

(D) O(n lg n)

Ans .

Marks given to all

Explanation :
Master Method is a direct way to get the solution.
The master method works only for following type of recurrences
T(n) = aT(n/b) + f(n)
highest degree of f(n) is c.
There are following three cases:
T(n)= O(nc) where a < b^c eq 1.
T(n)= O(nc log n) where bc=a. eq 2.
T(n)=O(nlogba) where a> bc. eq 3
In our case T(n)=mT(n/2)tan2 value of a is m, not known. so we cannot say a= 2^C Or Not . We can not say which equation will follow.

Q37. The longest common subsequence of the sequences X= and Y= has length

(A) 2

(B) 3

(D) 5

Ans .

Explanation :

Q38. Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is

(A) O(n)

(B) O(n lgn)

(D) O(n+m)

Ans .

(D) O(n+m)

Explanation :

Q39. A ____________ complete subgraph and a _____________ subset of vertices of a graph G=(V ,E) are a clique and a vertex cover respectively.

(A) minimal, maximal

(B) minimal, minimal

(D) maximal, minimal

Ans .

(D) maximal, minimal

Explanation :

Q40. Pumping lemma of the context-free languages states: Let L be an infinite context free language. Then there exists some positive integer m such that wϵL with |w|≥m can be decomposed as w=uv xy Z with |vxy| ________________ and |vy| ________________ such that uvz’xyz’ , ZϵL for all z’ = 0,1, 2,...

(A) ≤m, ≤1

(B) ≤m, ≥1

(D) ≥m, ≥1

Ans .

(B) ≤m, ≥1

Explanation :

Q41. The Greibach normal form grammar for the language L= {an bn+1|n≥0} is

(A) S→a SB, B→bB|λ

(B) S→a SB, B→bB|b

(D) S→a Sb|b

Ans .

Explanation :

Q42. Given the following statements:
S1: Every context-sensitive language L is recursive.
S2: There exists a recursive language that is not context sensitive.
Which statement is correct?

(A) S1 is not correct and S2 is not correct.

(B) S1 is not correct and S2 is correct.

(D) S1 is correct and S2 is correct.

Ans .

(D) S1 is correct and S2 is correct.

Explanation :

Q43. What is the bit rate for transmitting uncompressed 800x600 pixel colour frames with 8 bits/pixel at 40 frames/second ?

(A) 2.4 Mbps

(B) 15.36 Mbps

(D) 1536 Mbps

Ans .

Explanation :
The number of bits/sec is just 800x600x40x8 or 153.6 Mbps.

Q44. In IPV 4, the IP address 200.200.200.200 belongs to

(A) Class A

(B) Class B

(D) Class D

Ans .

Explanation :

Q45. Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct re-composition from end to end of the network?

(A) Physical

(B) Data-link

(D) Application

Ans .

Explanation :

Q46. A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in response to a request? (Note that the speed of light in air is 3,00,000 km/second).

(A) 133.33 m sec

(B) 266.67 m sec

(D) 533.33 m sec

Ans .

(D) 533.33 m sec

Explanation :
The request has to go up and down, and the response has to go up and down. The total path length traversed is thus 160.000 km. The speed of light in air and vacuum is 300,000 km/sec, so the propagation delay alone is 160,000/300,000 sec or about 533 msec.

Q47. The start and stop bits are used in serial communication for

(A) error detection

(B) error correction

(D) slowing down the communication

Ans .

Explanation :

Q48. ____________ is a type of transmission impairment in which the signal loses strength due to the resistance of the transmission medium.

(A) Attenuation

(B) Distortion

(D) Decibel

Ans .

(A) Attenuation

Explanation :

Q49. Match the following:

(A) ii i iv iii

(B) ii iv i iii

(D) iii i iv ii

Ans .

Explanation :

Q50. Which of the following is a design criteria for instruction formats?

(A) The size of instructions

(B) The numbers of bits in the address fields

(D) All of these

Ans .

(D) All of these

Explanation :

Q51. Synchronization is achieved by a timing device called a _______________ which generates a periodic train of _______________

(A) clock generator, clock pulse

(B) master generator, clock pulse

(D) master clock generator, clock pulse

Ans .

A and D

Explanation :

Q52. Serial access memories are useful in applications where

(A) Data consists of numbers

(B) Short access time is required.

(D) None of these

Ans .

(D) None of these

Explanation :
Data naturally needs to flow in and out in serial form.

Q53. What will be the output of the following logic diagram?

(A) x OR y

(B) x AND y

(D) x XNOR y

Ans .

Explanation :

Q54. The essential difference between traps and interrupts is

(A) traps are asynchronous and interrupts are synchronous with the program

(B) traps are synchronous and interrupts are asynchronous with the program

(D) None of these.

Ans .

(B) traps are synchronous and interrupts are asynchronous with the program

Explanation :

Q55. Consider the following ER diagram: The minimum number of tables required to represent M, N, P, R1, R2 is

(A) 2

(B) 3

(D) 5

Ans .

(A) 2

Explanation :

Q56. Consider the following schemas:
Branch = (Branch-name, Assets, Branch-city)
Customer = (Customer-name, Bank-name, Customer-city)
Borrow = (Branch-name, loan-number, customer account-number)
Deposit = (Branch-name, Account-number, Customer-name, Balance)
Using relational Algebra, the query that finds customers who have balance more than 10,000 is _______________

(A) πcustomer-name(σbalance >10000(Deposit))

(B) σcustomer-name(σbalance >10000(Deposit))

(D) σcustomer-name(σbalance >10000(Borrow))

Ans .

(A) πcustomer-name(σbalance >10000(Deposit))

Explanation :

Q57. Find the false statement:

(A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999).

(B) A weak relationship occurs when two relationship types are linked by either Event-Precedent sequence or Condition-Precedent sequence

(D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Ans .

Explanation :

Q58. Consider the table
Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5?
Q.1. Select S.stuid
From student S Where not exists
(select * from student e where e course='5' and e marks ≥ s marks)
Q.2. Select S.stuid
From student S
Where s.marks > any (select distinct marks from student S where s.couse = 5)

(A) Q.1

(B) Q.2

(D) Neither Q.1 nor Q.2

Ans .

(B) Q.2

Explanation :
First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking course 5, that is in second query comparison is between min of marks by student enrolled in course 5 and in query one comparison is between maximum of marks by any student in course 5. So the Answer is option D.

Q59. Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r .t. functional dependencies.

(A) iii ii iv i

(B) i iii iv ii

(D) iv iii i ii

Ans .

(D) iv iii i ii

Explanation :

Q60. Match the following:

(A) i ii iv iii

(B) ii i iv iii

(D) ii iv i iii

Ans .

(D) ii iv i iii

Explanation :

Q61. Which of the following is not true with respect to a trackball and/or spaceball ?
I. A trackball is a two dimensional positioning device while as a spaceball provides six degrees of freedom
II. Unlike the trackball a spaceball does not actually move.
III. A trackball is a three dimensional positioning device while as a spaceball provides six degrees of freedom.

(A) I & II

(B) II & III

(D) III only

Ans .

(D) III only

Explanation :

Q62. Which of the following statement(s) is(are) true?
I. Two successive translations are additive.
II. Two successive rotations are additive.
III. Two successive scaling operations are multiplicative.

(A) I and II

(B) I and III

(D) All the above.

Ans .

(D) All the above.

Explanation :

Q63. Given below are three basic rules:
I. Squash and Stretch
II. Slow-in and Slow-out
III. To stage the action properly
These rules are applied in case of

(A) Rendering

(B) Morphing

(D) All the above

Ans .

Explanation :

Q64. Which of the following points lies on the same side as the origin, with reference to the line 3x+7y=2 ?

(A) (3, 0)

(B) (1, 0)

(D) (0.5, 0)

Ans .

(D) (0.5, 0)

Explanation :
If (0.5, 0) is substituted in the equation, we get 1.5 which is less than 2, then it lies on the same side as that of the origin.

Q65. The transformation matrix required for conversion of CMY colour model to RGB colour model is given as

(A)

(B)

(C)

(D)

Ans .

Explanation :

Q66. What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2).
I. Translate P1 to origin
II. Scale as required
III. Rotate
IV . Translate to the final position P2.

(A) I,II and III

(B) II,III and IV

(D) All of the above

Ans .

Marks given to all

Explanation :

Q67. In Unix, how do you check that two given strings a and b are equal?

(A) test $a -eq $b

(B) test $a -equal $b

(D) Sh -C test $a==$b

Ans .

Explanation :
Tests for a zero-length string: test -z string
Tests for a nonzero string length: test -n string
Tests two strings for equality: test string1 = string2
Tests two strings for inequality: test string1 != string2
Tests for a nonzero string length: test string

Q68. In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called

(A) NTFS file system

(B) Hardware abstraction layer

(D) Process Manager

Ans .

(B) Hardware abstraction layer

Explanation :

Q69. To place a sound into a word document, following feature of windows is used:

(A) Clip board

(B) Task switching

(D) OLE

Ans .

(D) OLE

Explanation :

Q70. Translation Look-aside Buffer(TLB) is

(A) a cache-memory in which item to be searched is compared one-by-one with the keys.

(B) a cache-memory in which item to be searched is compared with all the keys simultaneously.

(D) an associative memory in which item to be searched is compared with all the keys simultaneously.

Ans .

(D) an associative memory in which item to be searched is compared with all the keys simultaneously.

Explanation :

Q71. Simplest way of deadlock recovery is

(A) Roll back

(B) Preempt resource

(D) Kill one of the processes

Ans .

(D) Kill one of the processes

Explanation :

Q72. The directory structure used in Unix file system is called

(A) Hierarchical directory

(B) Tree structured directory

(D) Graph structured directory

Ans .

Explanation :

Q73. Which statement is not true about process 0 in the Unix operating system?

(A) Process 0 is called init process.

(B) Process 0 is not created by fork system call.

(D) Process 0 is a special process created when system boots.

Ans .

(A) Process 0 is called init process.

Explanation :

Q74. Which of the following commands would return process_id of sleep command?

(A) Sleep 1 and echo $?

(B) Sleep 1 and echo $#

(D) Sleep 1 and echo $!

Ans .

(D) Sleep 1 and echo $!

Explanation :

Q75. Possible thread states in Windows 2000 operating system include:

(A) Ready, running and waiting.

(B) Ready, standby, running, waiting, transition and terminated.

(D) Standby, running, transition and terminated.

Ans .

(B) Ready, standby, running, waiting, transition and terminated.

Explanation :

upscfever.com

UGCNET Computer Science December 2013 Paper III

UPSCFEVER - POPULAR PAGES

Join The Movement

Discussions and Comments