Free download in PDF Computer Science Multiple Choice Questions(MCQs) & Answers. These multiple choice questions on Computer Science are very useful for NIELIT, BCA, B.Sc. MCA, M.Sc. B.Tech, M.Tech, BE, ME students an interview for various positions like Web Developer, System Analyst etc.
1
High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences ?
3
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 the current node to the goal node, then A* algorithm gives an optimal solution if
4
The mean-end analysis process centers around the detection of differences between the current state and 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 establish the precondition of operators is called
5
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.
6
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
8
An artificial neuron 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.
9
Consider the formula in image processing R D = 1 – 1 CR
Where CR =
n1 n2
C R 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
SEND
+ MORE
MONEY
Can be solved efficiently using
18
Pumping lemma for context-free languages states : Let L be an infinite context free language. Then there exists some positive integer m such that any w ∈ L with |w| ≥ m can be decomposed as w = uv xy Z with |vxy| _________ and |vy| _________ such that uv . z xy. z Z ∈ L for all .z = 0, 1, 2, ....... .
20
Given the following statements : S 1 : Every context-sensitive language L is recursive. S 2 : There exists a recursive language that is not context sensitive. Which statement is correct ?