To know even one life has breathed easier because you have lived. This is to have succeeded.
1. How many strings of 5 digits have the property that the sum of their digits is 7 ?
(A) 66
(B) 330
(C) 495
(D) 99
View/Hide Ans
Correct Answer is B
2. Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ?
(A) 22 / 36
(B) 12 / 36
(C) 14 / 36
(D) 6 / 36
View/Hide Ans
Correct Answer is C
3. In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains at least one fish ?
(A) 1001
(B) 3876
(C) 775
(D) 200
View/Hide Ans
Correct Answer is A
4. Consider the following statements:
(a) Depth - first search is used to traverse a rooted tree.
(b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman's algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.
Which of the above statements are true ?
(A) (a) and (b)
(B) (c) and (d)
(C) (a) , (b) and (c)
(D) (a), (b) , (c) and (d)
View/Hide Ans
Correct Answer is D
5. Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ?
(a) deg(v) ≥ n/2 for each vertex of G
(b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges
(c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge
(A) (a) and (b)
(B) (b) and (c)
(C) (a) and (c)
(D) (a), (b) and (c)
View/Hide Ans
Correct Answer is D
6. Consider the following statements :
(a) Boolean expressions and logic networks correspond to labelled acyclic digraphs.
(b) Optimal Boolean expressions may not correspond to simplest networks.
(c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of these statement(s) is/ are correct?
(A) (a) only
(B) (b) only
(C) (a) and (b)
(D) (a), (b) and (c)
View/Hide Ans
Correct Answer is D
7. Consider a full-adder with the following input values:
(a) x=1, y=0 and Ci(carry input) = 0
(b) x=0, y=1 and Ci = 1
Compute the values of S(sum) and C0 (carry output) for the above input values.
(A) S=1 , C0= 0 and S=0 , C0= 1
(B) S=0 , C0= 0 and S=1 , C0= 1
(C) S=1 , C0= 1 and S=0 , C0= 0
(D) S=0 , C0= 1 and S=1 , C0= 0
View/Hide Ans
Correct Answer is A
8. "lf my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, if I don't run out of money and the power is still on, then my computations are incorrect."
Convert this argument into logical notations using the variables c, b, r, p for propositions of computations, electric bills, out of money and the power respectively. (Where ¬ means NOT)
(A) if (c ∧ b) → r and ¬b → ¬p, then (¬r ∧ p)→ ¬c
(B) if (c ∨ b) → r and ¬b → ¬p, then (r ∧ p)→ c
(C) if (c ∧ b) → r and ¬p → ¬b, then (¬r ∨ p)→ ¬c
(D) if (c ∨ b) → r and ¬b → ¬p, then (¬r ∧ p)→ ¬c
View/Hide Ans
Correct Answer is A
9. Match the following:
Codes:
List I
List II
(a) (p → q) ↔ (¬q → ¬p)
(i) Contrapositive
(b) [(p ∧ q) → r] ↔ [p → (q → r)]
(ii) Exportation law
(c) (p → q) ↔ [(p∧¬q) → o]
(iii) Reductio ad absurdum
(d) (p ↔ q) ↔ [(p → q)∧(q → p)]
(iv) Equivalence
(A) (a-i) (b-ii) (c-iii) (d-iv)
(B) (a-ii) (b-iii) (c-i) (d-iv)
(C) (a-iii) (b-ii) (c-iv) (d-i)
(D) (a-iv) (b-ii) (c-iii) (d-i)
View/Hide Ans
Correct Answer is A
10. Consider a proposition given as:
"x≥6, if x2=25 and its proof as: If x≥6, then x2=x.x=6.6=36≥25
Which of the following is correct w.r.to the given proposition and its proof ?
(a) The proof shows the converse of what is to be proved.
(b) The proof starts by assuming what is to be shown.
(c) The proof is correct and there is nothing wrong.
(A) (a) only
(B) (c) only
(C) (a) and (b)
(D) (b) only
View/Hide Ans
Correct Answer is C
11. What is the output of the following program ?
(Assume that the appropriate pre-processor directives are included and there is no syntax error)
main()
{
char S[ ] = "ABCDEFGH";
printf ("%C",* (& S[3]));
printf ("%s", S+4);
printf ("%u", S);
/* Base address of S is 1000 */
}
(A) ABCDEFGH1000
(B) CDEFGH1000
(C) DDEFGHH1000
(D) DEFGH1000
View/Hide Ans
Correct Answer is D
12. Which of the following, in C++, is inherited in a derived class from base class ?
(A) constructor
(B) destructor
(C) data members
(D) virtual methods
View/Hide Ans
Correct Answer is C
13. Given that x=7.5, j=-1.0, n=1.0, m=2.0
the value of --x+j == x>n>=m is:
(A) 0
(B) 1
(C) 2
(D) 3
View/Hide Ans
Correct Answer is A
14. Which of the following is incorrect in C++ ?
(A) When we write overloaded function we must code the function for each usage.
(B) When we write function template we code the function only once.
(C) It is difficult to debug macros
(D) Templates are more efficient than macros
View/Hide Ans
Correct Answer is D
15. When the inheritance is private, the private methods in base class are.................. in the derived class (in C++).
(A) inaccessible
(B) accessible
(C) protected
(D) public
View/Hide Ans
Correct Answer is A
16. An Assertion is a predicate expressing a condition we wish database to always satisfy. The correct syntax for Assertion is :
(A) CREATE ASSERTION ‘ASSERTION Name’ CHECK ‘Predicate’
(B) CREATE ASSERTION ‘ASSERTION NAME’
(C) CREATE ASSERTION, CHECK Predicate
(D) SELECT ASSERTION
View/Hide Ans
Correct Answer is A
17. Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock ?
(a) 2-phase Locking (b) Time stamp - ordering
(A) Both (a) and (b)
(B) (a) only
(C) (b) only
(D) Neither (a) nor (b)
View/Hide Ans
Correct Answer is C
18. Drop Table cannot be used to drop a Table referenced by .................. constraint.
(a) Primary key
(b) Sub key
(c) Super key
(d) Foreign key
(A) (a)
(B) (a), (b) and (c)
(C) (d)
(D) (a) and (d)
View/Hide Ans
Correct Answer is C
19. Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems
(a) Data redundancy and inconsistency
(b) Difficulty in accessing Data
(c) Data isolation
(d) Integrity problems
(A) (a)
(B) (a) and (d)
(C) (a), (b) and (c)
(D) (a), (b), (c) and (d)
View/Hide Ans
Correct Answer is D
20. For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as :
(A) Neighbour Set
(B) Strong Entity Set
(C) Owner entity set
(D) Weak Set
View/Hide Ans
Correct Answer is C
21. Consider the given graph:
22. The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ............
(A) dbefacg
(B) debfagc
(C) dbefcga
(D) debfgca
View/Hide Ans
Correct Answer is D
23. Level order Traversal of a rooted Tree can be done by starting from root and performing:
(A) Breadth First Search
(B) Depth first search
(C) Root search
(D) Deep search
View/Hide Ans
Correct Answer is A
24. The average case occurs in the Linear Search Algorithm when:
(A) The item to be searched is in some where middle of the Array
(B) The item to be searched is not in the array
(C) The item to be searched is in the last of the array
(D) The item to be searched is either in the last or not in the array
View/Hide Ans
Correct Answer is A
25. To determine the efficiency of an algorithm the time factor is measured by:
(A) Counting micro seconds
(B) Counting number of key operations
(C) Counting number of statements
(D) Counting kilobytes of algorithm
View/Hide Ans
Correct Answer is B
26. Which of the following protocols is an application layer protocol that establishes, manages and terminates multimedia sessions?
(A) Session Maintenance Protocol
(B) Real - time Streaming Protocol
(C) Real - time Transport Control Protocol
(D) Session Initiation Protocol
View/Hide Ans
Correct Answer is D
27. Match the following port numbers with their uses:
Codes:
List I
List II
(a) 23
(i) World wide web
(b) 25
(ii) Remote Login
(c) 80
(iii) USENET news
(d) 119
(iv) E-mail
(A) (a-iv) (b-i) (c-ii) (c-iii)
(B) (a-ii) (b-i) (c-iv) (c-iii)
(C) (a-ii) (b-iv) (c-iii) (c-i)
(D) (a-ii) (b-iv) (c-i) (c-iii)
View/Hide Ans
Correct Answer is D
28. Which of the following is not associated with the session layer ?
(A) Dialog control
(B) Token management
(C) Semantics of the information transmitted
(D) Synchronization
View/Hide Ans
Correct Answer is C
29. What is the size of the 'total length' field in IPv 4 datagram ?
(A) 4 bits
(B) 8 bits
(C) 16 bits
(D) 32 bits
View/Hide Ans
Correct Answer is C
30. Which of the following is/are restriction(s) in classless addressing ?
(A) The number of addresses needs to be a power of 2.
(B) The mask needs to be included in the address to define the block.
(C) The starting address must be divisible by the number of addresses in the block.
(D) All of the above
View/Hide Ans
Correct Answer is D
31. Match the following:
Codes:
List I
List II
(a) Forward Reference Table
(i) Assembler directive
(b) Mnemonic Table
(ii) Uses array data structure
(c) Segment Register Table
(iii) Contains machine OP code
(d) EQU
(iv) Uses linked list data structure
(A) (a-ii) (b-iii) (c-iv) (d-i)
(B) (a-iii) (b-iv) (c-ii) (d-i)
(C) (a-iv) (b-i) (c-iii) (d-ii)
(D) (a-iv) (b-iii) (c-ii) (d-i)
View/Hide Ans
Correct Answer is D
32. The translator which performs macro calls expansion is called :
(A) Macro processor
(B) Micro pre-processor
(C) Macro pre-processor
(D) Dynamic linker
View/Hide Ans
Correct Answer is C
33. If all the production rules have single non - terminal symbol on the left side, the grammar defined is :
(A) context free grammar
(B) context sensitive grammar
(C) unrestricted grammar
(D) phrase grammar
View/Hide Ans
Correct Answer is A
34. Which one from the following is false ?
(A) LALR parser is Bottom - Up parser
(B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).
(C) LR parser is Bottom - Up parser.
(D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.
View/Hide Ans
Correct Answer is B
35. Which phase of compiler generates stream of atoms ?
(A) Syntax analysis
(B) Lexical Analysis
(C) Code generation
(D) Code optimization
View/Hide Ans
Correct Answer is A
36. A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?
(A) 0.984 sec
(B) 0.396 sec
(C) 0.738 sec
(D) 0.42 sec
View/Hide Ans
Correct Answer is D
37. Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true?
(A) R(Pi)∩W(Pj)=∅
(B) W(Pi)∩R(Pj)=∅
(C) R(Pi)∩R(Pj)=∅
(D) W(Pi)∩W(Pj)=∅
View/Hide Ans
Correct Answer is C
38. A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string
0   1   7   2   3   2   7   1   0   3
if the four frames are initially empty?
(A) 6
(B) 7
(C) 5
(D) 8
View/Hide Ans
Correct Answer is B
39. What does the following command do?
grep -vn “abc” x
(A) It will print all of the lines in the file x that match the search string "abc"
(B) It will print all of the lines in file x that do not match the search string "abc"
(C) It will print total number of lines in the file x that match the search string "abc"
(D) It will print the specific line numbers of the file x in which there is a match for string "abc"
View/Hide Ans
Correct Answer is A
40. The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure?
(A) File descriptor table
(B) System call state
(C) Scheduling parameters
(D) Kernel stack
View/Hide Ans
Correct Answer is C
41. Match the following:
Codes:
List I
List II
(a) Size-oriented metrics
(i) uses number of external interfaces as one of the measurement parameter.
(b) Function-oriented metrics
(ii) originally designed to be applied to business information systems.
(c) Extended Function Point Metrics
(iii) derived by normalizing quality and/or productivity measures by considering the size of the software.
(d) Function point
(iv) uses algorithm characteristics as of the measurement parameter.
(A) (a-iii) (b-iv) (c-i) (d-ii)
(B) (a-ii) (b-i) (c-iv) (d-iii)
(C) (a-iv) (b-ii) (c-iii) (d-i)
(D) (a-iii) (b-i) (c-iv) (d-ii)
View/Hide Ans
Correct Answer is D
42. In which testing strategy requirements established during requirements analysis are validated against developed software?
(A) Validation testing
(B) Integration testing
(C) Regression testing
(D) System testing
View/Hide Ans
Correct Answer is A
43. Which process model is also called as classic life cycle model?
(A) Waterfall model
(B) RAD model
(C) Prototyping model
(D) Incremental model
View/Hide Ans
Correct Answer is A
44. Cohesion is an extension of:
(A) Abstraction concept
(B) Refinement concept
(C) Information hiding concept
(D) Modularity
View/Hide Ans
Correct Answer is C
45. Which one from the following is highly associated activity of project planning?
(A) Keep track of the project progress.
(B) Compare actual and planned progress and costs
(C) Identify the activities, milestones and deliverables produced by a project
(D) Both (B) and (C)
View/Hide Ans
Correct Answer is C
46. In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1-P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is:
(A) 1/((1-P)+N.P)
(B) 1/((N-1)P+P)
(C) 1/((1-P)+P/N)
(D) 1/(P+(1-P)/N)
View/Hide Ans
Correct Answer is C
47. Which of the following statements is incorrect for Parallel Virtual Machine (PVM)?
(A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function.
(B) Message buffers are allocated dynamically.
(C) The PVM communication model assumes that any task can send a message to any other PVM task and that there is no limit to the size or number of such messages.
(D) In PVM Model, the message order is not preserved.
View/Hide Ans
Correct Answer is D
48. Which of the following algorithms sort n integers, having the range 0 to (n2-1), in ascending order in O(n) time ?
(A) Selection sort
(B) Bubble sort
(C) Radix sort
(D) Insertion sort
View/Hide Ans
Correct Answer is C
49. Which of the following statements is FALSE about weak entity set ?
(A) Weak entities can be deleted automatically when their strong entity is deleted.
(B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity.
(C) A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included.
(D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.
View/Hide Ans
Correct Answer is D
50. Which of the following is not valid with reference to Message Passing Interface (MPI)?
(A) MPI can run on any hardware platform
(B) The programming model is a distributed memory model.
(C) All parallelism is implicit.
(D) MPI - Comm - Size returns the total number of MPI processes in specified communication.
View/Hide Ans
Correct Answer is C
1. For the 8-bit word 00111001, the check bits stored with it would be 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory?
(A) 10011001
(B) 00011001
(C) 00111000
(D) 11000110
View/Hide Ans
Correct Answer is B
2. Consider a 32 - bit microprocessor, with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that the microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor?
(A) 8x106 bytes/sec
(B) 4x106 bytes/sec
(C) 16x106 bytes/sec
(D) 4x109 bytes/sec
View/Hide Ans
Correct Answer is B
3. The RST 7 instruction in 8085 microprocessor is equivalent to:
(A) CALL 0010 H
(B) CALL 0034 H
(C) CALL 0038 H
(D) CALL 003C H
View/Hide Ans
Correct Answer is C
4. The equivalent hexadecimal notation for octal number 2550276 is:
(A) FADED
(B) AEOBE
(C) ADOBE
(D) ACABE
View/Hide Ans
Correct Answer is C
5. The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memory read/write employs one machine cycle. For execution of the programs, the system utilizes 90 percent of the CPU time. For block data transfer, an IO device is attached to the system while CPU executes the background programs continuously. What is the maximum IO data transfer rate if programmed IO data transfer technique is used?
(A) 500 Kbytes/sec
(B) 2.2 Mbytes/sec
(C) 125 Kbytes/sec
(D) 250 Kbytes/sec
View/Hide Ans
Correct Answer is D
6. The number of flip-flops required to design a modulo-272 counter is:
(A) 8
(B) 9
(C) 27
(D) 11
View/Hide Ans
Correct Answer is B
7. Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any attributes of their own. How many minimum number of tables are required to represent this situation in the Relational Model?
(A) 4
(B) 3
(C) 2
(D) 1
View/Hide Ans
Correct Answer is B
8. The STUDENT information in a university is stored in the relation STUDENT (Name, Sex, Marks, DEPT_Name)
Consider the following SQL Query
SELECT DEPT_Name
From STUDENT
Where SEX='M'
Group by DEPT_Name
Having avg (Marks)>(SELECT avg (Marks)
From STUDENT).
It returns the Name of the Department for which:
(A) The Average marks of Male students is more than the average marks of students in the same Department
(B) The average marks of male students is more than the average marks of the students in the University
(C) The average marks of male students is more than the average marks of male students in the University
(D) The average marks of students is more than the average marks of male students in the University
View/Hide Ans
Correct Answer is B
9. Select the ‘False’ statement from the following statements about Normal Forms:
(A) Lossless preserving decomposition into 3NF is always possible
(B) Lossless preserving decomposition into BCNF is always possible
(C) Any relation with two attributes is in BCNF
(D) BCNF is stronger than 3NF
View/Hide Ans
Correct Answer is B
10. The Relation
Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price)
is in 2NF because :
(A) Non key attribute V_name is dependent on V_no which is part of composite key
(B) Non key attribute V_name is dependent on Qty_sup
(C) key attribute Qty_sup is dependent on primary_key unit price
(D) key attribute V_ord_no is dependent on primary_key unit price
View/Hide Ans
Correct Answer is A
11. The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if:
(a) R1 ∩ R2 → (R1-R2)
(b) R1 → R 2
(c) R1 ∩ R2 → (R2-R1)
(d) R2 → R1 ∩ R2
(A) (a) and (b) happens
(B) (a) and (d) happens
(C) (a) and (c) happens
(D) (b) and (c) happens
View/Hide Ans
Correct Answer is C
12. In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:
(A) The number of blocks used for index, and the size of index
(B) Size of Blocks and size of Address
(C) Size of Index
(D) Size of Block
View/Hide Ans
Correct Answer is A
13. Give the number of principal vanishing point(s) along with their direction for the standard perspective transformation:
(A) Only one in the direction K
(B) Two in the directions I and J
(C) Three in the directions I, J and K
(D) Only two in the directions J and K
View/Hide Ans
Correct Answer is A
14. Consider a triangle A(0, 0), B(1, 1), C(5, 2). The triangle has to be rotated by an angle of 450 about the point P(-1, -1). What shall be the coordinates of the new triangle?
View/Hide Ans
Correct Answer is C
15. The process of dividing an analog signal into a string of discrete outputs, each of constant amplitude, is called:
(A) Strobing
(B) Amplification
(C) Conditioning
(D) Quantization
View/Hide Ans
Correct Answer is D
16. Which of the following is not a basic primitive of the Graphics Kernel System(GKS) ?
(A) POLYLINE
(B) POLYDRAW
(C) FILL AREA
(D) POLYMARKER
View/Hide Ans
Correct Answer is B
17. Which of the following statements is/are incorrect ?
(a) Mapping the co-ordinates of the points and lines that form the picture into the appropriate co-ordinates on the device or workstation is known as viewing transformation.
(b) The right handed cartesian co-ordinates system in whose coordinates we describe the picture is known as world coordinate system.
(c) The co-ordinate system that corresponds to the device or workstation where the image is to be displayed is known as physical device co-ordinate system.
(d) Left-handed co-ordinate system in which the display area of the virtual display device corresponds to the unit(|x|) square whose lower left handed corner is at origin of the co-ordinate system, is known as normalized device co-ordinate system.
View/Hide Ans
Correct Answer is D
18. Match the following
Codes:
List I
List II
(a) Flood Gun
(i) An electron gun designed to flood the entire screen with electrons.
(b) Collector
(ii) Partly energised by flooding gun, stores the charge generated by the writing gun
(c) Ground
(iii) Used to discharge the collector
(d) Phosphorus grains
(iv) Used in memory-tube display and similar to those used in standard CRT
(e) Writing Gun System
(v) Used in memory-tube display and basically the same as the electron gun used in a conventional CRT.
(A) (a-i) (b-ii) (c-iii) (d-iv) (e-v)
(B) (a-ii) (b-iii) (c-i) (d-iv) (e-v)
(C) (a-iii) (b-i) (c-ii) (d-v) (e-iv)
(D) (a-iv) (b-v) (c-i) (d-ii) (e-iii)
View/Hide Ans
Correct Answer is A
19. Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have:
(A) 1 final state among 5 states
(B) 4 final states among 5 states
(C) 1 final state among 6 states
(D) 5 final states among 6 states
View/Hide Ans
Correct Answer is D
20. The regular expression corresponding to the language L where
L={x ∈ {0,1}* | x ends with 1 and does not contain substring 00 } is:
(A) (1 + 01)* (10 + 01)
(B) (1 + 01)* 01
(C) (1 + 01)* (1 + 01)
(D) (10 + 01)* 01
View/Hide Ans
Correct Answer is C
21. The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by:
δ(q0, a)=q1 ; δ(q0, b)=q2
δ(q1, a)=q0 ; δ(q1, b)=q3
δ(q2, a)=q3 ; δ(q2, b)=q0
δ(q3, a)=q3 ; δ(q3, b)=q1
the initial and final states of the automata are:
(A) q0 and q0 respectively
(B) q0 and q1 respectively
(C) q0 and q2 respectively
(D) q0 and q3 respectively
View/Hide Ans
Correct Answer is D
22. The clausal form of the disjunctive normal form ¬A ∨ ¬B ∨ ¬C ∨ D is:
(A) A ∧ B ∧ C → D
(B) A ∨ B ∨ C ∨ D → true
(C) A ∧ B ∧ C ∧ D → true
(D) A ∧ B ∧ C ∧ D → false
View/Hide Ans
Correct Answer is A
23. Which of the following is false for the programming language PROLOG?
(A) A PROLOG variable can only be assigned to a value once
(B) PROLOG is a Strongly Typed Language.
(C) The scope of a variable in PROLOG is a single clause or rule.
(D) the scope of a variable in PROLOG is a Single Query
View/Hide Ans
Correct Answer is B
24. Which one of the following is true?
(A) The resolvent of two Horn clauses is not a Horn clause.
(B) The resolvent of two Horn clauses is a Horn Clause.
(C) If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal.
(D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.
View/Hide Ans
Correct Answer is B
25. Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender?
(A) Broadcasting
(B) Unicasting
(C) Packet Switching
(D) Circuit Switching
View/Hide Ans
Correct Answer is D
26. Which of the following control fields in TCP header is used to specify the sender has no more data to transmit?
(A) FIN
(B) RST
(C) SYN
(D) PSH
View/Hide Ans
Correct Answer is A
27. Which are the two modes of IP security?
(A) Transport and Certificate
(B) Transport and Tunnel
(C) Certificate and Tunnel
(D) Preshared and Transport
View/Hide Ans
Correct Answer is B
28. A message “COMPUTERNETWORK” encrypted(ignore quotes)using columnar transposition cipher with a key "LAYER". The encrypted message is:
(A) CTTOEWMROPNRUEK
(B) MROUEKCTTPNROEW
(C) OEWPNRCTTUEKMRO
(D) UEKPNRMROOEWCTT
View/Hide Ans
Correct Answer is C
29. Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample requires 8 bits?
(A) 32 kbps
(B) 64 kbps
(C) 128 kbps
(D) 256 kbps
View/Hide Ans
Correct Answer is C
30. The Maximum payload of a TCP segment is
(A) 65,535
(B) 65,515
(C) 65,495
(D) 65,475
View/Hide Ans
Correct Answer is C
31. An all-pairs shortest-paths problem is efficiently solved using:
(A) Dijkstra' algorithm
(B) Bellman-Ford algorithm
(C) Kruskal Algorithm
(D) Floyd-Warshall algorithm
View/Hide Ans
Correct Answer is D
32. The travelling salesman problem can be solved in:
(A) Polynomial time using dynamic programming algorithm
(B) Polynomial time using branch-and-bound algorithm
(C) Exponential time using dynamic programming algorithm or branch-and-bound algorithm.
(D) Polynomial time using backtracking algorithm.
View/Hide Ans
Correct Answer is C
33. Which of the following is asymptotically smaller?
(A) lg(lg*n)
(B) lg*(lg n)
(C) lg(n!)
(D) lg*(n!)
View/Hide Ans
Correct Answer is A
34. Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 - 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table.
(A) 77
(B) 82
(C) 88
(D) 89
View/Hide Ans
Correct Answer is C
35. Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct?
(A) θ(f(n) * g(n)) = min(f(n), g(n))
(B) θ(f(n) * g(n)) = max(f(n), g(n))
(C) θ(f(n) + g(n)) = min(f(n), g(n))
(D) θ(f(n) + g(n)) = max(f(n), g(n))
View/Hide Ans
Correct Answer is D
36. The number of nodes of height h in any n - element heap is ..............
(A) h
(B) zh
(C) ceil(n/zh)
(D) ceil(n/zh+1)
View/Hide Ans
Correct Answer is D
37. In Java, when we implement an interface method, it must be declared as:
(A) Private
(B) Protected
(C) Public
(D) Friend
View/Hide Ans
Correct Answer is C
38. The Servlet Response interface enables a servlet to formulate a response for a client using the method ...............
(A) void log(Exception e, String s)
(B) void destroy()
(C) int getServerPort()
(D) void setContextType(String Type)
View/Hide Ans
Correct Answer is D
39. Which one of the following is correct?
(A) Java applets cannot be written in any programming language
(B) An applet is not a small program.
(C) An applet can be run on its own.
(D) Applets are embedded in another applications.
View/Hide Ans
Correct Answer is D
40. In XML we can specify the frequency of an element by using the symbols:
(A) + * !
(B) # * !
(C) + * ?
(D) - * ?
View/Hide Ans
Correct Answer is C
41. In XML, DOCTYPE declaration specifies to include a reference to ............ file.
(A) Document Type Definition
(B) Document Type Declaration
(C) Document Transfer Definition
(D) Document Type language
View/Hide Ans
Correct Answer is A
42. Module design is used to maximize cohesion and minimize coupling. Which of the following is the key to implement this rule?
(A) Inheritance
(B) Polymorphism
(C) Encapsulation
(D) Abstraction
View/Hide Ans
Correct Answer is C
43. Verification:
(A) refers to the set of activities that ensure that software correctly implements a specific function.
(B) gives answer to the question - Are we building the product right ?
(C) requires execution of software
(D) both (A) and (B)
View/Hide Ans
Correct Answer is D
44. Which design metric is used to measure the compactness of the program in terms of lines of code?
(A) Consistency
(B) Conciseness
(C) Efficiency
(D) Accuracy
View/Hide Ans
Correct Answer is B
45. Requirements prioritization and negotiation belongs to:
(A) Requirements validation
(B) Requirements elicitation
(C) Feasibility Study
(D) Requirement reviews
View/Hide Ans
Correct Answer is B
46. Adaptive maintenance is a maintenance which .............
(A) Correct errors that were not discovered till testing phase.
(B) is carried out to port the existing software to a new environment.
(C) improves the system performance.
(D) both (B) and (C)
View/Hide Ans
Correct Answer is B
47. A Design concept Refinement is a:
(A) Top-down Approach
(B) Complementary of Abstraction concept
(C) Process of elaboration
(D) All of the above
View/Hide Ans
Correct Answer is D
48. A software design is highly modular if
(A) cohesion is functional and coupling is data type.
(B) cohesion is coincidental and coupling is data type.
(C) cohesion is sequential and coupling is content type.
(D) cohesion is functional and coupling is stamp type
View/Hide Ans
Correct Answer is A
49. Match the following for operating system techniques with the most appropriate advantage:
Codes:
List I
List II
(a) Spooling
(i) Allows several jobs in memory to improve CPU utilization
(b) Multiprogramming
(ii) Access to shared resources among geographically dispersed computers in a transparent way
(c) Time sharing
(iii) overlapping I/O and computations
(d) Distributed computing
(iv) Allows many users to share a computer simultaneously by switching processor frequently
(A) (a-iii) (b-i) (c-ii) (d-iv)
(B) (a-iii) (b-i) (c-iv) (d-ii)
(C) (a-iv) (b-iii) (c-ii) (d-i)
(D) (a-ii) (b-iii) (c-iv) (d-i)
View/Hide Ans
Correct Answer is B
50. Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?
(A) Queues have different priorities.
(B) Each queue may have different scheduling algorithm
(C) Processes are permanently assigned to a queue
(D) This algorithm can be configured to match a specific system under design
View/Hide Ans
Correct Answer is C
51. What is the most appropriate function of Memory Management Unit (MMU) ?
(A) It is an associative memory to store TLB
(B) It is a technique of supporting multiprogramming by creating dynamic partitions
(C) It is a chip to map virtual address to physical address
(D) It is an algorithm to allocate and deallocate main memory to a process
View/Hide Ans
Correct Answer is C
52. Dining Philosopher's problem is a:
(A) Producer-Consumer problem
(B) Classical IPC problem
(C) Starvation problem
(D) Synchronization primitive
View/Hide Ans
Correct Answer is B
53. In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.
(A) Index
(B) Linked
(C) Contiguous
(D) Bit Map
View/Hide Ans
Correct Answer is B
54. A unix file may be of type:
(A) Regular file
(B) Directory File
(C) Device File
(D) Any one of the above
View/Hide Ans
Correct Answer is D
55. Match the following:
Codes:
List I
List II
(a) Intelligence
(i) Contextual, tacit, transfer needs learning
(b) Knowledge
(ii) Scattered facts, easily transferrable
(c) Information
(iii) Judgemental
(d) Data
(iv) Codifiable, endorsed with relevance and purpose
(A) (a-iii) (b-ii) (c-iv) (d-i)
(B) (a-iii) (b-i) (c-iv) (d-ii)
(C) (a-i) (b-ii) (c-iii) (d-iv)
(D) (a-i) (b-iii) (c-iv) (d-ii)
View/Hide Ans
Correct Answer is B
56. Match the following knowledge representation techniques with their applications:
Codes:
List I
List II
(a) Frames
(i) Pictorial representation of objects, their attributes and relationships
(b) Conceptual dependencies
(ii) To describe real world stereotype events
(c) Associative networks
(iii) Record like structures for grouping closely related knowledge
(d) Scripts
(iv) Structures and primitives to represent sentences
(A) (a-iii) (b-iv) (c-i) (d-ii)
(B) (a-iii) (b-iv) (c-ii) (d-i)
(C) (a-iv) (b-iii) (c-i) (d-ii)
(D) (a-iv) (b-iii) (c-ii) (d-i)
View/Hide Ans
Correct Answer is A
57. In propositional logic P ↔ Q is equivalent to (Where ~ denotes NOT):
(A) ~(P ∨ Q)∧ ~(Q ∨ P)
(B) (~P ∨ Q)∧ (~Q ∨ P)
(C) (P ∨ Q) ∧ (Q ∨ P)
(D) ~(P ∨ Q)→ ~(Q ∨ P)
View/Hide Ans
Correct Answer is B
58. Which of the following statements is true for Branch-and-Bound search?
(A) Underestimates of remaining distance may cause deviation from optimal path.
(B) Overestimates can’t cause right path to be overlooked.
(C) Dynamic programming principle can be used to discard redundant partial paths.
(D) All of the above
View/Hide Ans
Correct Answer is C
59. Match the following with respect to heuristic search techniques:
Codes:
List I
List II
(a) Steepest-accent Hill Climbing
(i) Keeps track of all partial paths which can be candidate for further exploration
(b) Branch-and-bound
(ii) Discover problem state(s) that satisfy a set of constraints
(c) Constraint satisfaction
(iii) Detects difference between current state and goal state
(d) Means-end-analysis
(iv) Considers all moves from current state and selects best move
(A) (a-i) (b-iv) (c-iii) (d-ii)
(B) (a-iv) (b-i) (c-ii) (d-iii)
(C) (a-i) (b-iv) (c-ii) (d-iii)
(D) (a-iv) (b-ii) (c-i) (d-iii)
View/Hide Ans
Correct Answer is B
60. Match the following for methods of MIS development:
Codes:
List I
List II
(a) Joint Application Design(JAD)
(i) Delivers functionality in rapid iteration measured in weeks and needs frequent communication, development, testing and delivery
(b) Computer Aided Software Engg
(ii) Reusable applications generally with one specific function. It is closely linked with idea of web services and service oriented architecture.
(c) Agile development
(iii) Tools to automate many tasks of SDLC
(d) Component based technology
(iv) A group based tool for collecting user requirements and creating system design. Mostly used in analysis and design stages of SDLC
(A) (a-i) (b-iii) (c-ii) (d-iv)
(B) (a-iv) (b-iii) (c-i) (d-ii)
(C) (a-iii) (b-iv) (c-i) (d-ii)
(D) (a-iii) (b-i) (c-iv) (d-ii)
View/Hide Ans
Correct Answer is B
61. A context free grammar for L={w|n0(w)>n1(w)} is given by:
(A) S → 0|0S|1SS
(B) S → 0S|1S|0SS|1SS|0|1
(C) S → 0|0S|1SS|S1S|SS1
(D) S → 0S|1S|0|1
View/Hide Ans
Correct Answer is C
62. Given the following two statements:
S1: If L1 and L2 are recursively enumerable languages over ∑, then L1∪L2 and L1∩L2 are also recursively enumerable.
S2: The set of recursively enumerable languages is countable.
Which of the following is correct?
(A) S1 is correct and S2 is not correct
(B) S1 is not correct and S2 is correct
(C) Both S1 and S2 are not correct
(D) Both S1 and S2 are correct
View/Hide Ans
Correct Answer is D
63. Given the following grammars:
G1: S → AB|aaB
A → aA|∈
B → bB|∈
G2: S → A|B
A → aAb|ab
B→abB|∈
Which of the following is correct?
(A) G1 is ambiguous and G2 is unambiguous grammars
(B) G1 is unambiguous and G2 is ambiguous grammars
(C) Both G1 and G2 are ambiguous grammars
(D) Both G1 and G2 are unambiguous grammars
View/Hide Ans
Correct Answer is C
64. Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is:
(A) 67/30
(B) 70/34
(C) 76/30
(D) 78/30
View/Hide Ans
Correct Answer is C
65. The redundancy in images stems from:
(A) pixel decorrelation
(B) pixel correlation
(C) pixel quantization
(D) image size
View/Hide Ans
Correct Answer is B
66. In a binary Hamming code the number of check digits is r then number of message digits is equal to:
(A) 2r-1
(B) 2r-r-1
(C) 2r-r+1
(D) 2r+r-1
View/Hide Ans
Correct Answer is B
67. In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of:
(A) rows or columns
(B) rows+columns
(C) rows+columns-1
(D) rows+columns+1
View/Hide Ans
Correct Answer is A
68. Consider the following transportation problem:
69. Given the following statements with respect to linear programming problem:
S1: The dual of the dual linear programming problem is again the primal problem
S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution
S3: If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.
Which of the following is true?
(A) S1 and S2
(B) S1 and S3
(B) S2 and S3
(D) S1, S2 and S3
View/Hide Ans
Correct Answer is D
70. Consider the two class classification task that consists of the following points:
Class C1: [1 1.5] [1 -1.5]
Class C2: [-2 2.5] [-2 -2.5]
The decision boundary between the two classes using single perceptron is given by:
(A) x1+x2+1.5=0
(B) x1+x2-1.5=0
(C) x1+1.5=0
(D) x1-1.5=0
View/Hide Ans
Correct Answer is C
71. Let A and B be two fuzzy integers defined as:
A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)}
B={(10,0.5), (11,1), (12,0.5)}
Using fuzzy arithmetic operation given by
72. Suppose the function y and a fuzzy integer number around -4 for x are given as
y=(x-3)2+2
Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around -4) is given by:
(A) {(2,0.6), (3,0.3), (6,1), (11,0.3)}
(B) {(2,0.6), (3,1), (6,1), (11,0.3)}
(C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}
(D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}
View/Hide Ans
Correct Answer is C
73. Match the following for unix system calls:
Codes:
List I
List II
(a) exec
(i) Creates a new process
(b) brk
(ii) Invokes another program overlaying memory space with a copy of an executable file
(c) wait
(iii) To increase or decrease the size of data region
(d) fork
(iv) A process synchronizes with termination of child process
(A) (a-ii) (b-iii) (c-iv) (d-i)
(B) (a-iii) (b-ii) (c-iv) (d-i)
(C) (a-iv) (b-iii) (c-ii) (d-i)
(D) (a-iv) (b-iii) (c-i) (d-ii)
View/Hide Ans
Correct Answer is A
74. WOW32 is a:
(A) Win 32 API library for creating processes and threads.
(B) Special kind of file system to the NT name space.
(C) Kernel - mode objects accessible through Win32 API
(D) Special execution environment used to run 16 bit Windows applications on 32 - bit machines.
View/Hide Ans
Correct Answer is D
75. The Unix command:
$ vi file1 file2
(A) Edits file1 and stores the contents of file1 in file2
(B) Both files i.e. file1 and file2 can be edited using ‘ex’ command to travel between files
(C) Both files can be edited using the ‘mv’ command to move between the files
(D) Edits file1 first, saves it and the edits file2
View/Hide Ans
Correct Answer is B
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy