1. If the primal Linear Programming problem has unbounded solution,then it’s dual problem will have
(A) feasible solution
(B) alternative solution
(C) no feasible solution at all
(D) no bounded solution at all
ANS (C)
2. Given the problem to maximize f(x),X=(x1,x2,...xn) subject to m number of inequity 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) λ[gi(X)-bi]=0,j = 1,2,...m
(C) gi(X)<=bi, i = 1,2...m
(D) All of the above
Ans (D)
3. The following linear programming problem has
Max Z = x1 + x2
Subject to
x1 - x2 >= 0
3x1 - x2 <= -3
x1 >= 0,x2 >= 0
(A) Feasible solution
(B) No feasible solution
(C) Unbounded solution
(D) Single point as solution
Ans (B)
4. 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
(C) 3,1
(D) 13,8
ANS-(B)
5. Function points can be calculated by
(A) UFP*CAF
(B) UFP*FAC
(C) UFP*Cost
(D) UFP*Productivity
ANS-(A)
UFP is Unadjusted Function Point
CAF is Complixity Adjustment Factor Function Point FP = UFP*CAF
6. Match the following:
List-I List-II
a. Data coupling i. Module A and Module B have shared data
b. Stampcoupling ii. Dependency between modules is based on the fact they communicate by only passing of data.
c. Common coupling iii. When complete data structure is passed from one module to another.
d. Content coupling iv.When the control is passed from one module to the middle of another.
Codes:
a b c d
(A) iii ii i iv
(B) ii iii i iv
(C) ii iii iv i
(D) iii ii iv i
ANS-(B)
7. 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 defines 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
(C) Software Version Management Process
(D) Software Change Management Process
ANS-(B)
8. One weakness of boundary value analysis and equivalent partitioning is
(A) they are not effective.
(B) they do not explore combinations of input circumstances.
(C) they explore combinations of input circumstances
(D) none of the above
ANS-(B)
9. 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 requirement continually change, but change can be easily accommodated because software is flexible.
(C) If we get behind schedule, we can add more programmers and catch up.
(D) If an organization does not understand how to control software project internally, it will invariably struggle when it outsources software projects.
ANS-(D)
10. Match the following with respect to relationship between objects and classes:
List-I List-II
a. State diagram i. Useful for both abstract modeling and for designing actual program.
b. Object diagram ii. Describes object classes.
c. Class diagram iii. Useful for documenting test cases.
d. Instance diagram iv. Describing the behavior of a single class of object.
Codes:
a b c d
(A) iv i ii iii
(B) ii iii iv i
(C) iii iv ii i
(D) ii iv i iii
ANS-(A)
11. Match the following style rules for reusability:
List-I List-II
a. Keep methods coherent i. Write a method to get the last element of a list.
b. Keep methods small ii. Maintain parallel structure when possible.
c. Keep methods consistent iii. Breaking a method into smaller parts.
d. Provide uniform coverage iv. Perform a single function or a group of closely related function.
Codes:
a b c d
(A) iv iii ii i
(B) ii i iv iii
(C) iii iv ii i
(D) ii iii iv i
ANS-(A)
12. 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)
(C) Simple Object Access Protocol (SOAP)
(D) Simple Mail Transfer Protocol (SMTP)
ANS-(C)
13. The document that is used by XSLT to indicate, how to transform the element of the XML document to another format is
(A) HTML page
(B) DOC type procedure
(C) Style sheet
(D) Store procedure
ANS-(C)
14. Which of the following concepts means adding new concept to a program as it runs?
(A) Data hiding
(B) Dynamic loading
(C) Dynamic typing
(D) Dynamic binding
ANS-(B)
15. Which of the following correctly describes overloading of functions?
(A) Virtual polymorphism
(B) Transient polymorphism
(C) Ad-hoc polymorphism
(D) Pseudo polymorphism
ANS-(C)
16. Match the following with respect to programming languages:
List-I List-II
a. Structured Language i. JAVA
b. Non-structured Language ii. BASIC
c. Object oriented Programming Language iii. PASCAL
d. Interpreted Programming Language iv. FORTRAN
Codes:
a b c d
(A) iii iv i ii
(B) iv iii ii i
(C) ii iv i iii
(D) ii iii iv i
ANS-(A)
17. The compiler converts all operands upto the type of the largest operand is called
(A) Type Promotion
(B) Type Evaluation
(C) Type Conversion
(D) Type Declaration
ANS-(A)
18. C++ actually support the following two complete dynamic system
(A) one defined by C++ and the other not defined by C.
(B) one defined by C and one specific to C++.
(C) Both are specific to C++
(D) Both of them are improvements of C.
ANS-(B)
This question is incomplete. Here word "allocation" is missing.
19. Important advantage of using new and delete operation in C++ is
(A) Allocation of memory
(B) Frees the memory previously allocated
(C) Initialization of memory easily
(D) Allocation of memory and frees the memory previously allocated.
ANS- (D)
20. Match the following control strategies of prolog:
List-I List-II
a. Forward movement i. Variable can be done with a constant, another variable or a function
b. Unification ii. The entire conjunctive goal is executed.
c. Deep backtracking iii. Previous sub goal to find alternative solutions.
d. Shallow backtracking iv. Choose sub goal with possible unifier.
Codes:
a b c d
(A) iv i ii iii
(B) ii iv i iii
(C) iii i iv ii
(D) ii iii iv i
ANS-(A)
21. 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 equvalent
Which one of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 & S2 are correct
(C) S1 is not correct & S2 is correct
(D) Both S1 & S2 are not correct
Ans (B)
22. What are the final value of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below
(A) 11
(B) 10
(C) 01
(D) 00
ANS-(D)
23. 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
(C) Semantic
(D) Pragmatic
ANS-(D)
24. The objective of ___________ procedure is to discover at least one ________ that causes two literals to match
(A) unification, validation
(B) unification, substitution
(C) substitution, unification
(D) minimax, maximax
ANS-(B)
25. If h* represents an estimate of the cost of getting from the current node N to the goal 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
(C) h* underestimates h
(D) none of these
ANS- (C)
26. The mean-end analysis process centers around the detection of difference 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 can not 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 established the precondition of operators is called
(A) backward planning
(B) goal stack planning
(C) operator subgoaling
(D) operator overloading
ANS-(C)
27. 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
(C) alpha,alpha
(D) beta,beta
ANS-(B)
28. 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}
(C) {0.1,0.5,0.6,0.1,0.8}
(D) {0.1,0.5,0.2,0.1,0.9}
Ans (D)
29. The height of h(A) of a fuzzy set A is defined as
h(A) = sup A(X)
The the fuzzy set A is called normal when
(A) h(A) = 0
(B) h(A) < 0
(C) h(A) = 1
(D) h(A) < 1
Ans (C)
30. An artificial neurons received 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
(C) Σ wi + Σ xi
(D) Σ wi . Σ xi
Ans (D)
31. Consider the formula in image processing
Rd = 1 - (1/Cr) where Cr = N1 / N2
Cr is called as compression ration N1 and N2 denotes the number of information
Carrying units into two data sets that represents the same information. In this situation Rd is called as relative ______ of the first data set
(A) Data compression
(B) Data redundancy
(C) Data Relation
(D) Data representation
Ans (D)
32. 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.
(C) The AES(Advanced Encryption Standard) cryptosystem allows variable
Key lengths of size 56 bits and 124 bits.
(D)Public key algorithms use two different keys for Encryption and Decryption.
ANS-(C)
33. 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
(C) 110010011001001
(D) 11001001011
ANS-(D)
34. _____________ 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
(C) floor(3n/2) - 2
(D)2 lg n – 2
ANS-(C)
35. 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)
(C) O(n2.67)
(D) O(n2)
ANS-(B)
36. The recurrence relation T(n)=mT(n/2)tan2 is satisfied by
(A) O(n2)
(B) O(nlg m)
(C) O(n2 lg n)
(D) O(n lg n)
ANS-(B)
This is wrong question.If in this question 'tan' is replaced by '+a'
then the solution is (B)
37. The longest common subsequence of the sequence
X=<A,B,C,B,D,A,B> and Y=<B,D,C,A,B,A> has length
(A) 2
(B) 3
(C) 4
(D) 5
ANS-(C)
38. 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)
(C) O(n lgm)
(D) O(n+m)
ANS-(D)
39. 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
(C) maximal, maximal
(D) maximal, minimal
ANS-(D)
40. Pumping lemma of the context-free languages states:
Let L be an infinite context free language . Then there exist 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 uv2xy2 Z ξ L for all Z = 0,1,2,...
(A) <= m, <=1
(B) <=m, >= 1
(C) >=m, <=1
(D) >=m, >=1
Ans (B)
42. 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.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
ANS-(D)
42. 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.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
ANS-(D)
43. What is the bit rate for transmitting uncompressed 800x600 pixel color frames with 8 bits/pixel at 40 frames/second?
Ans. 153.6 Mbps
44. In IPv 4, the IP address 200.200.200.200 belongs to
(A) Class A
(B) Class B
(C) Class C
(D) Class D
ANS-(C)
45. Which layer of OSI reference model is responsible for decomposition of message and generation of sequence numbers to ensure correct re-composition from end to end the network?
(A) Physical
(B) Data-link
(C) Transport
(D) Application
ANS-(C)
46. 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 responses 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
(C) 400.00 m sec
(D) 533.33 m sec
ANS-(D)
47. The start and stop bits are used in serial communication for
(A) error detection
(B) error correction
(C) synchronization
(D) slowing down the communication.
ANS-(C)
48. ______________ is a type of transmission impairment in which the signal looses strength due to the resistance of the transmission medium
(A) Attenuation
(B) Distortion
(C) Noise
(D) Decibel
ANS-(A)
49. Match the following:
List-I List-II
a. Indexed Addressing i. is not used when an operand is moved from memory into a register or from a register to memory.
b. Direct Addressing ii. Memory address is computed by adding up two registers plus an (optional) offset.
c. Register Addressing iii. Addressing memory by giving a register plus a content offset.
d. Base-Indexed Addressing iv. can only be used to access global variables whose address is known at compile time.
Codes:
a b c d
(A) ii i iv Iii
(B) ii iv i Iii
(C) iii iv i ii
(D) iii i iv ii
ANS-(C)
50. 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
(C) The sufficient space in the instruction format to express all the operations desired.
(D) All of these
ANS-(D)
51. 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
(C) generator, clock
(D) master clock generator, clock pulse
ANS-(D)
52. Serial access memories are useful in applications where
(A) Data consists of numbers
(B) Short access time is required.
(C) Each stored word is processed differently.
(D) None of these
ANS-(D)
53. What will be the output of the following logic diagram
(A) x OR y
(B) x AND y
(C) x NOR y
(D) x XNOR y
ANS-(C)
54. The essential difference between traps and interrupt is
(A) traps are asynchronous and interrupt are synchronous with the program
(B) traps are synchronous and interrupt are asynchronous with the program
(C) traps are synchronous and interrupt are asynchronous with the I/O devices.
(D) None of these.
ANS-(B)
55. Consider the following ER diagram
The minimum number of tables required to represents M,N,P,R1,R2 is
(A) 2
(B) 3
(C) 4
(D) 5
ANS-(A)
56. Consider the following schemas:
Branch = (Branch_name, Assets, Branch_city)
Customer = (Customer-name, Bank-name,Customer-city)
Borrow = (Branch-name, loan-number, customer-name, Balance)
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))
(C) πcustomer-name(σbalance > 10000(Borrow))
(D)σcustomer-name(σbalance > 10000(Deposit))
ANS-(A)
57. 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
(C) Conceptual model is not accurate representation of
"Universe of interest".
(D) Ternary, Quaternary and Quintary relationships are shown
through a series of application scenario's and vignette's
ANS-(C)
58. 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.stu.id
From student S
Where s.marks > any
(select distinct marks from
student S where s.couse = 5)
(A) Q.1
(B) Q.2
(C) Both Q.1 and Q.2
(D) Neither Q.1 nor Q.2
ANS-(B)
59. Armstrong (1974) proposed systematic approach to derive
functional dependencies. Match the following w.r.t. functional dependencies.
Codes:
a b c d
(A) iii ii iv i
(B) i iii iv ii
(C) ii i iii iv
(D) iv iii i ii
ANS-(D)
60. Match the following
List I List II
(a) Secondary Index (i) Functional dependency
(b) Non-procedural Query (ii) B-tree
(c) Closure set Attribute (iii) Relational Algebraic Operation
(d) Natural Join (iv) Domain Calculus
Codes:
(a) (b) (c) (d)
(A) i ii iv iii
(B) ii i iv iii
(C) i iii iv ii
(D) ii iv i iii
ANS-(D)
61. 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 degree 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 degree of freedom.
(A) I & II
(B) II & III
(C) II only
(D) III only
ANS-(D)
62. 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 multiplicative.
(A) I and II
(B) I and III
(C) II and III
(D) All of above.
ANS-(D)
63. 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
(C) Animation
(D) All of above
ANS-(C)
64. 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)
(C) (0.5,0.5)
(D) (0.5,0)
ANS-(D)
Put the value of x and y in the equation 3x+7y
if 3x+7y <2 then it lies on the same side of origin
else if 3x+7y > 2 it does not lies on the same side of origin
65. The transformation matrix required for conversion of CMY color model to RGB color model is given as
ANS- (C)
66. What step shall be required to rotate an object about the point P1 and its placement such that what was at P1 is now reduced and is at P2.
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
(C) I,III and IV
(D) All of the above
ANS-(D)
67. 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
(C) test $a=$b
(D) sh -C test $a==$b
ANS-(C)
68. 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
(C) Microkernel
(D) Process Manager
ANS-(B)
69. To place a sound into a word document, following feature of windows is used
(A) Clip board
(B) Task switching
(C) C Win App
(D) OLE
ANS-(D)
70. 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.
(C) an associative memory in which item to be searched is compared
one-by-one with the keys.
(D) an associative memory in which item to be searched is compared
with all the keys simultaneously.
ANS-(D)
71. Simplest way of deadlock recovery is
(A) Roll back
(B) Preempt resource
(C) Lock one of these processes
(D) Kill one of the processes
ANS-(D)
72. The directory structure used in Unix file system is called
(A) Hierarchical directory
(B) Tree structure directory
(C) Directed acyclic graph
(D) Graph structured directory
ANS-(C)
73. 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.
(C) After forking process 1, process 0 becomes swapper process.
(D) Process 0 is a special process created when system boots.
ANS-(A)
74. Which one of the following commands would return process_id of sleep command?
(A) Sleep 1 and echo $?
(B) Sleep 1 and echo $#
(C) Sleep 1 and echo $x
(D) Sleep 1 and echo $!
ANS-(D)
75. Possible thread states in Windows 2000 operating system include:
(A) Ready,running and waiting
(B) Ready, standby, running, waiting, transition and terminated.
(C) Ready, running, waiting, transition and terminated
(D) Standby, running, transition and terminated.
ANS-(B)
(A) feasible solution
(B) alternative solution
(C) no feasible solution at all
(D) no bounded solution at all
ANS (C)
2. Given the problem to maximize f(x),X=(x1,x2,...xn) subject to m number of inequity 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) λ[gi(X)-bi]=0,j = 1,2,...m
(C) gi(X)<=bi, i = 1,2...m
(D) All of the above
Ans (D)
3. The following linear programming problem has
Max Z = x1 + x2
Subject to
x1 - x2 >= 0
3x1 - x2 <= -3
x1 >= 0,x2 >= 0
(A) Feasible solution
(B) No feasible solution
(C) Unbounded solution
(D) Single point as solution
Ans (B)
4. 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
(C) 3,1
(D) 13,8
ANS-(B)
5. Function points can be calculated by
(A) UFP*CAF
(B) UFP*FAC
(C) UFP*Cost
(D) UFP*Productivity
ANS-(A)
UFP is Unadjusted Function Point
CAF is Complixity Adjustment Factor Function Point FP = UFP*CAF
6. Match the following:
List-I List-II
a. Data coupling i. Module A and Module B have shared data
b. Stampcoupling ii. Dependency between modules is based on the fact they communicate by only passing of data.
c. Common coupling iii. When complete data structure is passed from one module to another.
d. Content coupling iv.When the control is passed from one module to the middle of another.
Codes:
a b c d
(A) iii ii i iv
(B) ii iii i iv
(C) ii iii iv i
(D) iii ii iv i
ANS-(B)
7. 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 defines 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
(C) Software Version Management Process
(D) Software Change Management Process
ANS-(B)
8. One weakness of boundary value analysis and equivalent partitioning is
(A) they are not effective.
(B) they do not explore combinations of input circumstances.
(C) they explore combinations of input circumstances
(D) none of the above
ANS-(B)
9. 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 requirement continually change, but change can be easily accommodated because software is flexible.
(C) If we get behind schedule, we can add more programmers and catch up.
(D) If an organization does not understand how to control software project internally, it will invariably struggle when it outsources software projects.
ANS-(D)
10. Match the following with respect to relationship between objects and classes:
List-I List-II
a. State diagram i. Useful for both abstract modeling and for designing actual program.
b. Object diagram ii. Describes object classes.
c. Class diagram iii. Useful for documenting test cases.
d. Instance diagram iv. Describing the behavior of a single class of object.
Codes:
a b c d
(A) iv i ii iii
(B) ii iii iv i
(C) iii iv ii i
(D) ii iv i iii
ANS-(A)
11. Match the following style rules for reusability:
List-I List-II
a. Keep methods coherent i. Write a method to get the last element of a list.
b. Keep methods small ii. Maintain parallel structure when possible.
c. Keep methods consistent iii. Breaking a method into smaller parts.
d. Provide uniform coverage iv. Perform a single function or a group of closely related function.
Codes:
a b c d
(A) iv iii ii i
(B) ii i iv iii
(C) iii iv ii i
(D) ii iii iv i
ANS-(A)
12. 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)
(C) Simple Object Access Protocol (SOAP)
(D) Simple Mail Transfer Protocol (SMTP)
ANS-(C)
13. The document that is used by XSLT to indicate, how to transform the element of the XML document to another format is
(A) HTML page
(B) DOC type procedure
(C) Style sheet
(D) Store procedure
ANS-(C)
14. Which of the following concepts means adding new concept to a program as it runs?
(A) Data hiding
(B) Dynamic loading
(C) Dynamic typing
(D) Dynamic binding
ANS-(B)
15. Which of the following correctly describes overloading of functions?
(A) Virtual polymorphism
(B) Transient polymorphism
(C) Ad-hoc polymorphism
(D) Pseudo polymorphism
ANS-(C)
16. Match the following with respect to programming languages:
List-I List-II
a. Structured Language i. JAVA
b. Non-structured Language ii. BASIC
c. Object oriented Programming Language iii. PASCAL
d. Interpreted Programming Language iv. FORTRAN
Codes:
a b c d
(A) iii iv i ii
(B) iv iii ii i
(C) ii iv i iii
(D) ii iii iv i
ANS-(A)
17. The compiler converts all operands upto the type of the largest operand is called
(A) Type Promotion
(B) Type Evaluation
(C) Type Conversion
(D) Type Declaration
ANS-(A)
18. C++ actually support the following two complete dynamic system
(A) one defined by C++ and the other not defined by C.
(B) one defined by C and one specific to C++.
(C) Both are specific to C++
(D) Both of them are improvements of C.
ANS-(B)
This question is incomplete. Here word "allocation" is missing.
19. Important advantage of using new and delete operation in C++ is
(A) Allocation of memory
(B) Frees the memory previously allocated
(C) Initialization of memory easily
(D) Allocation of memory and frees the memory previously allocated.
ANS- (D)
20. Match the following control strategies of prolog:
List-I List-II
a. Forward movement i. Variable can be done with a constant, another variable or a function
b. Unification ii. The entire conjunctive goal is executed.
c. Deep backtracking iii. Previous sub goal to find alternative solutions.
d. Shallow backtracking iv. Choose sub goal with possible unifier.
Codes:
a b c d
(A) iv i ii iii
(B) ii iv i iii
(C) iii i iv ii
(D) ii iii iv i
ANS-(A)
21. 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 equvalent
Which one of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 & S2 are correct
(C) S1 is not correct & S2 is correct
(D) Both S1 & S2 are not correct
Ans (B)
22. What are the final value of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below
(A) 11
(B) 10
(C) 01
(D) 00
ANS-(D)
23. 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
(C) Semantic
(D) Pragmatic
ANS-(D)
24. The objective of ___________ procedure is to discover at least one ________ that causes two literals to match
(A) unification, validation
(B) unification, substitution
(C) substitution, unification
(D) minimax, maximax
ANS-(B)
25. If h* represents an estimate of the cost of getting from the current node N to the goal 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
(C) h* underestimates h
(D) none of these
ANS- (C)
26. The mean-end analysis process centers around the detection of difference 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 can not 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 established the precondition of operators is called
(A) backward planning
(B) goal stack planning
(C) operator subgoaling
(D) operator overloading
ANS-(C)
27. 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
(C) alpha,alpha
(D) beta,beta
ANS-(B)
28. 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}
(C) {0.1,0.5,0.6,0.1,0.8}
(D) {0.1,0.5,0.2,0.1,0.9}
Ans (D)
29. The height of h(A) of a fuzzy set A is defined as
h(A) = sup A(X)
The the fuzzy set A is called normal when
(A) h(A) = 0
(B) h(A) < 0
(C) h(A) = 1
(D) h(A) < 1
Ans (C)
30. An artificial neurons received 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
(C) Σ wi + Σ xi
(D) Σ wi . Σ xi
Ans (D)
31. Consider the formula in image processing
Rd = 1 - (1/Cr) where Cr = N1 / N2
Cr is called as compression ration N1 and N2 denotes the number of information
Carrying units into two data sets that represents the same information. In this situation Rd is called as relative ______ of the first data set
(A) Data compression
(B) Data redundancy
(C) Data Relation
(D) Data representation
Ans (D)
32. 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.
(C) The AES(Advanced Encryption Standard) cryptosystem allows variable
Key lengths of size 56 bits and 124 bits.
(D)Public key algorithms use two different keys for Encryption and Decryption.
ANS-(C)
33. 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
(C) 110010011001001
(D) 11001001011
ANS-(D)
34. _____________ 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
(C) floor(3n/2) - 2
(D)2 lg n – 2
ANS-(C)
35. 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)
(C) O(n2.67)
(D) O(n2)
ANS-(B)
36. The recurrence relation T(n)=mT(n/2)tan2 is satisfied by
(A) O(n2)
(B) O(nlg m)
(C) O(n2 lg n)
(D) O(n lg n)
ANS-(B)
This is wrong question.If in this question 'tan' is replaced by '+a'
then the solution is (B)
37. The longest common subsequence of the sequence
X=<A,B,C,B,D,A,B> and Y=<B,D,C,A,B,A> has length
(A) 2
(B) 3
(C) 4
(D) 5
ANS-(C)
38. 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)
(C) O(n lgm)
(D) O(n+m)
ANS-(D)
39. 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
(C) maximal, maximal
(D) maximal, minimal
ANS-(D)
40. Pumping lemma of the context-free languages states:
Let L be an infinite context free language . Then there exist 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 uv2xy2 Z ξ L for all Z = 0,1,2,...
(A) <= m, <=1
(B) <=m, >= 1
(C) >=m, <=1
(D) >=m, >=1
Ans (B)
42. 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.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
ANS-(D)
42. 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.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
ANS-(D)
43. What is the bit rate for transmitting uncompressed 800x600 pixel color frames with 8 bits/pixel at 40 frames/second?
Ans. 153.6 Mbps
44. In IPv 4, the IP address 200.200.200.200 belongs to
(A) Class A
(B) Class B
(C) Class C
(D) Class D
ANS-(C)
45. Which layer of OSI reference model is responsible for decomposition of message and generation of sequence numbers to ensure correct re-composition from end to end the network?
(A) Physical
(B) Data-link
(C) Transport
(D) Application
ANS-(C)
46. 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 responses 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
(C) 400.00 m sec
(D) 533.33 m sec
ANS-(D)
47. The start and stop bits are used in serial communication for
(A) error detection
(B) error correction
(C) synchronization
(D) slowing down the communication.
ANS-(C)
48. ______________ is a type of transmission impairment in which the signal looses strength due to the resistance of the transmission medium
(A) Attenuation
(B) Distortion
(C) Noise
(D) Decibel
ANS-(A)
49. Match the following:
List-I List-II
a. Indexed Addressing i. is not used when an operand is moved from memory into a register or from a register to memory.
b. Direct Addressing ii. Memory address is computed by adding up two registers plus an (optional) offset.
c. Register Addressing iii. Addressing memory by giving a register plus a content offset.
d. Base-Indexed Addressing iv. can only be used to access global variables whose address is known at compile time.
Codes:
a b c d
(A) ii i iv Iii
(B) ii iv i Iii
(C) iii iv i ii
(D) iii i iv ii
ANS-(C)
50. 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
(C) The sufficient space in the instruction format to express all the operations desired.
(D) All of these
ANS-(D)
51. 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
(C) generator, clock
(D) master clock generator, clock pulse
ANS-(D)
52. Serial access memories are useful in applications where
(A) Data consists of numbers
(B) Short access time is required.
(C) Each stored word is processed differently.
(D) None of these
ANS-(D)
53. What will be the output of the following logic diagram
(A) x OR y
(B) x AND y
(C) x NOR y
(D) x XNOR y
ANS-(C)
54. The essential difference between traps and interrupt is
(A) traps are asynchronous and interrupt are synchronous with the program
(B) traps are synchronous and interrupt are asynchronous with the program
(C) traps are synchronous and interrupt are asynchronous with the I/O devices.
(D) None of these.
ANS-(B)
55. Consider the following ER diagram
The minimum number of tables required to represents M,N,P,R1,R2 is
(A) 2
(B) 3
(C) 4
(D) 5
ANS-(A)
56. Consider the following schemas:
Branch = (Branch_name, Assets, Branch_city)
Customer = (Customer-name, Bank-name,Customer-city)
Borrow = (Branch-name, loan-number, customer-name, Balance)
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))
(C) πcustomer-name(σbalance > 10000(Borrow))
(D)σcustomer-name(σbalance > 10000(Deposit))
ANS-(A)
57. 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
(C) Conceptual model is not accurate representation of
"Universe of interest".
(D) Ternary, Quaternary and Quintary relationships are shown
through a series of application scenario's and vignette's
ANS-(C)
58. 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.stu.id
From student S
Where s.marks > any
(select distinct marks from
student S where s.couse = 5)
(A) Q.1
(B) Q.2
(C) Both Q.1 and Q.2
(D) Neither Q.1 nor Q.2
ANS-(B)
59. Armstrong (1974) proposed systematic approach to derive
functional dependencies. Match the following w.r.t. functional dependencies.
Codes:
a b c d
(A) iii ii iv i
(B) i iii iv ii
(C) ii i iii iv
(D) iv iii i ii
ANS-(D)
60. Match the following
List I List II
(a) Secondary Index (i) Functional dependency
(b) Non-procedural Query (ii) B-tree
(c) Closure set Attribute (iii) Relational Algebraic Operation
(d) Natural Join (iv) Domain Calculus
Codes:
(a) (b) (c) (d)
(A) i ii iv iii
(B) ii i iv iii
(C) i iii iv ii
(D) ii iv i iii
ANS-(D)
61. 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 degree 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 degree of freedom.
(A) I & II
(B) II & III
(C) II only
(D) III only
ANS-(D)
62. 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 multiplicative.
(A) I and II
(B) I and III
(C) II and III
(D) All of above.
ANS-(D)
63. 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
(C) Animation
(D) All of above
ANS-(C)
64. 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)
(C) (0.5,0.5)
(D) (0.5,0)
ANS-(D)
Put the value of x and y in the equation 3x+7y
if 3x+7y <2 then it lies on the same side of origin
else if 3x+7y > 2 it does not lies on the same side of origin
65. The transformation matrix required for conversion of CMY color model to RGB color model is given as
ANS- (C)
66. What step shall be required to rotate an object about the point P1 and its placement such that what was at P1 is now reduced and is at P2.
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
(C) I,III and IV
(D) All of the above
ANS-(D)
67. 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
(C) test $a=$b
(D) sh -C test $a==$b
ANS-(C)
68. 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
(C) Microkernel
(D) Process Manager
ANS-(B)
69. To place a sound into a word document, following feature of windows is used
(A) Clip board
(B) Task switching
(C) C Win App
(D) OLE
ANS-(D)
70. 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.
(C) an associative memory in which item to be searched is compared
one-by-one with the keys.
(D) an associative memory in which item to be searched is compared
with all the keys simultaneously.
ANS-(D)
71. Simplest way of deadlock recovery is
(A) Roll back
(B) Preempt resource
(C) Lock one of these processes
(D) Kill one of the processes
ANS-(D)
72. The directory structure used in Unix file system is called
(A) Hierarchical directory
(B) Tree structure directory
(C) Directed acyclic graph
(D) Graph structured directory
ANS-(C)
73. 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.
(C) After forking process 1, process 0 becomes swapper process.
(D) Process 0 is a special process created when system boots.
ANS-(A)
74. Which one of the following commands would return process_id of sleep command?
(A) Sleep 1 and echo $?
(B) Sleep 1 and echo $#
(C) Sleep 1 and echo $x
(D) Sleep 1 and echo $!
ANS-(D)
75. Possible thread states in Windows 2000 operating system include:
(A) Ready,running and waiting
(B) Ready, standby, running, waiting, transition and terminated.
(C) Ready, running, waiting, transition and terminated
(D) Standby, running, transition and terminated.
ANS-(B)
No comments:
Post a Comment