Computer Science MCQs | Computer Science Multiple Choice Questions with Answers

Questions
1 You are given four images represented as I 1 =       00 00 , I2 =       01 00 , I 3 =       01 10 , I4 =       11 10 The value of entropy is maximum for image
A I1
B I2
C I3
D I4

Answer: Option [C]
2 A cryptarithmetic problem of the type SEND + MORE MONEY Can be solved efficiently using
A depth first technique
B breadth first technique
C constraint satisfaction technique
D bidirectional technique

Answer: Option [B]
3 A * algorithm is guaranteed to find an optimal solution if
A h' is always 0
B g is always 1
C h' never overestimates h
D h' never underestimates h

Answer: Option [B]
4 Let (x, y, z) be the statement “x + y = z” and let there be two quantifications given as (i) x y Z (x, y, z) (ii) Z x y (x, y, z) Where x, y, z are real numbers. Then which one of the following is correct ?
A (i) is true and (ii) is true
B (i) is true and (ii) is false
C (i) is false and (ii) is true
D (i) is false and (ii) is false

Answer: Option [A]
5 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

Answer: Option [B]
6 Given the problem to maximize f(x), X = (x1, x2,......xn) subject to m number of inequality constraints. g i(x) ≤ bi, i = 1, 2......m including the non-negativity constraints x ≥ 0. Which of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at – x ?
A ∂L(– X, – λ , – S) ∂xj = 0, j = 1, 2….m
B – λi [gi (–X) – bi]= 0, i = 1, 2 ….m
C gi ( – X) ≤ bi, i = 1, 2 ….m
D All of these

Answer: Option [B]
7 The following Linear Programming problem has : Max Z = x1 + x2 Subject to x1 – x2 ≥ 0 3 x1 – x2 ≤ –3 and x1, x2 ≥ 0
A Feasible solution
B No feasible solution
C Unbounded solution
D Single point as solution

Answer: Option [B]
8 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

Answer: Option [B]
9 Function points can be calculated by
A UFP ∗ CAF
B UFP ∗ FAC
C UFP ∗ Cost
D UFP ∗ Productivity

Answer: Option [A]
10 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

Answer: Option [B]
11 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

Answer: Option [B]
12 Which once 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

Answer: Option [D]
13 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)

Answer: Option [C]
14 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

Answer: Option [C]
15 Which of the following concepts means adding new concepts to a program as it runs ?
A Data hiding
B Dynamic typing
C Dynamic loading
D Dynamic binding

Answer: Option [B]
16 Which of the following correctly describes overloading of functions ?
A Virtual polymorphism
B Transient polymorphism
C Ad-hoc polymorphism
D Pseudo polymorphism

Answer: Option [C]
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

Answer: Option [A]
18 C++ actually supports the following two complete dynamic 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

Answer: Option [B]
19 Important advantage of using new and delete operators 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

Answer: Option [D]
20 Given the following statements : S 1 : The grammars S → asb | bsa | ss | a and S → asb | bsa | a are not equivalent. S 2 : 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/div>

Answer: Option [A]