Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.
1. When data and acknowledgement are sent in the same frame, this is called as
(A) Piggy packing
(B) Piggy backing
(C) Back packing
(D) Good packing
View/Hide Ans
Correct Answer is B
2. Encryption and Decryption is the responsibility of ............... Layer.
(A) Physical
(B) Network
(C) Application
(D) Datalink
View/Hide Ans
Correct Answer is C
3. An analog signal carries 4 bits in each signal unit. If 1000 signal units are sent per second, then baud rate and bit rate of the signal are ............... and ..............
(A) 4000 bauds\sec & 1000 bps
(B) 2000 bauds\sec & 1000 bps
(C) 1000 bauds\sec & 500 bps
(D) 1000 bauds\sec & 4000 bps
View/Hide Ans
Correct Answer is D
4. The VLF and LF bauds use .............. propagation for communication.
(A) Ground
(B) Sky
(C) Line of sight
(D) Space
View/Hide Ans
Correct Answer is A
5. Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is
(A) 101
(B) 105
(C) 103
(D) 107
View/Hide Ans
Correct Answer is C
6. FAN IN of a component A is defined as
(A) Number of components that can call or pass control to component A.
(B) Number of components that are called by component A.
(C) Number of components related to component A.
(D) Number of components dependent on component A.
View/Hide Ans
Correct Answer is A
7. The relationship of data elements in a module is called
(A) Coupling
(B) Modularity
(C) Cohesion
(D) Granularity
View/Hide Ans
Correct Answer is C
8. Software Configuration Management is the discipline for systematically controlling
(A) the changes due to the evolution of work products as the project proceeds.
(B) the changes due to defects (bugs) being found and then fixed.
(C) the changes due to requirement changes
(D) all of the above
View/Hide Ans
Correct Answer is D
9. Which one of the following is not a step of requirement engineering ?
(A) Requirement elicitation
(B) Requirement analysts
(C) Requirement design
(D) Requirement documentation
View/Hide Ans
Correct Answer is C
10. Testing of software with actual data and in actual environment is called
(A) Alpha testing
(B) Beta testing
(C) Regression testing
(D) None of the above
View/Hide Ans
Correct Answer is B
11. The student marks should not be greater than 100. This is
(A) Integrity constraint
(B) Referential constraint
(C) Over-defined constraint
(D) Feasible constraint
View/Hide Ans
Correct Answer is A
12. GO BOTTOM and SKIP-3 commands are given one after another in a database file of 30 records. It shifts the control to
(A) 28th record
(B) 27th record
(C) 3rd record
(D) 4th record
View/Hide Ans
Correct Answer is D
13. An ER Model includes
I. An ER diagram portraying entity types.
II. Attributes for each entity type
III. Relationships among entity types.
IV. Semantic integrity constraints that reflects the business rules about data not captured in the ER diagram.
(A) I, II, III & IV
(B) I&IV
(C) I, II & IV
(D) I & III
View/Hide Ans
Correct Answer is A
14. Based on the cardinality ratio and participation ............... associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design.
(A) Entity
(B) Constraints
(C) Rules
(D) Keys
View/Hide Ans
Correct Answer is B
15. Data Integrity control uses ................
(A) Upper and lower limits on numeric data.
(B) Passwords to prohibit unauthorised access to files.
(C) Data dictionary to keep the data
(D) Data dictionary to find last access of data
View/Hide Ans
Correct Answer is D
16. What does the following declaration mean ?
int (*ptr) [10];
(A) ptr is an array of pointers of 10 integers.
(B) ptr is a pointer to an array of 10 integers.
(C) ptr is an array of 10 integers.
(D) none of the above.
View/Hide Ans
Correct Answer is B
17. Which of the following has compilation error in C ?
(A) int n = 32;
(B) char ch = 65;
(C) float f= (float) 3.2;
(D) none of the above
View/Hide Ans
Correct Answer is D
18. Which of the following operators cannot be overloaded in C+ + ?
(A) *
(B) +=
(C) ==
(D) ::
View/Hide Ans
Correct Answer is D
19. .................. allows to create classes which are derived from other classes, so that they automatically include some of its "parent's" members, plus its own members.
(A) Overloading
(B) Inheritance
(C) Polymorphism
(D) Encapsulation
View/Hide Ans
Correct Answer is B
20. The correct way to round off a floating number x to an integer value is
(A) y = (int)(x+0.5)
(B) y = int(x+0.5)
(C) y = (int)x+0.5
(D) y = (int)((int)x+0.5)
View/Hide Ans
Correct Answer is B
21. What is the value of the postfix expression ?
a b c d + - * (where a = 8, b = 4, c = 2 and d = 5)
(A) -3/8
(B) -8/3
(C) 24
(D) -24
View/Hide Ans
Correct Answer is D
22. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue?
(A) Neither of the pointers change
(B) Only front pointer changes
(C) Only rear pointer changes
(D) Both of the pointers changes
View/Hide Ans
Correct Answer is C
23. ............... is often used to prove the correctness of a recursive function.
(A) Diagonalization
(B) Communitivity
(C) Mathematical Induction
(D) Matrix Multiplication
View/Hide Ans
Correct Answer is C
24. For any B-tree of minimum degree t≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys.
(A) t-1, 2t+1
(B) t+1, 2t+1
(C) t-1, 2t-1
(D) t+1, 2t-1
View/Hide Ans
Correct Answer is C
25. Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be
(A) m x n
(B) max (m, n)
(C) min (m, n)
(D) m + n – 1
View/Hide Ans
Correct Answer is C
26. Given the following statements :
S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser.
S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars.
Which of the following is true ?
(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.
View/Hide Ans
Correct Answer is C
27. The context free grammar for the language
L = {an bm | n≤m+3, n≥0, m≥0} is
(A) S→aaaA; A→aAb|B, B→Bb|λ
(B) S→aaaA|λ, A→aAb|B, B→Bb|λ
(C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ
(D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ
View/Hide Ans
Correct Answer is C
28. Given the following statements :
S1 : If L is a regular language then the language {uv | u∈L, v∈LR} is also regular.
S2 : L = {wwR} is regular language.
Which of the following is true ?
(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.
View/Hide Ans
Correct Answer is D
29. The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called ..................
(A) Symbol resolution
(B) Parsing
(C) Assembly
(D) Relocation
View/Hide Ans
Correct Answer is D
30. Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right.
(A) Leftmost derivation
(B) Leftmost derivation traced out in reverse
(C) Rightmost derivation traced out in reverse
(D) Rightmost derivation
View/Hide Ans
Correct Answer is A
31. The dual of a Boolean expression is obtained by interchanging
(A) Boolean sums and Boolean products
(B) Boolean sums and Boolean products or interchanging 0's and 1's
(C) Boolean sums and Boolean products and interchanging 0's & 1's
(D) Interchanging 0's and 1's
View/Hide Ans
Correct Answer is C
32. Given that (292)10 = (1204)x in some number system x. The base x of that number system is
(A) 2
(B) 8
(C) 10
(D) None of the above
View/Hide Ans
Correct Answer is D
33. The sum of products expansion for the function
F(x, y, z) = (x + y)z’ is given as
(A) x’y’z + xyz’ + x’yz’
(B) xyz + xyz’ + xy’z’
(C) xy’z’ + x’y’z’ + xyz’
(D) xyz’ + xy’z’ + x’yz’
View/Hide Ans
Correct Answer is D
34. Let P(m, n) be the statement
"m divides n" where the universe of discourse for both the variables is the set of positive integers. Determine the truth values of each of the following propositions:
I. ∀m ∀n P(m,n),
II. ∃m ∀n P(m, n)
(A) Both I and II are true
(B) Both I and II are false
(C) I - false & II - true
(D) I - true & II – false
View/Hide Ans
Correct Answer is C
35. Big - O estimate for
f(x) = (x + 1) log(x2 + 1) + 3x2 is given as
(A) O(xlogx)
(B) O(x2)
(C) O(x3)
(D) O(x2logx)
View/Hide Ans
Correct Answer is B
36. How many edges are there in a forest of t-trees containing a total of n vertices ?
(A) n+t
(B) n-t
(C) n*t
(D) nt
View/Hide Ans
Correct Answer is B
37. Let f and g be the functions from the set of integers to the set integers defined by
f(x) = 2x + 3 and g(x) = 3x + 2
Then the composition of f and g and g and f is given as
(A) 6x + 7, 6x + 11
(B) 6x + 11, 6x + 7
(C) 5x + 5, 5x + 5
(D) None of the above
View/Hide Ans
Correct Answer is A
38. If n and r are non-negative integers and n=r, then p(n + 1, r) equals to
(A) P(n,r)(n+1)/(n+1-r)
(B) P(n,r)(n+1)/(n-1+r)
(C) p(n,r)(n-1)/(n+1-r)
(D) p(n,r)(n+1)/(n+1+r)
View/Hide Ans
Correct Answer is A
39. A graph is non-planar if and only if it contains a subgraph homeomorphic to
(A) K3,2 or K5
(B) K3,3 and K6
(C) K3,3 or K5
(D) K2,3 and K5
View/Hide Ans
Correct Answer is C
40. Which of the following statements are true ?
I. A circuit that adds two bits, producing a sum bit and a carry bit is called half adder.
II. A circuit that adds two bits, producing a sum bit and a carry bit is called full adder.
III. A circuit that adds two bits and a carry bit producing a sum bit and a carry bit is called full adder.
IV. A device that accepts the value of a Boolean variable as input and produces its complement is called an inverter.
(A) I & II
(B) II & III
(C) I, II, III
(D) I, III & IV
View/Hide Ans
Correct Answer is D
41. Active X controls are Pentium binary programs that can be embedded in ...............
(A) Word pages
(B) URL pages
(C) Script pages
(D) Web pages
View/Hide Ans
Correct Answer is D
42. Match the following :
Codes :
List I
List II
a. Wireless Application Environment
i. HTTP
b. Wireless Transaction Protocol
ii. IP
c. Wireless Datagram Protocol
iii. Scripts
d. Wireless
iv. UDP
(A) a-ii b-iv c-i d-iii
(B) a-iv b-iii c-ii d-i
(C) a-iv b-iii c-i d-ii
(D) a-iii b-i c-iv d-ii
View/Hide Ans
Correct Answer is D
43. Which of the following is widely used inside the telephone system for long-haul data traffic ?
(A) ISDN
(B) ATM
(C) Frame Relay
(D) ISTN
View/Hide Ans
Correct Answer is B
44. The document standards for EDI were first developed by large business house during the 1970s and are now under the control of the following standard organisation:
(A) ISO
(B) ANSI
(C) ITU-T
(D) IEEE
View/Hide Ans
Correct Answer is B
45. Electronic Data Interchange Software consists of the following four layers:
(A) Business application, Internal format conversion, Network translator, EDI envelope
(B) Business application, Internal format conversion, EDI translator, EDI envelope
(C) Application layer, Transport layer, EDI translator, EDI envelope
(D) Application layer, Transport layer, IP layer, EDI envelope
View/Hide Ans
Correct Answer is D
46. Consider a preemptive priority based scheduling algorithm based on dynamically changing priority. Larger priority number implies higher priority. When the process is waiting for CPU in the ready queue (but not yet started execution), its priority changes at a rate a = 2. When it starts running, its priority changes at a rate b = 1. All the processes are assigned priority value 0 when they enter ready queue. Assume that the following processes want to execute :
The time quantum q = 1. When two processes want to join ready queue simultaneously, the process which has not executed recently is given priority. The finish time of processes P1, P2, P3 and P4 will respectively be
Process ID
Arrival Time
Service Time
P1
0
4
P2
1
1
P3
2
2
P4
3
1
(A) 4, 5, 7 and 8
(B) 8, 2, 7 and 5
(C) 2, 5, 7 and 8
(D) 8, 2, 5 and 7
View/Hide Ans
Correct Answer is D
47. The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is
(A) 12 bits
(B) 15 bits
(C) 16 bits
(D) 20 bits
View/Hide Ans
Correct Answer is C
48. Consider a disk queue with request for input/output to block on cylinders
98, 183, 37, 122, 14, 124, 65, 67
in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively
(A) 236 and 252 cylinders
(B) 640 and 236 cylinders
(C) 235 and 640 cylinders
(D) 235 and 252 cylinders
View/Hide Ans
Correct Answer is X
49. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ?
(A) 332.8 KB
(B) 83.6 KB
(C) 266.2 KB
(D) 256.6 KB
View/Hide Ans
Correct Answer is A
50. Linux operating system uses
(A) Affinity Scheduling
(B) Fair Preemptive Scheduling
(C) Hand Shaking
(D) Highest Penalty Ratio Next
View/Hide Ans
Correct Answer is B
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
View/Hide Ans
Correct Answer is C
2. 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’ ?
View/Hide Ans
Correct Answer is D
3. 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
(C) Unbounded solution
(D) Single point as solution
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is B
5. Function points can be calculated by
(A) UFP*CAF
(B) UFP*FAC
(C) UFP*Cost
(D) UFP*Productivity
View/Hide Ans
Correct Answer is A
6. Match the following:
Codes:
List-I
List-II
a. Data coupling
i. Module A and Module B have shared data
b. Stamp coupling
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.
(A) a-iii b-ii c-i d-iv
(B) a-ii b-iii c-i d-iv
(C) a-ii b-iii c-iv d-i
(D) a-iii b-ii c-iv d-i
View/Hide Ans
Correct Answer is 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 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
(C) Software Version Management Process
(D) Software Change Management Process
View/Hide Ans
Correct Answer is B
8. One weakness of boundary value analysis and equivalence 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
View/Hide Ans
Correct Answer is 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 requirements 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 projects internally, it will invariably struggle when it outsources software projects.
View/Hide Ans
Correct Answer is D
10. Match the following with respect to relationship between objects and classes:
Codes:
List-I
List-II
a. State diagram
i. Useful for both abstract modelling 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 behaviour of a single class of objects.
(A) a-iv b-i c-ii d-iii
(B) a-ii b-iii c-iv d-i
(C) a-iii b-iv c-ii d-i
(D) a-ii b-iv c-i d-iii
View/Hide Ans
Correct Answer is A
11. Match the following style rules for reusability:
Codes:
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 functions.
(A) a-iv b-iii c-ii d-i
(B) a-ii b-i c-iv d-iii
(C) a-iii b-iv c-ii d-i
(D) a-ii b-iii c-iv d-i
View/Hide Ans
Correct Answer is 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)
View/Hide Ans
Correct Answer is C
13. 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
(C) Style sheet
(D) Stored procedure
View/Hide Ans
Correct Answer is C
14. Which of the following concepts means adding new concepts to a program as it runs?
(A) Data hiding
(B) Dynamic loading
(C) Dynamic typing
(D) Dynamic binding
View/Hide Ans
Correct Answer is B
15. Which of the following correctly describes overloading of functions?
(A) Virtual polymorphism
(B) Transient polymorphism
(C) Ad-hoc polymorphism
(D) Pseudo polymorphism
View/Hide Ans
Correct Answer is C
16. Match the following with respect to programming languages:
Codes:
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
(A) a-iii b-iv c-i d-ii
(B) a-iv b-iii c-ii d-i
(C) a-ii b-iv c-i d-iii
(D) a-ii b-iii c-iv d-i
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is A
18. 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++.
(C) Both are specific to C++
(D) Both of them are improvements of C.
View/Hide Ans
Correct Answer is B
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.
View/Hide Ans
Correct Answer is D
20. Match the following control strategies of prolog:
Codes:
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.
(A) a-iv b-i c-ii d-iii
(B) a-ii b-iv c-i d-iii
(C) a-iii b-i c-iv d-ii
(D) a-ii b-iii c-iv d-i
View/Hide Ans
Correct Answer is 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 equivalent.
Which of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct
(C) S1 is not correct and S2 is correct
(D) Both S1 and S2 are not correct.
View/Hide Ans
Correct Answer is A
22. What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below:
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
View/Hide Ans
Correct Answer is 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, maximum
View/Hide Ans
Correct Answer is B
25. 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
(C) h* underestimates h
(D) none of these
View/Hide Ans
Correct Answer is C
26. 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
(C) operator subgoaling
(D) operator overloading
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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.8}
View/Hide Ans
Correct Answer is D
29. 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
(C) h(A)=1
(D) h(A)<1
View/Hide Ans
Correct Answer is C
30. 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
(C) ∑ wi + ∑ xi
(D) ∑ wi . ∑ xi
View/Hide Ans
Correct Answer is D
31. 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
(C) Data Relation
(D) Data Representation
View/Hide Ans
Correct Answer is B
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.
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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)
View/Hide Ans
Correct Answer is 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)
View/Hide Ans
Correct Answer is X
37. The longest common subsequence of the sequences 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
View/Hide Ans
Correct Answer is 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)
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is D
40. 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
(C) ≥m, ≤1
(D) ≥m, ≥1
View/Hide Ans
Correct Answer is B
41. The Greibach normal form grammar for the language L={an bn+1|n≥0} is
(A) S→aSB, B→bB|λ
(B) S→aSB, B→bB|b
(C) S→aSB|b, B→b
(D) S→aSb|b
View/Hide Ans
Correct Answer is C
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.
View/Hide Ans
Correct Answer is D
43. 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
(C) 153.6 Mbps
(D) 1536 Mbps
View/Hide Ans
Correct Answer is C
44. In IPV4, the IP address 200.200.200.200 belongs to
(A) Class A
(B) Class B
(C) Class C
(D) Class D
View/Hide Ans
Correct Answer is C
45. 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
(C) Transport
(D) Application
View/Hide Ans
Correct Answer is 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 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
(C) 400.00 m sec
(D) 533.33 m sec
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is C
48. ..................... is a type of transmission impairment in which the signal loses strength due to the resistance of the transmission medium.
(A) Attenuation
(B) Distortion
(C) Noise
(D) Decibel
View/Hide Ans
Correct Answer is A
49. Match the following:
Codes:
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 addressis known at compile time.
(A) a-ii b-i c-iv d-iii
(B) a-ii b-iv c-i d-iii
(C) a-iii b-iv c-i d-ii
(D) a-iii b-i c-iv d-ii
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is A and 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
View/Hide Ans
Correct Answer is D
53. What will be the output of the following logic diagram?
54. 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
(C) traps are synchronous and interrupts are asynchronous with the I/O devices.
(D) None of these.
View/Hide Ans
Correct Answer is B
55. Consider the following ER diagram:
56. 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))
(C) ∏customer-name(σbalance>10000(Borrow))
(D) σcustomer-name(∏balance>10000(Borrow))
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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.course = 5)
(A) Q.1
(B) Q.2
(C) Both Q.1 and Q.2
(D) Neither Q.1 nor Q.2
View/Hide Ans
Correct Answer is B
59. Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t. functional dependencies.
Codes:
List I
List II
a. Decomposition rule
i. If X→Y and Z→W then {X, Z}→{Y, W}
b. Union rule
ii. If X→Y and {Y, W}→Z then {X, W}→Z
c. Composition rule
iii. If X→Y and X→Z then X→{Y, Z}
d. Pseudo transitivity rule
iv. If X→{Y, Z} then X→Y and X→Z
(A) a-iii b-ii c-iv d-i
(B) a-i b-iii c-iv d-ii
(C) a-ii b-i c-iii d-iv
(D) a-iv b-iii c-i d-ii
View/Hide Ans
Correct Answer is D
60. Match the following:
Codes:
List I
List II
a. Secondary Index
i. Functional Dependency
b. Non-procedural Query
ii. B-tree
c. Closure of set of Attributes
iii. Relational Algebraic Operation
d. Natural JOIN
iv. Domain Calculus
(A) a-i b-ii c-iv d-iii
(B) a-ii b-i c-iv d-iii
(C) a-i b-iii c-iv d-ii
(D) a-ii b-iv c-i d-iii
View/Hide Ans
Correct Answer is 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 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
(C) II only
(D) III only
View/Hide Ans
Correct Answer is 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 are multiplicative.
(A) I and II
(B) I and III
(C) II and III
(D) All the above.
View/Hide Ans
Correct Answer is 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 the above
View/Hide Ans
Correct Answer is 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)
View/Hide Ans
Correct Answer is D
65. The transformation matrix required for conversion of CMY colour model to RGB colour model is given as
View/Hide Ans
Correct Answer is C
66. 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).
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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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.
View/Hide Ans
Correct Answer is D
71. Simplest way of deadlock recovery is
(A) Roll back
(B) Preempt resource
(C) Lock one of the processes
(D) Kill one of the processes
View/Hide Ans
Correct Answer is D
72. The directory structure used in Unix file system is called
(A) Hierarchical directory
(B) Tree structured directory
(C) Directed acyclic graph
(D) Graph structured directory
View/Hide Ans
Correct Answer is 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.
View/Hide Ans
Correct Answer is A
74. Which 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 $!
View/Hide Ans
Correct Answer is 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.
View/Hide Ans
Correct Answer is B
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy