UGC NET Practice questions with Solutions
Q.1 An and and gate has 7 input how many input words arein truth table?
64
32
16
128
solution:
To represent 7 inputs, 2^7 input words are required in truth table.
2^7=128
Thus the correct option is D.
Q.2 A combinational logic circuit which is used to send data coming a single source to two or more separate destinations is called
A. decoder
B. encoder
C. multiplexer
D. Demultiplexer
Solution:
Multiplexer is a data selector which takes several inputs and gives a single output.
Demultiplexer is a data distributor which takes a single input and gives several outputs.
Q.3 In 2NF
No functional dependencies exist
No multivalued dependencies exist
No partial functional dependencies exist
No partial multivalued dependencies exist
Solution:
A relation that is in 2NFmust be in 1 NF.
For 1NF, their should be no atomic value in the relation.
For 2NF, their should be no partial functional dependency.
thus the correct option is C.
Q.4 There are ______ cells in a 4-variable K-map.
12
16
18
8
Explanation: There are 16 = (2^4) cells in a 4-variable K-map.
Q.5 The Boolean function with the Karnaugh map
00. 01. 11. 10
A. (A+C).D+B
B. (A+B).C+D
C.(A+D).C+B
D. (A+C).B+D
Explanation: To find the boolean function here we will use K-map
Select neighbouring Minterms as max as possible in powers of 2 ie 2 ,4,8 and so on.
Here we have selected group of minterms:
First we will take 8 minterms group which will give us B.
Now take 4 minterms group it will give us CD.
Another 4 minterms group will give us AD.
We have the expression B + CD + AD.
which can be reduced as B + D ( A + C )
So, option A is correct.
Q.6 Don’t care conditions can be used for simplifying Boolean expressions in ___________
Registers
Terms
K-maps
Latches
Q.7 which one of the following is not an informed search technique?
Hill climbing search
best first search
A* search
Depth first search
Q.8 skolomization is the process of A. bringing all the quantifiers in the beginning of a formula
B. removing all the universal quantifiers
C. removing all the existential quantifiers
D. all of the above
Q.9 Standard planning algorithms assume environment to be………..
Both deterministic and full observable
Neither deterministic nor fully observable
deterministic but not fully observable
not deterministic but fully observable
Q.10 Match the following:
A.Supervisor learning 1.The decision system receives rewards for its action at the end of a sequence of a steps.
B. Unsupervised learning 2. Manual labels of input are not used.
C.Reinforcement learning 3.Manual labels of inputs are used.
D.Inductive learning 4.System learns by example
Codes:
a b c d
A 1 2 3 4
B 2 3 1 4
C 3 2 4 1
D 3 2 1 4
Q.11 Match the following:
A. Script 1. Directed graph with labelled nodes for graphical representation of knowledge
B. Conceptual dependencies 2. Knowledge about objects and events is stored in a record like structures consisting of a slots and slot values. C.Frames. 3. Primitive concepts and rules to represent natural language statements
D. Associative network. 4. Frame likes structures used to represent stereotypical pattern for commonly occurring events in terms of actors,rules, props and scenes
code:
a b c d
A 4 2 1 3
B 4 3 2 1
C 2 3 4 1
D 1 3 4 2
Q.12 Match the following components of an expert system:
A.I/O interface i. Accepts user's queries and responds to question through I/O interface
B. Explanation module ii. Contains facts and rules about the domain
C. Inference engine iii. Gives the user, the ability to follow inferencing steps at any time during consultation
D. Knowledge base. iv. Permits the user to communicate with the system in natural way
code:
a b c d
A i. iii. iv ii
B. iv iii. i. ii
C i iii. ii. iv
D iv i iiii. ii
Q.13
code:
a b c d
A i. iii. iv ii
B. iv iii. ii i
C i iii. ii. iv
D iv i iiii. ii
Q 14. Forward chaining systems are …….where as backward chaining systems are………
A. Data driven ,Data driven
B. Goal driven,Data driven
C. Data driven, Goal driven
D.Goal driven, Goal driven
Q.15 Reasoning strategies used in expert systems include………..
A. Forward chaining, backward chaining and problem reduction
B. Forward chaining, backward chaining and boundary mutation
C. Forward chaining, backward chaining and back propagation D.Backward chaining, problem reduction and boundary mutation
Q.16 An agent can improve its performance by
A. Perceiving
B.Responding
C. Learning
D. Observing
Q.17 Which of the following is true for semi-dynamic environment?
The environment may change while the agent is deliberating.
The environment itself does not change with the passage of time but the agent's performance score does.
Even if the environment changes with the passage of time while deliberating, the performance score does not change.
Environment and performance score,both change simultaneously.
Q.18 In artificial intelligence,which agent deals with happy and unhappy state?
A. Simple reflex agent
B. Model based agent
C. Learning agent
D. Utility based agent
Q.19 Which of the examples below expresses the commutative law of multiplication?
A + B = B + A
A • B = B + A
A • (B • C) = (A • B) • C
A • B = B • A
Explanation: The commutative law of multiplication is (A * B) = (B * A).
The commutative law of addition is (A + B) = (B + A).
Q.20 Which of the following expressions is in the sum-of-products form?
A.(A + B)(C + D)
B. (A * B)(C * D)
C. A* B *(CD)
D. A * B + C * D
