wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

AI ML LCA-01 QUIZ

Total questions: 12

Worksheet time: 22mins

Name
Class
Date
1.

Consieder python code: >> marks =[ 89, 78, 45, 23, 12]

>>marks .pop(1)

what will be the output ?

a)

89

b)

45

c)

1

d)

78

2.

Consider python code : >> Number = [1, 2, 3]

I want to add numbers 8 & 9 numbers in the above list , suggest which method I can use ?

a)

Number.append (8,9)

b)

Number.extend (8,9)

c)

Number.add(8,9)

d)

all three options are correct .

3.

consider python code : >> TYWPU= { 'AIML': 01, 'CSP': 02, 'DCN':03, 'IPR':04}

TYWPU.keys ( )

What will be the output ?

a)

dict.keys([AIML' 'CSP', 'DCN', 'IPR'])

b)

'AIML':01

c)

dict.keys([01' '02', '03', '04'])

d)

NONE OF THE OPTIONS ARE CORRECT

4.

Consider python code : >>numbers = {1, 2, 3, 3, 4}

select correct answer

a)

numbers is Class in python

b)

numbers is list in python

c)

numbers is Dictionary in python

d)

numbers is set in python

5.

In problem solving using search method , AI agents are .....................

a)

reflex based agents

b)

Utility Based Agents

c)

Goal based agents

d)

Simple agents

6.

The Graph is ..............type of data structure .

a)

Static data structure

b)

Dynamic data structure

c)

linear data structure

d)

Non Linear data structure

7.

BFS Searching algorithm works on ......................principle

a)

LIFO

b)

FIFO

c)

FILO

d)

LIFO & FILO

8.

The Graph data structure is represented using ....................... in python .

a)

Tupple

b)

List

c)

class

d)

Dictionary

9.

Level by level Traversing is done in................

a)

BFS algorithm

b)

DFS algorithm

10.

DFS algorithm follows ...................data structure .

a)

Queue

b)

Stack

c)

Array

d)

tree

11.

Consider given graph for BFS algorithm . Find the traversing sequence or queue of visited nodes .( node 0 is root node )

a)

0,2,3,1,4,5,6

b)

0,1,2,3,4,5,6,

c)

0,3,4,5,6,2,1,

d)

0, 3, 2, 1, 4, 5, 6.

12.

consider adjancy list of a graph . Identify the correct graph from following graphs .

Graph={

A=[B,D]'

B= ['C,D]'

C=[ E],

D=[E],

E=[ ]

}

a)

b)

c)

d)