wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Applications of DMS in A.I AND GATE/JNTUH/NPTEL/PLACEMENTS probl

Total questions: 40

Worksheet time: 39mins

Name
Class
Date
1.

How is graph theory used in A.I.?

a)

Graph theory is used to compose music in A.I.

b)

Graph theory is used to model relationships between data points, represent knowledge graphs, optimize search algorithms, and analyze neural networks.

c)

Graph theory is used to design user interfaces in A.I.

d)

Graph theory is used to study weather patterns in A.I.

2.

Explain the role of propositional logic in A.I.

a)

Propositional logic provides a formal language for representing knowledge and reasoning in AI.

b)

Propositional logic helps in natural language processing in AI.

c)

Propositional logic is used for image recognition in AI.

d)

Propositional logic is primarily used for data storage in AI.

3.

What is the significance of set theory in A.I.?

a)

Set theory provides a foundation for defining and manipulating relationships between objects in A.I.

b)

Set theory helps in creating visual effects in A.I.

c)

Set theory is used to predict human behavior in A.I.

d)

Set theory is primarily used for weather forecasting in A.I.

4.

Discuss the application of combinatorics in A.I.

a)

Combinatorics is applied in A.I. for analyzing algorithms, data structures, and decision-making processes.

b)

Combinatorics is used in A.I. for weather forecasting.

c)

Combinatorics is applied in A.I. for medical diagnosis.

d)

A.I. utilizes combinatorics for social media analysis.

5.

How are probability and statistics applied in A.I.?

a)

A.I. solely relies on deterministic algorithms.

b)

There is no connection between probability, statistics, and A.I.

c)

Probability and statistics are not relevant in A.I.

d)

Probability and statistics are applied in A.I. through techniques like Bayesian networks, Markov models, and statistical learning algorithms.

6.

Explain the concept of recursion in A.I. with examples.

a)

Recursion in A.I. is only used for simple tasks and cannot handle complex problems

b)

Recursion in A.I. can be illustrated with the example of a decision tree algorithm, where the algorithm recursively splits the data based on certain criteria until a stopping condition is met, resulting in a tree-like structure that helps in making predictions.

c)

Recursion in A.I. involves repeating the same task over and over without any stopping condition

d)

Recursion in A.I. always leads to infinite loops and crashes the system

7.

Discuss the importance of discrete structures in A.I.

a)

Discrete structures are only used in basic programming, not A.I.

b)

Continuous structures are more relevant in A.I.

c)

Discrete structures form the backbone of algorithms and data representation in A.I.

d)

A.I. does not rely on any specific type of structures

8.

What is the role of algorithms in A.I.?

a)

Algorithms in A.I. are primarily used for physical tasks.

b)

Algorithms in A.I. are essential for processing data, making decisions, and learning from patterns.

c)

Algorithms in A.I. have no impact on data processing.

d)

Algorithms in A.I. are only used for entertainment purposes.

9.

How does A.I. utilize finite automata?

a)

Finite automata are used as a theoretical framework for designing algorithms in A.I. to process input data and make decisions based on predefined rules.

b)

Finite automata are used in A.I. to predict human emotions accurately.

c)

A.I. utilizes finite automata to generate random outputs without any logic.

d)

Finite automata in A.I. are designed to mimic animal behavior in the wild.

10.

Explain the concept of decision trees in A.I.

a)

Decision trees are a machine learning algorithm that recursively splits the data based on feature values to create a tree-like structure of decisions.

b)

Decision trees are a type of computer hardware used in A.I.

c)

Decision trees are a type of plant species used in A.I.

d)

Decision trees are a mathematical formula to calculate probabilities in A.I.

11.

Discuss the application of logic gates in A.I.

a)

Logic gates are not used in AI as they are outdated technology.

b)

Logic gates play a crucial role in AI by enabling the manipulation and processing of data through logical operations.

c)

AI does not involve any logical operations, so logic gates are irrelevant.

d)

Logic gates are only used in hardware and have no application in AI.

12.

How are matrices used in A.I.?

a)

Matrices are used in A.I. for calculating weather patterns

b)

Matrices are used in A.I. for generating random numbers

c)

Matrices are used in A.I. for tasks such as representing data, performing operations like matrix multiplication for neural networks, and solving systems of linear equations.

d)

Matrices are used in A.I. for creating 3D graphics

13.

Explain the concept of neural networks in A.I.

a)

Neural networks in A.I. are based on the principles of quantum mechanics.

b)

Neural networks in A.I. are only used for simple tasks and cannot handle complex data.

c)

Neural networks in A.I. are physical networks of wires and cables.

d)

Neural networks in A.I. are algorithms inspired by the human brain's structure, consisting of interconnected nodes organized in layers that process input data to recognize patterns and make decisions.

14.

Discuss the application of game theory in A.I.

a)

Game theory is used in A.I. to predict weather patterns

b)

Game theory in A.I. focuses on analyzing historical data

c)

Game theory is irrelevant in the field of A.I.

d)

Game theory is applied in A.I. to model strategic interactions and decision-making processes among multiple agents.

15.

How does A.I. utilize search algorithms?

a)

By relying solely on user input without any algorithmic assistance

b)

By using search algorithms like binary search, linear search, interpolation search, etc.

c)

By randomly selecting paths without any algorithmic guidance

d)

By applying search algorithms like depth-first search, breadth-first search, A* search, etc., to navigate through large search spaces efficiently.

16.

Consider the following statements:
P: Good mobile phones are not cheap
Q: Cheap mobile phones are not good

L: P implies Q
M: Q implies P
N: P is equivalent to Q

Which of the following about L, M, and N is Correct? [GATE CSE ]

a)

Only L is TRUE

b)

Only M is TRUE

c)

Only N is TRUE

d)

L, M, and N are TRUE

17.
  1. Let A, B and C be non-empty sets and let X=(A−B)−C and Y=(A−C)−(B−C). Which one of the following is TRUE?

  2. (GATE CSE )

a)
  1. X = Y

b)

XcY

c)

YcX

d)

NONE

18.

Let p and q be the following propositions:

p: Fail grade can be given.

q: Student scores more than 50% marks.

Consider the statement: “Fail grade cannot be given when student scores more than 50% marks.”

Which one of the following is the CORRECT representation of the above statement in propositional logic?

a)

q --> !p

b)

q --> p

c)

p --> q

d)

!p --> q

19.

13 to the power 99 divided by 17 then remainder is ?

(a)  

20.

find correct solution

a)

A

b)

B

c)

C

d)

D

21.

The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is __________

a)

reflective, symmetric and transitive

b)

irreflexive, symmetric and transitive

c)

neither reflective, nor irreflexive but transitive

d)

irreflexive and antisymmetric

22.

Consider the relation: R’ (x, y) if and only if x, y>0 over the set of non-zero rational numbers,then R’ is _________

a)

not equivalence relation

b)

an equivalence relation

c)

transitive and asymmetry relation

d)

reflexive and antisymmetric relation

23.

Consider the binary relation, A = {(a,b) | b = a – 1 and a, b belong to {1, 2, 3}}. The reflexive transitive closure of A is?

a)

{(a,b) | a >= b and a, b belong to {1, 2, 3}}

b)

{(a,b) | a > b and a, b belong to {1, 2, 3}}

c)

{(a,b) | a <= b and a, b belong to {1, 2, 3}}

d)

{(a,b) | a = b and a, b belong to {1, 2, 3}}

24.

Let R1 be a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} and R2 be another relation from B to C = {1, 2, 3, 4} as defined below:
i. An element a in A is related to an element b in B (under R1) if a b is divisible by 3.
ii. An element a in B is related to an element b in C (under R2) if a
b is even but not divisible by 3. Which is the composite relation R1R2 from A to C?

a)

R1R2 = {(1, 2), (1, 4), (3, 3), (5, 4), (5,6), (7, 3)}

b)

Φ

c)

R1R2 = {(1, 2), (1,6), (3, 2), (3, 4), (5, 4), (7, 2)}

d)

R1R2 = {(2,2), (3, 2), (3, 4), (5, 1), (5, 3), (7, 1)}

25.

The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________

a)

O(n)

b)

O(logn)

c)

O(n(n+(3/2)))

d)

O(n3)

26.

Let A and B be two non-empty relations on a set S. Which of the following statements is false?

a)

A and B are transitive ⇒ A∩B is transitive

b)

A and B are symmetric ⇒ A∪B is symmetric

c)

A and B are transitive ⇒ A∪B is not transitive

d)

A and B are reflexive ⇒ A∩B is reflexive

27.

Determine the characteristics of the relation aRb if a2 = b2.

a)

Transitive and symmetric

b)

Reflexive and asymmetry

c)

Trichotomy, antisymmetry, and irreflexive

d)

Symmetric, Reflexive, and transitive

28.

Let R be a relation between A and B. R is asymmetric if and only if ________

a)

Intersection of D(A) and R is empty, where D(A) represents diagonal of set

b)

R-1 is a subset of R, where R-1 represents inverse of R

c)

Intersection of R and R-1 is D(A)

d)

D(A) is a subset of R, where D(A) represents diagonal of set

29.

Consider the congruence 45≡3(mod 7). Find the set of equivalence class representatives.

a)

{…, 0, 7, 14, 28, …}

b)

{…, -3, 0, 6, 21, …}

c)

{…, 0, 4, 8, 16, …}

d)

{…, 3, 8, 15, 21, …}

30.

Which of the following relations is the reflexive relation over the set {1, 2, 3, 4}?

a)

{(0,0), (1,1), (2,2), (2,3)}

b)

{(1,1), (1,2), (2,2), (3,3), (4,3), (4,4)}

c)

{,(1,1), (1,2), (2,1), (2,3), (3,4)}

d)

{(0,1), (1,1), (2,3), (2,2), (3,4), (3,1)

31.

Determine the partitions of the set {3, 4, 5, 6, 7} from the following subsets.

a)

{3,5}, {3,6,7}, {4,5,6}

b)

{3}, {4,6}, {5}, {7}

c)

{3,4,6}, {7}

d)

{5,6}, {5,7}

32.

Determine the number of possible relations in an antisymmetric set with 19 elements.

a)

23585

b)

2.02 * 1087

c)

9.34 * 791

d)

35893

33.

For a, b ∈ Z define a | b to mean that a divides b is a relation which does not satisfy ___________

a)

irreflexive and symmetric relation

b)

reflexive relation and symmetric relation

c)

transitive relation

d)

symmetric relation

34.

Which of the following is an equivalence relation on R, for a, b ∈ Z?

a)

(a-b) ∈ Z

b)

(a2+c) ∈ Z

c)

(ab+cd)/2 ∈ Z

d)

(2c3)/3 ∈ Z

35.

If A is any statement, then which of the following is a tautology?

a)

A ∧ F

b)

A ∨ F

c)

A ∨ ¬A

d)

A ∧ T

36.

main() { int n;

n=f1(4);

printf("%d",n); }

f1(int x) { int b;

if(x==1)

return 1;

else

b=x*f1(x-1);

return b; }

a)

24

b)

4

c)

12

d)

10

37.

main() { int n,i; n=f(6); printf("%d",n); } f(int x) { if(x==2) return 2; else { printf("+"); f(x-1); } }

a)

++++2

b)

+++++2

c)

+++++

d)

2

38.

Consider the following recursive function fun(x, y). What is the value of fun(4, 3) 

int fun(int x, int y) { if (x == 0) return y; return fun(x - 1, x + y); }

a)

13

b)

12

c)

9

d)

10

39.

What does the following function do? 

int fun(int x, int y) { if (y == 0) return 0; return (x + fun(x, y-1)); }

a)

x + y

b)

x + x*y

c)

x*y

d)

xy

40.

void Aaryan(int n, int a, int b) { if (n <= 0)

return; Aaryan(n - 1, a, b + n);

printf("%d %d %d \n",n,a,b);

Aaryan(n-1, b, a+n); }

int main() { Aaryan(3, 4, 5); return 0; }

a)

1 4 10

2 4 8

1 8 6

3 4 5

1 5 9

2 5 7

1 7 7

b)

3 4 5

1 4 10

2 4 8

1 8 6

1 5 9

2 5 7

1 7 7

c)

1 4 10

2 4 8

1 8 6

3 4 5

d)

3 4 5

1 5 9

2 5 7

1 7 7