DS Foundation End Term January 2024 FN

Indian Institute of Technology, Madras - BS in Data Science and Applications
Notations :
1.Options shown in green color and with icon are correct.
2.Options shown in red color and with icon are incorrect.
IIT M FOUNDATION DIPLOMA FN EXAM

Question Paper Name :
QDF1 28 Apr 2024
Subject Name : 2024 Apr28: IIT M FN EXAM QDF1
Creation Date : 2024-04-16 12:17:02
Duration : 90
Total Marks : 974
Display Marks: Yes
Share Answer Key With Delivery Engine : Yes
Actual Answer Key : Yes
Calculator : Scientific
Magnifying Glass Required? : No
Ruler Required? : No
Eraser Required? : No
Scratch Pad Required? : No
Rough Sketch/Notepad Required? : No
Protractor Required? : No
Show Watermark on Console? : Yes
Highlighter : No
Auto Save on Console? Yes
Change Font Color : No
Change Background Color : No

Change Theme : No
Help Button : No
Show Reports : No
Show Progress Bar : No
Group I
Group Number : 1
Group Id : 64065318430
Group Maximum Duration : 0
Group Minimum Duration : 90
Show Attended Group? : No
Edit Attended Group? : No
Break time : 0
Group Marks : 974
Is this Group for Examiner? : No
Examiner permission : Cant View
Show Progress Bar? : No
Revisit allowed for group Instructions? : Yes
Maximum Instruction Time : 0
Minimum Instruction Time : 0
Group Time In : Minutes
Navigate To Group Summary From Last Question? : No
Disable Submit Button During Assessment? : No
Section Selection Time? : 0
No of Optional sections to be attempted : 0
Sem1 CT
Section Id : 64065356651
Section Number : 1
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 17
Number of Questions to be attempted : 17
Section Marks : 100
Display Number Panel : Yes
Section Negative Marks : 0
Group All Questions : No
Enable Mark as Answered Mark for Review and

Yes
Clear Response :
Sub-Section Number : 1
Sub-Section Id : 640653118629
Question Shuffling Allowed : No
Is Section Default? : null
Question Number : 1 Question Id : 640653814914 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 0
Question Label : Multiple Choice Question
THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL : SEMESTER I:

COMPUTATIONAL THINKING (COMPUTER BASED EXAM)"
ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT?
CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECTS TO BE WRITTEN.
(IF IT IS NOT THE CORRECT SUBJECT, PLS CHECK THE SECTION AT THE TOP FOR THE SUBJECTS
REGISTERED BY YOU)
Options :
6406532730503. YES
6406532730504. NO

Time : 0
Correct Marks : 0

Options :
6406532730505. Useful Data has been mentioned above.
6406532730506. This data attachment is just for a reference & not for an evaluation.
Question Shuffling Allowed : Yes


Time : 0
Correct Marks : 5
What will N represent at the end of the execution?
Options :
6406532730512. Minimum number of bills issued to a single customer
6406532730513. Maximum number of bills issued to a single customer
6406532730514. Number of distinct customers in the dataset
6406532730515. Maximum number of customers who purchased items from the same shop
Time : 0
Correct Marks : 5
Options :
6406532730529.
6406532730530.
6406532730531.
6406532730532.

Time : 0
Correct Marks : 6
Options :
6406532730516.
6406532730517.
6406532730518.
6406532730519.

Time : 0
Correct Marks : 6

Options :
6406532730533.
6406532730534.
6406532730535.
6406532730536.

Time : 0
Correct Marks : 6

Options :
6406532730537.
6406532730538.
6406532730539.
6406532730540.
Question Number : 8 Question Id : 640653814916 Question Type : MSQ Is Question

Time : 0
Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Options :
6406532730507.
6406532730508.
6406532730509.
6406532730510.
6406532730511.

Time : 0

Options :
6406532730520.
6406532730521.
6406532730522.
6406532730523.

Time : 0

Options :
6406532730541. There might be a change in the value of A, based on the order of rows
6406532730542. The value of N does not depend on the order of rows.
6406532730543. There will be NO change in the values of both A and N, based on the order of
rows
6406532730544. There might be a change in the value of N, based on the order of rows

Time : 0

Options :
6406532730553. Line 3: variable 'inserted' is initialised to True so it will never enter the nested if
block for comparison.
6406532730554. Line 6: inside if statement condition should be 'x > z'.
6406532730555. Line 11: [z] needs to be appended to the end of newList
6406532730556. Line 14: 'x' is appended to the end of the list instead of the beginning.

Time : 0

Options :
6406532730557.
6406532730558.
6406532730559.
6406532730560.
6406532730561.
6406532730562.
Question Id : 640653814927 Question Type : COMPREHENSION Sub Question Shuffling

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (13 to 14)
Question Label : Comprehension
Based on the above data, answer the given subquestions.
Sub questions

Time : 0
Correct Marks : 4
What will A represent at the end of the execution?
Options :
6406532730545. Number of female students whose Physics marks are at least 91
6406532730546. Number of male students whose Physics marks are at least 90
6406532730547. Number of female students whose Physics marks are at least 90
6406532730548. Number of male students whose Physics marks are at most 91

Time : 0
Correct Marks : 4
What will B represent at the end of the execution?
Options :
6406532730549. Number of students whose Physics marks are at most 90 and Chemistry marks
are at least 86
6406532730550. Number of female students whose Physics marks are at least 91 and Chemistry
marks are at least 86
6406532730551. Number of female students whose Physics marks are at least 90 and Chemistry
marks are at most 85
6406532730552. Number of male students whose Physics marks are at least 91 and Chemistry
marks are at least 86


Sub questions

Time : 0
Correct Marks : 4
How many times will the procedure calculate be called, including the initial call in line 1?
Options :
6406532730524. length(listL)
6406532730525. length(listL) - 1
6406532730526. length(listL) + 1
6406532730527. Depends on the elements in listL
Question Number : 16 Question Id : 640653814922 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 5
Question Label : Short Answer Question
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :


Sub questions

Correct Marks : 5

Possible Answers :

Correct Marks : 4
Possible Answers :

Sub questions

Time : 0
Correct Marks : 5
What will evaluate(L1, L2) return?
Options :
6406532730563. []
6406532730564. [7, 1, 7, 7]
6406532730565. [7, 7, 1, 7]
6406532730566. [7, 7, 7, 7]

Time : 0
Correct Marks : 5
Options :
6406532730567. []
6406532730568. [7, 1, 7, 7]
6406532730569. [7, 7, 1, 7]
6406532730570. [7, 7, 7, 7]


Sub questions

Time : 0
Correct Marks : 5

What will the value of L be after execution of the given pseudocode?
Options :
6406532730573. L = [4, 0, 1, 2, 3, 5]
6406532730574. L = [4, 1, 0, 2, 3, 5]
6406532730575. L = [4, 1, 2, 3, 5, 0]
6406532730576. L = [4, 0, 2, 3, 5, 1]

Time : 0
Correct Marks : 5
What will the value of D be after execution of the given pseudocode?
Options :
6406532730577.
6406532730578.
6406532730579.
6406532730580.
Sem2 Intro to Python

Section Id : 64065356652
Section Number : 2
Section Marks : 50

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL : SEMESTER II:
INTRODUCTION TO PYTHON (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532730581. YES
6406532730582. NO

Time : 0
Correct Marks : 0

Options :


Time : 0
Correct Marks : 3

Options :
6406532730585. Only snippet-1 is correct
6406532730586. Only snippet-2 is correct
6406532730587. Both snippets are correct
6406532730588. Both snippets are incorrect

Time : 0
Correct Marks : 3
Options :
6406532730589. 6
6406532730590. 1
6406532730591. 2
6406532730592. 7

Time : 0
Correct Marks : 3
Options :
6406532730593.
6406532730594.
6406532730595.
6406532730596.
Time : 0
Correct Marks : 3
Options :
6406532730597.
6406532730598.
6406532730599.
6406532730600.

Time : 0
Correct Marks : 3

Options :
6406532730601. The function returns the pair of 'Laptop' and 'Earphone' products with the
minimum price difference, considering only products with the same brand.
maximum price difference, considering only products with the same brand.
minimum price difference, considering all available products without considering the brand.
maximum price difference, considering all available products without considering the brand.

Time : 0
Correct Marks : 3
Options :
6406532730605.
6406532730606.
6406532730607.
6406532730608.

Time : 0
Options :
6406532730609. Code-1 will throw an error in line-2
6406532730612. Code-1 will run without any error
6406532730613. Code-2 will run without any error

Time : 0

Options :
6406532730614.
6406532730615.
6406532730616.
6406532730617.

Time : 0

Options :
6406532730618. It is the number of odd positive integers less than or equal to 51 that are
divisible by 3.
6406532730619. It is the number of even positive integers less than or equal to 51 that are
divisible by 3.
6406532730620. It is the number of odd positive integers less than or equal to 51 that are not
divisible by 3.
6406532730621. The output of the above code is 17.
6406532730622. The output of the above code is 9.

Correct Marks : 3

Possible Answers :
15

Correct Marks : 3

Possible Answers :
11

Correct Marks : 3

Possible Answers :

Correct Marks : 3

Possible Answers :
576

Correct Marks : 4

Possible Answers :


Sub questions

Time : 0
Correct Marks : 1.5

Options :
6406532730628.
6406532730629.
6406532730630.
6406532730631.
6406532730632.

Correct Marks : 1.5

Possible Answers :

Study the following code and answer the given subquestions.

The given subquestions are independent of each other. Think of each subquestion as a separate
execution of the code snippet given above.
Sub questions

Correct Marks : 2
Possible Answers :

Time : 0
Correct Marks : 2
Options :
6406532730635. "-2"
6406532730636. -2
6406532730637. "5.4"
6406532730638. 5.4
Sem1 Maths1
Section Id : 64065356653
Section Number : 3
Section Marks : 50

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL : SEMESTER I: MATHEMATICS
FOR DATA SCIENCE I (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532730639. YES
6406532730640. NO

Time : 0
Correct Marks : 0
Options :
6406532730641. Instructions has been mentioned above.
6406532730642. This Instructions is just for a reference & not for an evaluation.

Time : 0
Correct Marks : 4
The DFS (Depth First Search) tree of a graph starting with vertex A is shown below. Choose the
option which might be the original graph.
Options :
6406532730658.
6406532730659.
6406532730660.
6406532730661.


Time : 0
Which of the following are valid topological orderings of the given DAG ?
Options :
6406532730654. E, F, C, B, A, G, H, D
6406532730655. E, F, B, C, G, A, H, D
6406532730656. E, F, C, B, G, A, H, D
6406532730657. E, F, C, B, G, H, D, A

Time : 0

Options :
6406532730662. R2,R3, and R4 are functions.
6406532730663. R2 and R4 are functions.
6406532730664. R2 is an injective function.
6406532730665. R4 is a bijective function.

Time : 0
Options :
6406532730682.
6406532730683.
6406532730684.
6406532730685.

Correct Marks : 3
What is the minimum number of colours required to colour the graph given below?
Possible Answers :

Correct Marks : 3

Possible Answers :

A person is climbing stairs and he stops at a point P on the stairs after reaching two third of the
total distance of stairs. The stairs forms an isosceles triangle with the floor and wall. Assume the
origin (0, 0) at the intersection of the wall and floor and the stairsis to the right of the wall.
Sub questions

Correct Marks : 2
Find the angle between the stairs and the wall (in degrees).
Possible Answers :
45

Correct Marks : 1
Possible Answers :


Sub questions

Correct Marks : 2
Possible Answers :
11

Correct Marks : 1
Note:Enter your answer correctly to two decimal places.
Answers Type : Range
Possible Answers :
0.12 to 0.13

Consider an undirected graph G with 12 vertices, where the degree of each vertex is at least 2 and
at most 5.
Sub questions

Correct Marks : 2
Determine the minimum number of edges the graph G can have.
Possible Answers :
12
Correct Marks : 2
Determine the maximum number of edges the graph G can have.
Possible Answers :
30

Sub questions

Time : 0
Correct Marks : 1
Options :
6406532730668. TRUE
6406532730669. FALSE

Time : 0
Correct Marks : 1
Options :
6406532730670. TRUE
6406532730671. FALSE

Time : 0
Correct Marks : 1
Options :
6406532730672. TRUE
6406532730673. FALSE

Time : 0
Correct Marks : 1
Options :
6406532730674. TRUE
6406532730675. FALSE

Answer the given sub-questions.
Sub questions

Correct Marks : 1

Possible Answers :

Time : 0
Correct Marks : 1
Options :
6406532730677. TRUE
6406532730678. FALSE

Time : 0
Correct Marks : 1
Options :
6406532730679. TRUE
6406532730680. FALSE

Correct Marks : 1
Possible Answers :

Sub questions

Correct Marks : 2

Possible Answers :

Correct Marks : 2
Possible Answers :
14


Sub questions

Time : 0
Which of the following is true about the graph G?
Options :
6406532730645. The vertices A,B,D and E are reachable from vertex C.
6406532730646. The longest path in the graph G starts with vertex C and ends with vertex E.
6406532730647. The graph G is a directed acyclic graph.
6406532730648. The longest path in the graph G has length 3, in terms of number of edges.

Time : 0
Which of the following graph(s) is represented by the given adjacency matrix?
Options :
6406532730649.
6406532730650.
6406532730651.
6406532730652.
Sem2 Maths2
Section Id : 64065356654
Section Number : 4
Section Marks : 50

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL: SEMESTER II:
MATHEMATICS FOR DATA SCIENCE II (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532730691. YES
6406532730692. NO

Time : 0
Correct Marks : 2
Options :
6406532730702.
6406532730703.
6406532730704.
6406532730705.

Time : 0
Options :
6406532730745. f is increasing at the point (1, 4), if y is fixed and x is varied.
6406532730746. f is decreasing at the point (1, 4), if y is fixed and x is varied.
6406532730747. f is decreasing at the point (1, 4), if x is fixed and y is varied.
6406532730748. None of these

Time : 0
Let A and B be two square matrices of the same order. Select all true statements.
Options :
6406532730693. The ith column of AB is a linear combination of the columns of A.
6406532730694. The ith row of AB is a linear combination of the rows of B.
6406532730695. The ith column of AB is a linear combination of the columns of B.
6406532730696. The ith row of AB is a linear combination of the rows of A.

Time : 0
Options :
6406532730706.
6406532730707.
6406532730708.
6406532730709.
6406532730710.

Time : 0

Choose the correct option(s) from the following:
Options :
6406532730735.
6406532730736.
6406532730737.
6406532730738.

Time : 0
Choose the option(s) for which the limit exists.
Options :
6406532730741.
6406532730742.
6406532730743.
6406532730744.

Sub questions

Time : 0
Correct Marks : 1
Options :
6406532730697.
6406532730698.
6406532730699.
6406532730700.

Correct Marks : 1
Possible Answers :

Let A be a 3 × 5 matrix.
Sub questions

Time : 0
Correct Marks : 1
Options :
6406532730711. Exactly one solution
6406532730712. Infinitely many solutions
6406532730713. No solution
6406532730714. Insufficient data. This depends on the entries of A.

Time : 0
Correct Marks : 1
Options :
6406532730715. Exactly one solution
6406532730716. Infinitely many solutions
6406532730717. No solution
6406532730718. Insufficient data. This depends on the entries of A.

Time : 0
Correct Marks : 1
Options :
6406532730719. T could be onto, but it can never be one-one
6406532730720. T could be one-one, but it can never be onto
6406532730721. T could be both one-one and onto

Find the dimension of the given vector spaces in the subquestions.
Sub questions

Correct Marks : 1

Possible Answers :

Correct Marks : 1
Possible Answers :

Correct Marks : 1
Possible Answers :

Sub questions

Time : 0
Correct Marks : 1
Which of the following is the matrix representation of T with respect to the basis {(1, 1), (−1, 1)} for
the domain and the standard ordered basis for the co-domain?
Options :
6406532730725.
6406532730726.
6406532730727.
6406532730728.

Time : 0
Which of the following are valid matrix representations of T with suitable bases for the domain
and co-domain? Note that the bases could be different for the domain and co-domain.
Options :
6406532730729.
6406532730730.
6406532730731.
6406532730732.

Sub questions

Correct Marks : 2
find a.

Possible Answers :

Correct Marks : 2
find b.
Possible Answers :
-3

Answer the given subquestions:
Sub questions

Correct Marks : 2

Possible Answers :

Correct Marks : 2
Possible Answers :
53
Sub questions

Correct Marks : 1
How many critical points are there for f?
Possible Answers :

Correct Marks : 1
How many saddle points are there for f?

Possible Answers :

Time : 0
Options :
6406532730751. f has a local minimum at the point (1,2).
6406532730752. f has a local maximum at the point (1,2).
6406532730753. f has a local maximum at the point (1, 0).
6406532730754. f has a local maximum at the point (-1, 0).

Answer the given subquestions about the functions

Sub questions

Correct Marks : 2
Possible Answers :

Correct Marks : 2

Possible Answers :

Time : 0
Options :
6406532730757.
6406532730758.
6406532730759.
6406532730760.
Sem2 Statistics2
Section Id : 64065356655
Section Number : 5
Section Marks : 40

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL : SEMESTER II: STATISTICS
FOR DATA SCIENCE II (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532730761. YES
6406532730762. NO

Time : 0
Correct Marks : 0

Options :


Time : 0
Correct Marks : 3
Options :
6406532730765.
6406532730766.
6406532730767.
6406532730768.

Time : 0
Correct Marks : 3

Options :
6406532730770.
6406532730771.
6406532730772.
6406532730773.

Time : 0
Correct Marks : 3
Options :
6406532730778.
6406532730779.
6406532730780.
6406532730781.

Time : 0
Options :
6406532730774.
6406532730775.
6406532730776.
6406532730777.

Correct Marks : 3
Possible Answers :
0.06 to 0.10


Sub questions

Correct Marks : 2
Possible Answers :
0.49 to 0.55

Time : 0
Correct Marks : 3

Options :
6406532730783.
6406532730784.
6406532730785.
6406532730786.

Sub questions

Time : 0
Correct Marks : 3
Options :
6406532730787. Binomial(10, 0.5)
6406532730788. Beta(5, 7)
6406532730789. Beta(6, 8)
6406532730790. Beta(4, 6)

Correct Marks : 2
Find the posterior mean using the correct prior from the previous subquestions. Enter the answer
correct to two decimal places.
Possible Answers :
0.40 to 0.46


Sub questions

Correct Marks : 3
Find the P−value. Enter the answer correct to two decimal places.
Possible Answers :
0.01 to 0.07

Correct Marks : 2

Possible Answers :
0.81 to 0.87

Sub questions

Time : 0
Correct Marks : 3
Options :
6406532730794.
6406532730795.
6406532730796.
6406532730797.

Correct Marks : 2
What is the probability that waiting time for a patient will be at most 30 minutes?
Enter the answer correct to two decimal places.
Possible Answers :
0.83 to 0.89


Sub questions

Correct Marks : 2
Possible Answers :
0.297 to 0.302

Correct Marks : 2
Possible Answers :
0.263 to 0.272

Time : 0
Correct Marks : 1
Options :
6406532730801. 0.241
6406532730802. 0.072
6406532730803. 0.388
6406532730804. 0
DBMS
Section Id : 64065356656
Section Number : 6

Section Marks : 50

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : DATA BASE MANAGEMENT
SYSTEM (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532730805. YES
6406532730806. NO

Time : 0
Correct Marks : 2
Options :
6406532730811. 1
6406532730812. 2
6406532730813. 3
6406532730814. 4

Time : 0
Correct Marks : 2

Options :
6406532730819. 166 milliseconds
6406532730820. 12.8 milliseconds
6406532730821. 128 milliseconds
6406532730822. 16.6 milliseconds

Time : 0
Correct Marks : 3

Options :
6406532730815.
6406532730816.
6406532730817.
6406532730818.


Time : 0
Correct Marks : 4
Options :
6406532730807.
6406532730808.
6406532730809.
6406532730810.

Time : 0
Choose the correct statement(s):
Options :
6406532730827. Time complexity of searching in a BST is O(nlogn)

6406532730828. In a B+ tree the leaf nodes are linked using a link list
6406532730829. Sparse indices are generally faster than dense indices for locating records.
6406532730830. B tree does not allow duplicate search-key values

Time : 0
Choose the correct statement(s):
Options :
6406532730831. In Raid 0 architecture, the space utilization is always 100 percent.
6406532730832. In Raid 1 architecture, the data is striped over different disks.
6406532730833. In Raid 4 architecture, the striping unit consists of a disk block
6406532730834. In Raid 5 architecture, the parity blocks are uniformly distributed over all the
disks

Time : 0

Options :
6406532730835.
6406532730836.
6406532730837.
6406532730838.

Time : 0

Options :
6406532730851.
6406532730852.
6406532730853.
6406532730854.

Time : 0

Options :
6406532730823. One team cannot have more than one coach
6406532730824. There might exist a coach who is not training any player
6406532730825. A coach can be coaching more than one team
6406532730826. A player can have only one coach

Time : 0

Options :
6406532730839.
6406532730840.
6406532730841.
6406532730842.

Time : 0

Options :
6406532730843.
6406532730844.
6406532730845.
6406532730846.

Time : 0

Options :
6406532730847.
6406532730848.
6406532730849.
6406532730850.

Time : 0
Options :
6406532730855.
6406532730856.
6406532730857.
6406532730858.

Correct Marks : 1
Possible Answers :

Correct Marks : 2
Possible Answers :

Correct Marks : 3

Possible Answers :

Correct Marks : 3

Possible Answers :

Correct Marks : 4

Possible Answers :
21

Sub questions

Correct Marks : 3
Possible Answers :
7

Time : 0
Choose the correct expression(s) for the statement given below:
Name all the teams from England, with atmost 5 wins and at least 3 draws.
Options :
6406532730865.
6406532730866.
6406532730867.
6406532730868.
PDSA
Section Id : 64065356657
Section Number : 7
Section Marks : 100

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : PROGRAMMING, DATA
STRUCTURES AND ALGORITHMS USING PYTHON (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532730869. YES
6406532730870. NO

Time : 0
Correct Marks : 4
Options :
6406532730871.
6406532730872.
6406532730873.
6406532730874.

Time : 0
Correct Marks : 4
Options :
6406532730875.
6406532730876.
6406532730877.
6406532730878.

Time : 0
Correct Marks : 4

Options :
6406532730879.
6406532730880.
6406532730881.
6406532730882.

Time : 0
Correct Marks : 4

Options :
6406532730888. 20, 10, 20, 10, 20
6406532730889. 20, 20, 10, 10, 20
6406532730890. 10, 20, 20, 10, 20
6406532730891. 10, 20, 10, 20, 20

Time : 0
Correct Marks : 4
Options :
6406532730892. 2
6406532730893. 3
6406532730894. 4
6406532730895. 5

Time : 0
Correct Marks : 4
You are given a computer network represented as an adjacency list. Each node in the network
represents a computer, and an edge between two nodes indicates a network connection. A virus
has infected one of the computers. The virus spreads from an infected computer to each of its
neighbors in one time step. Your task is to find the minimum number of time steps required for
the virus to infect all computers in the network.
Which of the following algorithm is best suited and efficient for solving this problem?
Options :
6406532730896. Breadth-first search.
6406532730897. Depth-first search.
6406532730898. Dijkstra's Algorithm
6406532730899. Bellman-Ford algorithm

Time : 0
Correct Marks : 4

Options :
6406532730908. 5
6406532730909. 6
6406532730910. 7
6406532730911. 8

Time : 0
Correct Marks : 4

Options :
6406532730913.
6406532730914.
6406532730915.
6406532730916.

Time : 0
Correct Marks : 4
Consider the elements 71, 45, 56, 98, 33, 48 and 96 inserted into empty binary search tree in the
same sequence. Which element will be inserted in the lowest level?
Options :
6406532730918. 56
6406532730919. 33
6406532730920. 96
6406532730921. 48

Time : 0
Correct Marks : 4
Options :
6406532730922.
6406532730923.
6406532730924.
6406532730925.

Time : 0
Correct Marks : 4

Options :
6406532730926. 4
6406532730927. 5
6406532730928. 3
6406532730929. 7

Time : 0
Options :
6406532730883.
6406532730884.
6406532730885.
6406532730886.
6406532730887.

Time : 0
Options :
6406532730900.
6406532730901.
6406532730902.
6406532730903.
Time : 0
Options :
6406532730904.
6406532730905.
6406532730906.
6406532730907.

Correct Marks : 4
Possible Answers :

Correct Marks : 4
Consider a complete binary tree T with 17 nodes. The number of leaf nodes in T is ____.
Possible Answers :
9

Correct Marks : 4
Possible Answers :
12

Correct Marks : 4

Possible Answers :

Correct Marks : 4
Possible Answers :

Correct Marks : 4
Possible Answers :

Correct Marks : 4
Let G be a simple graph with 20 vertices. The size of the minimum vertex cover of G is 8. What is
the size of the maximum independent set of graph G?
Possible Answers :
12

Sub questions

Time : 0
Correct Marks : 4

Options :
6406532730933.
6406532730934.
6406532730935.
6406532730936.

Time : 0
Correct Marks : 4
Options :
6406532730937.
6406532730938.
6406532730939.
6406532730940.
Sub questions

Time : 0
Correct Marks : 4
The value of the maximum flow in the given network is__
Options :
6406532730943. 21
6406532730944. 24
6406532730945. 23
6406532730946. 26

Time : 0
Correct Marks : 4
Options :
6406532730947. (a, b)
6406532730948. (d, b)
6406532730949. (b, t)
6406532730950. (d, t)
AppDev1
Section Id : 64065356658
Section Number : 8
Section Marks : 100


Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : MODERN APPLICATION
DEVELOPMENT I (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532730951. YES
6406532730952. NO

Time : 0
Correct Marks : 3
Options :
6406532730953.
6406532730954.
6406532730955.
6406532730956.

Time : 0
Correct Marks : 2
Options :
6406532730957.
6406532730958.
6406532730959.
6406532730960.

Time : 0
Correct Marks : 2
Options :
6406532730965.
6406532730966.
6406532730967.
6406532730968.

Time : 0
Correct Marks : 2
Which of the following is true about the term “stateless” in the client-server model?
Options :
6406532730973. The server responds to the client based on the previous state.
6406532730974. The server uses FTP protocol to respond to the client's request.
6406532730975. Server use the URL to convey information to the client.
6406532730976. Server is not required to maintain any state of client or session during
transactions between client and server.

Time : 0
Correct Marks : 2

Options :
6406532731013. GET
6406532731014. POST
6406532731015. PUT
6406532731016. DELETE

Time : 0
Correct Marks : 2
Which of the below JavaScript statement(s) are used to print information on the browser’s console?
Options :
6406532731061. window.alert()
6406532731062. console.log()
6406532731063. document.write()
6406532731064. None of these

Time : 0
Correct Marks : 2
Which command of the below command creates a new branch in GIT?
Options :
6406532731073.
6406532731074.
6406532731075.
6406532731076.

Time : 0
Correct Marks : 2
Consider the following statements and select the correct option:

Statement 1: In a database, an index can only be created on one column of a table.
Statement 2: Indexes cannot be created on columns which have duplicate values.
Options :
6406532731077. Statement 1 is true & statement 2 is false
6406532731078. Statement 2 is true & statement 1 is false
6406532731079. Both statements 1 and 2 are true
6406532731080. Both statements 1 and 2 are false

Time : 0
Correct Marks : 3

Options :
6406532730969.
6406532730970.
6406532730971.
6406532730972.

Time : 0
Correct Marks : 3
Options :
6406532730977.
6406532730978.
6406532730979.
6406532730980.

Time : 0
Correct Marks : 3
Options :
6406532730993.
6406532730994.
6406532730995.
6406532730996.

Time : 0
Correct Marks : 3
Options :
6406532730997. 4
6406532730998.
22
6406532730999. ValueError
6406532731000. 2

Time : 0
Correct Marks : 3
Options :
6406532731009.
6406532731010.
6406532731011.
6406532731012.

Time : 0
Correct Marks : 3
You have a DRAM module with bus width of 64 bits, clock speed of 2 GHz, and operating in DDR
(double-data-rate or two values per clock cycle) mode. What is the maximum bandwidth (in Giga-
bytes per second) of data transfer achievable with this module?
Options :
6406532731017. 16
6406532731018. 8
6406532731019. 32
6406532731020. 128

Time : 0
Correct Marks : 3

Options :
6406532731025.
6406532731026.
6406532731027.
6406532731028.

Time : 0
Correct Marks : 3
Options :
6406532731045. The special series is: 1 0 1 0 1 0 1 0 1 0 1 0 1 0

6406532731046. The special series is: 1 2 0 1 2 0 1 2 0 1 2 0 1 2
6406532731047. The special series is: 1.0 0.0 1.0 0.0 1.0 0.0 1.0 0.0 1.0 0.0 1.0 0.0 1.0 0.0
6406532731048. The special series is: 0.33 0.67 1.0 1.33 1.67 2.0 2.33 2.67 3.0 3.33 3.67 4.0 4.33
4.67

Time : 0
Correct Marks : 3
Options :
6406532731049.
6406532731050.
6406532731051.
6406532731052.

Time : 0
Correct Marks : 3
Options :
6406532731069. One Book to one Author relationship
6406532731070. One Author to many Books relationship

6406532731071. Many Authors to one Book relationship
6406532731072. Many Books to many Author relationship

Time : 0
Correct Marks : 4.5
Options :
6406532731001.
6406532731002.
6406532731003.
6406532731004.

Time : 0
Correct Marks : 4.5

Options :
6406532731005.
6406532731006.
6406532731007.
6406532731008.

Time : 0
Correct Marks : 4.5
Consider the following graph that represents the variation in bandwidth of a network for an entire
day (24 hours). Three users were connected to the network at three different times of the day.
What is the total data consumed in GigaBytes by all the users in 24 hrs?
Options :
6406532731033. 547.2 GB
6406532731034. 12 GB
6406532731035. 43.2 GB
6406532731036. 345.6 GB

Time : 0
Correct Marks : 4.5

Options :
6406532731037.
6406532731038.
6406532731039.
6406532731040.

Time : 0
Correct Marks : 4.5

Options :
6406532731041.
6406532731042.
6406532731043.
6406532731044.

Time : 0
Correct Marks : 4.5

Options :
6406532731057. Statements i and iii are correct
6406532731058. Statements ii and iv are correct
6406532731059. Only statement i is correct
6406532731060. Only statement ii is correct


Time : 0
Options :
6406532730981. An employee can exist without having any salary slips
6406532730982. An employee can have more than one salary slip
6406532730983. An employee needs to have at least one salary slip
6406532730984. A salary slip must belong to one and only one employee

Time : 0
Options :
6406532731021.
6406532731022.
6406532731023.
6406532731024.

Time : 0

Which of the below is/are true about the Web Server?
Options :
6406532731053. Always web server response in HTML format
6406532731054. Web servers process the business logic and return different types of responses
6406532731055. Web servers can host multiple web applications
6406532731056. The web server sends the requested web page using HTTP

Time : 0
Consider a client ‘C’ and a server ‘S’, separated by distance ‘D’ are connected by a fictitious medium
in which the speed of light is ‘v’ m/sec. If ‘N’ is the number of consecutive requests that can made
in a second by the client ‘C’ (i.e A new request can be made only after receiving the response from
the previous request.), Which of the following changes would halve the number ‘N’?
Options :
6406532731065. A change of medium where the speed of light is 2v m/sec.
6406532731066. Reduce the distance between C and S from D to D/2.
6406532731067. A change of medium where the speed of light is v/2 m/sec.
6406532731068. Increase the distance between C and S from D to 2D.

Time : 0
Correct Marks : 4.5 Max. Selectable Options : 0
Options :
6406532730961.
6406532730962.
6406532730963.
6406532730964.

Time : 0
Correct Marks : 4.5 Max. Selectable Options : 0

Options :
6406532731029.
6406532731030.
6406532731031.
6406532731032.


Sub questions

Time : 0
Correct Marks : 3
Options :
6406532730985.
6406532730986.
6406532730987.
6406532730988.

Time : 0
Correct Marks : 3
Options :
6406532730989.
6406532730990.
6406532730991.
6406532730992.
MLF
Section Id : 64065356659
Section Number : 9
Section Marks : 40

Yes
Clear Response :


Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : MACHINE LEARNING
FOUNDATIONS (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532731081. YES
6406532731082. NO


A person went to the market to buy hens. Old hens can be bought for ₹ 200.00 each but young
hens can be bought for ₹ 500.00 each. The old hens lay 3 eggs per week and the young hens lay 5
eggs per week. Each egg costs Rs. 11. A hen costs ₹ 50.00 per week to feed. If the financial
constraint is ₹ 8000 per week to buy hens and the capacity constraint is that the total number of
hens bought cannot exceed 20 per week. The objective is to earn more profit. Let x represent the
number of old hens and y represent the number of young hens.
Use the above information to answer the given subquestions
Sub questions

Time : 0
Correct Marks : 2
Choose the correct Primal optimization problem from the following.
Options :
6406532731083.
6406532731084.
6406532731085.
6406532731086.

Time : 0
If (x*, y*) is the optimal solution of the primal, u1 and u2 are Lagrange multipliers then which of
the following options is/are true?
Options :
6406532731087.
6406532731088.
6406532731089.
6406532731090.
6406532731091.

Time : 0
Which of the following options is/are true?

Options :
6406532731092. The Given LPP is infeasible.
6406532731093. The Given LPP is feasible.
6406532731094. The optimum value is x = 0 and y = 16
6406532731095. The optimum value is x = 20 and y = 0

Correct Marks : 3
Possible Answers :

Time : 0
Options :
6406532731097.
6406532731098.
6406532731099.
6406532731100.

Time : 0
Options :
6406532731101.
6406532731102.
6406532731103.
6406532731104.

Sub questions

Correct Marks : 3
Find the number of discontinuous points.

Possible Answers :

Correct Marks : 3
Find the number of points where the function is not differentiable.
Possible Answers :

Time : 0
Let A be a real symmetric positive definite matrix. Which of the following options is/are true?
Options :
6406532731107. The eigenvectors of A may or may not be orthogonal.

6406532731108. If A is similar to a diagonal matrix B, then B is also positive definite.
6406532731109. AT A is not positive definite.
6406532731110. AT A is not similar to a diagonal matrix.

Time : 0
Options :
6406532731111.
6406532731112.
6406532731113.
6406532731114.

Time : 0
Correct Marks : 3
Options :
6406532731115.
6406532731116.
6406532731117.
6406532731118.

Correct Marks : 3
Possible Answers :

Correct Marks : 3
In a large town, it is estimated that 20% of students own a laptop. A random sample of 400
students is selected from the town. What is the variance of the number of students with the
laptops in a given sample?
Possible Answers :
64

Correct Marks : 3
A quality control manager at a factory measures the thickness of glass sheets produced. Five
randomly selected sheets have the thicknesses(in mm) 10, 8, 11, 9, 12 respectively. Assuming the
thickness follows a normal distribution and the variance is known, what is the maximum likelihood
estimator (MLE) of the mean thickness, (μ), in mm of the glass sheets?
Possible Answers :
10
Java
Section Id : 64065356660
Section Number : 10
Section Marks : 100

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : PROGRAMMING CONCEPTS
USING JAVA (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532731122. YES
6406532731123. NO

Time : 0
Correct Marks : 4
Options :
6406532731124.
6406532731125.
6406532731126.
6406532731127.
Time : 0
Correct Marks : 4
Options :
6406532731128.
6406532731129.
6406532731130.
6406532731131.

Time : 0
Correct Marks : 4

Options :
6406532731132.
6406532731133.
6406532731134.
6406532731135.

Time : 0
Correct Marks : 4

Options :
6406532731136.
6406532731137.
6406532731138.
6406532731139.

Time : 0
Correct Marks : 4

Options :
6406532731140.
6406532731141.
6406532731142.
6406532731143.

Time : 0
Correct Marks : 4

Options :
6406532731144.
6406532731145.
6406532731146.
6406532731147.

Time : 0
Correct Marks : 4

Options :
6406532731148.
6406532731149.
6406532731150.
6406532731151.

Time : 0
Correct Marks : 4

Options :
6406532731152.
6406532731153.
6406532731154.
6406532731155.

Time : 0
Correct Marks : 4

Options :
6406532731160.
6406532731161.
6406532731162.
6406532731163.

Time : 0
Correct Marks : 4
Options :
6406532731164.
6406532731165.
6406532731166.
6406532731167.

Time : 0
Correct Marks : 4

Options :
6406532731168.
6406532731169.
6406532731170.
6406532731171.
Time : 0
Correct Marks : 4
Options :
6406532731172.
6406532731173.
6406532731174.
6406532731175.

Time : 0
Correct Marks : 4
Options :
6406532731176.
6406532731177.
6406532731178.
6406532731179.

Time : 0
Correct Marks : 4

Options :
6406532731180.
6406532731181.
6406532731182.
6406532731183.
Time : 0
Correct Marks : 4
Options :
6406532731184.
6406532731185.
6406532731186.
6406532731187.
6406532731188.

Time : 0
Correct Marks : 4

Options :
6406532731189.
6406532731190.
6406532731191.
6406532731192.

Time : 0
Correct Marks : 4
Options :
6406532731193.
6406532731194.
6406532731195.
6406532731196.

Time : 0

Options :
6406532731156.
6406532731157.
6406532731158.
6406532731159.
Time : 0
Options :
6406532731197.
6406532731198.
6406532731199.
6406532731200.

Time : 0

Options :
6406532731201.
6406532731202.
6406532731203.
6406532731204.

Time : 0

Options :
6406532731213.
6406532731214.
6406532731215.
6406532731216.

Time : 0
Correct Marks : 5

Options :
6406532731205.
6406532731206.
6406532731207.
6406532731208.

Time : 0
Correct Marks : 5

Options :
6406532731209.
6406532731210.
6406532731211.
6406532731212.
MLT
Section Id : 64065356661
Section Number : 11
Section Marks : 50

Yes
Clear Response :

Time : 0
Correct Marks : 0
TECHNIQUES (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532731217. YES
6406532731218. NO

Correct Marks : 3
Possible Answers :

Correct Marks : 3

Possible Answers :
0.80

Correct Marks : 3
Possible Answers :
0.25
Correct Marks : 3
Possible Answers :

Correct Marks : 3

Possible Answers :
25

Correct Marks : 3
Possible Answers :
0.70 to 0.80

Time : 0
Correct Marks : 3
Consider a dataset with two features (Feature 1 and Feature 2) exhibiting a perfect positive
correlation (1). If you apply k-means clustering with k = 3, what is the most likely arrangement of
cluster centers that minimizes the within-cluster sum of squares (WCSS)?
Options :
6406532731224. An equilateral triangle centered around the mean of the data.
6406532731225. Cluster centers positioned along a straight line.
6406532731226. A triangle with two acute angles, positioned strategically within the data
distribution.
6406532731227. A right-angled triangle with one center at the origin.

Time : 0
Correct Marks : 3

Options :
6406532731233. Model 1
6406532731234. Model 2
6406532731235. Both models are equally sensitive to outliers
6406532731236. Insufficient data

Time : 0
Correct Marks : 3
Options :
6406532731239. 1
6406532731240. 2
6406532731241. 4
6406532731242. It oscillates and never converges

Time : 0
Correct Marks : 3
Options :
6406532731259.
6406532731260.
6406532731261.
6406532731262.

Time : 0
Which of the following are true about the kernel function? Assume that the dataset X is mean
centered.
Options :
6406532731220.
6406532731221.
6406532731222.
6406532731223.

Time : 0
Options :
6406532731229.
6406532731230.
6406532731231.
6406532731232.

Time : 0
Options :
6406532731255.
6406532731256.
6406532731257.
6406532731258.

Time : 0
Options :
6406532731263.
6406532731264.
6406532731265.
6406532731266.

Time : 0
Options :
6406532731244.
6406532731245.
6406532731246.
6406532731247.
6406532731248.
6406532731249.

Time : 0
Options :
6406532731250. Points {F, I} are the only support vectors.
6406532731251. Points {A, N} are a subset of support vectors.
6406532731252. Points {F, A, C, I} are the only support vectors.
6406532731253. Points except {F, A, C, I, N} do not play any role in determining optimal weight
vector.
6406532731254. Points except {F, A, C, I} do not play any role in determining optimal weight
vector.
MLP
Section Id : 64065356662
Section Number : 12
Section Marks : 100

Yes
Clear Response :

Time : 0
Correct Marks : 0
PRACTICES (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532731268. YES
6406532731269. NO

Time : 0
Correct Marks : 0
Instruction:
Note: For numerical answer type questions enter your answer correct upto 2 decimal places without
rounding off, unless stated otherwise.
Options :
6406532731270. Instruction has been mentioned above.
6406532731271. This Instruction is just for a reference & not for an evaluation.

Time : 0
Correct Marks : 2
Select multilabel multiclass classification problems:
Options :
6406532731285. There is a collection of photographs. Each photograph can have multiple

animals, e.g., cats, dogs and birds. Your model should indicate all the animals which are present.
6406532731286. From appropriate weather data, your model must predict, average
temperature and average humidity for next seven days.
6406532731287. Predicting expected price of a second hand car with appropriate features.
6406532731288. None of these.

Time : 0
Correct Marks : 2
Options :
6406532731307.
6406532731308.
6406532731309.
6406532731310.
Time : 0
Correct Marks : 2
Which of the following can be used (with appropriate supporting code) to compute training error
after each iteration?
Options :
6406532731311.
6406532731312.
6406532731313.
6406532731314.
6406532731315.
Time : 0
Correct Marks : 2
Options :
6406532731316. 1106
6406532731317. 82
6406532731318. 1024
6406532731319. 5
6406532731320. None of these

Time : 0
Correct Marks : 2
What is the purpose of k-fold cross-validation ?

Options :
6406532731321. To split data into training and testing sets.
6406532731322. To tune hyperparameters.
6406532731323. To evaluate model performance on multiple subsets.
6406532731324. To preprocess data.

Time : 0
Correct Marks : 2
Options :
6406532731325. Statement 1 is True and Statement 2 is False
6406532731326. Statement 2 is True and Statement 1 is False
6406532731327. Both the statements are True
6406532731328. Both the statements are False

Time : 0
Correct Marks : 2
Which assumption does Naive Bayes make about the features?
Options :
6406532731332. They are independent of each other.
6406532731333. They are always a numerical representation of the text data.
6406532731334. They are linearly related.
6406532731335. They are categorical.
6406532731336. None of these.

Time : 0
Correct Marks : 3

Options :
6406532731295.
6406532731296.
6406532731297.
6406532731298.
6406532731299.

Time : 0
Correct Marks : 3
You’re working on a dataset containing customer purchase data, and you want to segment the
customers into distinct groups based on their purchasing behavior. Each data point represents a
customer and includes features like “Total Amount Spent” and “Number of Items Purchased.”
Which algorithm is suitable for this scenario?
Options :
6406532731376. Linear Regression
6406532731377. Decision Tree
6406532731378. K-means Clustering
6406532731379. Support Vector Machine
6406532731380. None of these

Time : 0
Correct Marks : 3
Options :
6406532731381. Increasing the number of neurons in hidden layers will always lead to better
model performance.
6406532731382. Decreasing the number of neurons in hidden layers reduces the model’s
capacity to capture complex patterns.
6406532731383. The number of neurons in hidden layers does not significantly affect the
model’s performance.
6406532731384. Finding the optimal number of neurons is a trial-and-error process and may
require experimentation.

Time : 0
Correct Marks : 3
How does agglomerative clustering handle outliers?
Options :
6406532731389. It ignores outliers during the clustering process.
6406532731390. It assigns outliers to the nearest cluster.
6406532731391. It creates separate clusters for outliers.
6406532731392. It removes outliers from the dataset before clustering.

Time : 0
Correct Marks : 3
What is agglomerative clustering?
Options :
6406532731393. A hierarchical clustering technique that starts with each data point as its
cluster and merges the closest clusters iteratively.
6406532731394. A method for partitioning data into a predefined number of clusters.
6406532731395. A clustering algorithm that uses centroids to iteratively assign data points to
clusters.
6406532731396. A dimensionality reduction technique that projects data onto a lower-
dimensional space.

Time : 0
Correct Marks : 3
What initialization method is best in KMeans to select initial cluster centroids?
Options :
6406532731397. Random initialization
6406532731398. K-means++ initialization
6406532731399. Hierarchical agglomerative initialization
6406532731400. Weighted initialization

Time : 0
Correct Marks : 3
Options :
6406532731401. The distance between cluster centroids
6406532731402. The number of clusters formed
6406532731403. Sum of squared distances of samples to their closest cluster center.
6406532731404. The silhouette coefficient

Time : 0
Correct Marks : 4
Options :
6406532731355.
6406532731356.
6406532731357.
6406532731358.

Time : 0
Correct Marks : 4
Options :
6406532731363.
6406532731364.
6406532731365.
6406532731366.

Time : 0
Correct Marks : 4

Options :
6406532731367.
6406532731368.
6406532731369.
6406532731370.
6406532731371.

Time : 0
Correct Marks : 4

Options :
6406532731372.
6406532731373.
6406532731374.
6406532731375.

Time : 0
What is the solution for overfitting?
Options :
6406532731289. To have less constraints/regularization
6406532731290. To have more constraints/regularization
6406532731291. Delete a significant portion of data
6406532731292. Increase the dataset size.
6406532731293.
None of these.

Time : 0
Select all the correct options:
Options :
6406532731302. The more the SGD iterations, the lesser the fluctuations in training error.
6406532731303. More iterations require more computation time.
6406532731304. The tol (error tolerance) parameter restricts the number of iterations
performed.
6406532731305. Training error might not consistently decrease while performing SGD
iterations.
6406532731306. None of these

Time : 0
Options :
6406532731339.
6406532731340.
6406532731341.
6406532731342.

Time : 0
Which of the following statements are true?
Options :
6406532731343.
6406532731344.
6406532731345.
6406532731346.

Time : 0
Which of the following options are correct regarding regularization?
Options :
6406532731347. It is a technique used to minimize the adjusted loss function and avoid
underfitting.
6406532731348. It helps in increasing the bias of the training model.
6406532731349. It determines the rows to be selected as a training dataset.
6406532731350. Elastic net regularization is a combination of L1 and L2 regularization both.

Time : 0
Which of the following techniques are used in decision trees to make decisions or to measure the
quality of a split while training the model?
Options :
6406532731359. Entropy
6406532731360. RoC Curve
6406532731361. Cross Entropy
6406532731362. Gini Impurity

Time : 0
Which of the following approaches is(are) helpful to find a good value for k in k−means clustering
algorithm?
Options :
6406532731385. Plotting an Elbow curve.
6406532731386. Using classifiers before making clusters.
6406532731387. Plotting Silhouette coefficient for various values of k.
6406532731388. Using k-fold cross validation

Time : 0

Options :
6406532731351. 10 number of samples at node N. If it is split, it can split such that 2 samples in
the left child and 8 samples in the right child.

Correct Marks : 2

Possible Answers :
0.5

Correct Marks : 2
Possible Answers :
0.8
Correct Marks : 2
Possible Answers :
0.37 to 0.38

Correct Marks : 2

Possible Answers :
0.32 to 0.35

Correct Marks : 2
Possible Answers :

Correct Marks : 3

Possible Answers :
36

Correct Marks : 3

Possible Answers :
1.00

Correct Marks : 3

Possible Answers :

Sub questions

Time : 0

Options :
6406532731272.
6406532731273.
6406532731274.
6406532731275.
6406532731276.

Correct Marks : 2

Possible Answers :
120

Correct Marks : 2
Possible Answers :

Correct Marks : 2

Possible Answers :
-1

Time : 0
Correct Marks : 2
Options :
6406532731280. The number of rows will decrease in the dataset.
6406532731281. The number of columns will decrease in the dataset.
6406532731282. The number of columns and number of rows, both, will decrease in the
dataset.
6406532731283. There will be no change.
6406532731284. Insufficient information.
System Commands
Section Id : 64065356663
Section Number : 13
Section Marks : 100

Yes
Clear Response :

Time : 0
Correct Marks : 0

THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : SYSTEM COMMANDS
(COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532731405. YES
6406532731406. NO

Time : 0
Correct Marks : 6

Options :
6406532731407.
6406532731408.
6406532731409.
6406532731410.

Time : 0
Correct Marks : 6

Options :
6406532731411.
6406532731412.
6406532731413.
6406532731414.

Time : 0
Correct Marks : 6
Options :
6406532731417. Prints the count of even numbers between 10 and 20.
6406532731418. Prints the count of odd numbers between 10 and 20.
6406532731419. Prints the sum of even numbers between 10 and 20.
6406532731420. Prints the sum of odd numbers between 10 and 20.

Time : 0
Correct Marks : 6
Options :
6406532731421.
6406532731422.
6406532731423.
6406532731424.

Time : 0
Correct Marks : 6
Options :
6406532731425.
6406532731426.
6406532731427.
6406532731428.

Time : 0
Correct Marks : 6
What environment variable stores the path to the user’s home directory?
Options :
6406532731429.
6406532731430.
6406532731431.
6406532731432.

Time : 0
Correct Marks : 6
Options :
6406532731433.
6406532731434.
6406532731435.
6406532731436.

Time : 0
Correct Marks : 8
Options :
6406532731450.
6406532731451.
6406532731452.
6406532731453.
6406532731454.

Time : 0
Correct Marks : 8
Which AWK script from the options can count the frequency of each word if executed on a text file?
Note: The text file contains only words separated by spaces.
Options :
6406532731455.
6406532731456.
6406532731457.
6406532731458.

Correct Marks : 7

Possible Answers :

Correct Marks : 7
Response Type : Alphanumeric

Answers Case Sensitive : Yes
Possible Answers :
World

Time : 0
You want to find lines in a text file where the third field is a numeric value between 10 and 20
inclusive. Which command(s) would you use?
Options :
6406532731441.
6406532731442.
6406532731443.
6406532731444.
6406532731445.

Time : 0
Select the correct option(s) to validate whether a string variable contains only digits in a bash
script.
Options :
6406532731446.
6406532731447.
6406532731448.
6406532731449.

Time : 0
You're tasked with extracting phone numbers from a text document in the format of either (123)
456-7890 or 123-456-7890. Which regular expression (ERE) would you use to match both formats?
Options :
6406532731437.
6406532731438.
6406532731439.
6406532731440.

Time : 0
Options :
6406532731459.
6406532731460.
6406532731461.
6406532731462.
TDS
Section Id : 64065356664
Section Number : 14
Section Marks : 19

Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : TOOLS IN DATA SCIENCE
(COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532731463. YES
6406532731464. NO

Time : 0
Correct Marks : 1
What happens if you choose the "Delimited" option in "Text to Columns" and don't select any
delimiter?
Options :
6406532731465. The text will be split based on spaces
6406532731466. The text will not be split, and the original content remains unchanged
6406532731467. An error message will be displayed
6406532731468. The text will be split into individual characters

Time : 0
Correct Marks : 1
K-Means clustering algorithm is sensitive to the initial choice of centroids. Which parameter in
kmeans() function helps the user mitigate this problem?
Options :
6406532731475. algorithm
6406532731476. max_iter
6406532731477. n_clusters
6406532731478. n_init

Time : 0
Correct Marks : 1
We are interested in fitting an ARIMA model to our time series data. Specifically, we are interested
in a moving average model of 0, setting a lag value of 4 for autoregression, and a difference order
of 1. Which of the following gives you such a model?
Options :
6406532731483. ARIMA(..., trend = (4,1,0))
6406532731484. ARIMA(..., order = (4,1,0))
6406532731485. ARIMA(..., order = (0,4,1))
6406532731486. ARIMA(..., trend = (0,4,1))

Time : 0
Correct Marks : 1
If the p-value in a regression analysis is less than the significance level (e.g., 0.05), what does it
generally indicate?
Options :
6406532731495. There is no relationship between variables

6406532731496. The analysis is inconclusive
6406532731497. The relationship between variables is statistically significant
6406532731498. The model is overfitting

Time : 0
Correct Marks : 1
What is OpenRefine used for?
Options :
6406532731499. Data cleaning and transformation
6406532731500. Data compression and storage
6406532731501. Real-time data analysis
6406532731502. Open source refined data

Time : 0
Correct Marks : 1
Subjectivity score ranges between -1 to +1.
Options :
6406532731506. TRUE
6406532731507. FALSE

Time : 0
Correct Marks : 1
Which of the following tab in chrome devtools will show API calls on the website?
Options :
6406532731508. Elements
6406532731509. Console
6406532731510. Sources
6406532731511. Network
6406532731512. APILogs

Time : 0
Correct Marks : 1
Chrome devtools can be accessed by which of the following steps?
Options :
6406532731513. Right click, choose View page-source
6406532731514. Right click, choose Inspect
6406532731515. Settings, more tools and choose Developer Tools
6406532731516. Settings, extensions and search for devtools

Time : 0
Correct Marks : 1
Nominatim can output the type of place for every latitutde longitude.
Options :
6406532731517. TRUE
6406532731518. FALSE

Time : 0
Correct Marks : 1
What Streamlit command is used to add text to the app interface?
Options :
6406532731519. st.add_text()
6406532731520. st.text()
6406532731521. st.insert_text()
6406532731522. st.display_text()

Time : 0
Correct Marks : 1
What is a "Tableau Workbook" in Tableau terminology?
Options :
6406532731523. A workbook created in Microsoft Excel

6406532731524. A Tableau file containing sheets, dashboards, and stories
6406532731525. A spreadsheet in Tableau
6406532731526. A summary of visualizations

Time : 0
Correct Marks : 1
What is the purpose of the "st.button()" command in a Streamlit app?
Options :
6406532731527. Adds a button to trigger an action
6406532731528. Displays the current status of the app
6406532731529. Resets all input fields
6406532731530. Turns the app into full-screen mode

Time : 0
Correct Marks : 1
How can you change the calculation performed in the "Values" area of a Pivot Table?
Options :
6406532731531. By selecting a function from the “Summarize Values by” in the “Value Field
settings”
6406532731532. By right-clicking the cell and choosing "Change Calculation"
6406532731533. By dragging a new field into the "Values" area

6406532731534. By adjusting the cell formatting in the "Values" area

Time : 0
Using cross-validation we find that the ideal K in a K-Nearest Neighbour procedure is 6. Your friend
does not use cross-validation but instead guesses a K of 2. His predictor would:
Options :
6406532731469. have higher bias
6406532731470. have higher variance
6406532731471. have lower bias
6406532731472. have lower variance
6406532731473. overfit the data compared to your solution
6406532731474. underfit the data compared to your solution

Time : 0
How do we find (using Python) all the possible values of categories inside a Pandas data-frame
column named ‘book’? The name of the Pandas data-frame is data_df.
Options :
6406532731479. data_df.book.unique()
6406532731480. data_df.book.category_name()
6406532731481. data_df['book'].distinct()
6406532731482. data_df['book'].unique()

Time : 0
Under which of the following parts of inspect elements can you find cookie information?
Options :
6406532731487. Elements
6406532731488. network
6406532731489. Source
6406532731490. Application

Time : 0
Which of these are Python libraries specifically useful for Geospatial analysis:
Options :
6406532731491. Geopandas
6406532731492. QGIS
6406532731493. Folium
6406532731494. OpenStreetMap

Time : 0
The analysis metric slope can be observed through which of the following ways?
Options :
6406532731503. Trend Line in Line Chart
6406532731504. SLOPE function
6406532731505. None of these
AI
Section Id : 64065356665
Section Number : 15
Section Marks : 25


Yes
Clear Response :

Time : 0
Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : AI: SEARCH METHODS FOR
PROBLEM SOLVING (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532731535. YES
6406532731536. NO

Time : 0
Correct Marks : 0
Options :
6406532731537. Printed graph sheets were provided to me.
6406532731538. Printed graph sheets were not provided to me.
6406532731539. I did not use graph sheets.

SEARCH
Sub questions

Correct Marks : 1
What is the path found by the Best First Search algorithm? Enter the path as a comma separated
list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.

Answer format: S,X,Y,Z
Answers Case Sensitive : No

Possible Answers :
S,D,E,C,G

Correct Marks : 1
What is the path found by A* search algorithm? Enter the path as a comma separated list of node
labels.

Answer format: S,X,Y,Z
Possible Answers :
S,D,H,F,G

Correct Marks : 1
What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma
separated list of node labels.
Use the Branch-and-Bound variation that avoids cyclic expansions like S,A,S,A,S,A,…

Answer format:S,X,Y,Z
Possible Answers :
S,A,B,G

Time : 0
Correct Marks : 1
For the given map, which algorithm finds the shortest path from S to G?
Options :
6406532731543. Best First Search
6406532731544. A* Search Algorithm
6406532731545. Branch-and-Bound Search Algorithm
6406532731546. None of these.

Time : 0
Correct Marks : 1
What can you say about the heuristic function for the given graph?
Options :
6406532731547. Admissible.
6406532731548. Inadmissible.
6406532731549. Partly admissible and partly inadmissible.
6406532731550. Cannot be determined.

TSP Branch-and-Bound
The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... and
so on. The Branch-and-Bound search tree at the time when the algorithm has discovered the
optimal tour is shown below.
Each node in the search tree displays an edge (either XY or ~XY), a cost value, and a unique
reference number (a1, b1, b2, c1, c2, d1, d2, e1, e2, e3, e4). Use the reference numbers to break
ties. When required, enter the reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the
information gleaned from the search tree.
Sub questions

Correct Marks : 1
Let S0 (ref. no. a1) be the first node to be refined, identify the next 4 nodes (2nd to 5th node) that
are refined by the TSP Branch-and-Bound algorithm. Enter the nodes (node reference numbers) in
the order they are refined.
Enter a comma separated list of node reference numbers.

Answer format: a9,b9,c9,d9

Possible Answers :
b1,c1,d1,d2

Correct Marks : 1
Which node represents the optimal tour and what is the cost of the optimal tour? Enter the node
reference number and the tour cost in the text box, or enter NIL if it is not possible to determine
the optimal tour.
Enter a node reference number followed by tour cost, separated by comma.

Answer format: a9,42
Possible Answers :
e2,402

Correct Marks : 1
Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or
enter NIL if it is not possible to determine the number of cities.
Enter an integer.
Answer format: 42
Possible Answers :

Correct Marks : 1
Start from city A, what is the path representation of the optimal tour? Enter the path
representation in the text box, or enter NIL if it is not possible to determine the optimal tour.
Enter a comma separated list of cities (city labels).

Answer format: A,B,C
Answers Type : Set
Possible Answers :
A,C,B,E,D,F
A,F,D,E,B,C

GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to J.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox).
Tie-breaker: when several nodes carry the same best cost then select the deepest node, if tie
persists then select the leftmost of the deepest nodes.
Sub questions

Time : 0
Which of the following is a strategy for the MAX player?
Options :
6406532731555. A,C
6406532731556. A,D,H
6406532731557. D,F,G
6406532731558. E,I,J

Correct Marks : 1
List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order.
Enter a comma separated list of node labels in alphabetical order.

Answer format: X,Y,Z

Possible Answers :
D,E

Correct Marks : 1
List the leaf nodes pruned by Alpha-Beta.

Possible Answers :
C,F,G,I,J

Correct Marks : 1
List the leaf nodes solved (assigned SOLVED status) by SSS*.

Answers Type : Set
Possible Answers :
A,D,E,H
A,D,H,E

PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or
more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each
node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a
primitive node is added to the graph by its parent when the parent is expanded, and the primitive
node is labeled as SOLVED and it will not be expanded subsequently.
The cost of each edge is 2 units.

Tie-breaker 1: If several nodes have the same cost then break the tie using node labels.
Tie-breaker 2: For AND nodes, select the unsolved branch with the highest cost.
Use AO* algorithm to solve S, then answer the sub-questions.
Sub questions

Correct Marks : 1
List the first three nodes (including S) expanded by AO* algorithm. List the nodes in the order they
are expanded. Observe that primitive nodes are not expanded.
Enter a comma separated list of node labels.


Answers Type : Set
Possible Answers :
S,A,B
A,B,E

Correct Marks : 1
Determine the value of the start node S after each node is expanded. What are the values of S
after the 1st, 2nd and 3rd nodes are expanded, respectively? Enter the 3 values in the textbox.
Enter a comma separated list of numbers.

Answer format: 12,42,17
Answers Type : Set
Possible Answers :
22,32,24
32,24,38

Correct Marks : 1
What is the final value of the start node S?
Enter a number.
Answer format: 42
Possible Answers :
38

RULE BASED EXPERT SYSTEMS
A Rete Net for classifying lenses based on surface properties (convex, concave, planar, radius of
curvature, and number of sides) is shown in the figure. Each lens is uniquely identified by “itemNo”
attribute, the remaining classes and attributes are self explanatory.
A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the figure.
The labels A1, A2, ..., A15, ..., B1, B2, …, B5, R1, …, R6 uniquely identify the nodes in the network.
When required, use the above label ordering to break ties and to enter short answers.
Note: beta nodes B4 and B5 compare the radius of curvature of two surfaces.
Sub questions

Time : 0
Correct Marks : 1
Which of the following rule-data tuples are in the conflict-set?
Options :
6406532731565. R1,105
6406532731566. R2,103,106
6406532731567. R4,102,103
6406532731568. R5,102

Time : 0
Correct Marks : 1
If the Inference Engine uses Specificity as the conflict resolution strategy then which of the
following rule-data tuples will qualify?
Options :
6406532731569. R1,105
6406532731570. R3,101,104
6406532731571. R4,102,103
6406532731572. R5,102

Time : 0
Correct Marks : 1
If the Inference Engine uses Recency as the conflict resolution strategy then which of the
following rule-data tuples will qualify?.
Options :
6406532731573. R2,103,107
6406532731574. R3,101,104
6406532731575. R4,102,103
6406532731576. R6,107

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. This is the
same domain used in the assignments.
Sub questions

Time : 0

Which of the following are applicable actions in the start state?
Options :
6406532731577. Putdown(D)
6406532731578. Stack(D,C)
6406532731579. Pickup(B)
6406532731580. Stack(D,A)
6406532731581. Stack(A,C)

Time : 0
Which of the following are relevant actions in the goal state?
Options :
6406532731582. Pickup(B)
6406532731583. Putdown(D)
6406532731584. Unstack(B,E)
6406532731585. Stack(D,C)
6406532731586. Stack(D,A)

Time : 0

In the planning graph, which of the following are mutex action pairs in Layer 1?
Options :
6406532731587.
6406532731588.
6406532731589.
6406532731590.
6406532731591.

Time : 0
In the planning graph, which of the following are mutex proposition pairs in Layer 1?
Options :
6406532731592.
6406532731593.
6406532731594.
6406532731595.
6406532731596.

CONSTRAINT SATISFACTION
The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedral
objects is provided below. The in-plane clockwise/counterclockwise rotations of these junctions
are valid as well. These junctions provide constraints on the possible edge assignments (convex,
concave, arrow) for the edges/lines in 2D line drawings of trihedral objects.
The junctions carry unique labels: L1, L2, L3, L4, L5, L6, T1, T2, T3, T4, W1, W2, W3, Y1, Y2, Y3. When
required, use the labels in short answers.
Note: A 2D line drawing of trihedral objects is considered to be consistent if all the edges and
junctions can be assigned labels that are consistent with each other, otherwise the drawing is
considered to be inconsistent and all labels are reset to NIL.
Apply a suitable algorithm to assign consistent labels to edges/junctions in the 2D line drawings in
the sub-questions. Choose a suitable edge and junction order for solving the problems.
Sub questions

Correct Marks : 1
Assign consistent labels to all the edges and junctions in the 2D line drawing shown below. Enter
the labels of the junctions 1, 2, 3, 4 in the text box, in that order. Otherwise enter NIL if the
drawing has no consistent label assignment.
Enter a comma separated list of junction labels, or enter NIL.

Answer format: Y9,T9,W9,L9

Possible Answers :
NIL

Correct Marks : 1
Assign consistent labels to all the edges and junctions in the 2D line drawing shown below. Enter
the labels of the junctions 1, 2, 3, 4 in the text box, in that order. Otherwise enter NIL if the
drawing has no consistent label assignment.
Enter a comma separated list of junction labels, or enter NIL.

Answer format: Y9,T9,W9,L9

Possible Answers :
W3,Y3,L5,T4

DS Foundation End Term January 2024 FN

Uploaded by

Copyright:

Available Formats

DS Foundation End Term January 2024 FN

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DS Foundation End Term January 2024 FN

Uploaded by

Copyright:

Available Formats

Indian Institute of Technology, Madras - BS in Data Science and Applications

1.Options shown in green color and with icon are correct.

2.Options shown in red color and with icon are incorrect.

IIT M FOUNDATION DIPLOMA FN EXAM

Subject Name : 2024 Apr28: IIT M FN EXAM QDF1

Creation Date : 2024-04-16 12:17:02

Total Marks : 974

Display Marks: Yes

Share Answer Key With Delivery Engine : Yes

Actual Answer Key : Yes

Magnifying Glass Required? : No

Scratch Pad Required? : No

Rough Sketch/Notepad Required? : No

Show Watermark on Console? : Yes

Auto Save on Console? Yes

Change Font Color : No

Change Background Color : No

Show Progress Bar : No

Group Maximum Duration : 0

Group Minimum Duration : 90

Show Attended Group? : No

Edit Attended Group? : No

Group Marks : 974

Is this Group for Examiner? : No

Examiner permission : Cant View

Show Progress Bar? : No

Revisit allowed for group Instructions? : Yes

Maximum Instruction Time : 0

Minimum Instruction Time : 0

Group Time In : Minutes

Navigate To Group Summary From Last Question? : No

Disable Submit Button During Assessment? : No

Section Selection Time? : 0

No of Optional sections to be attempted : 0

Section type : Online

Mandatory or Optional : Mandatory

Number of Questions to be attempted : 17

Section Marks : 100

Display Number Panel : Yes

Section Negative Marks : 0

Group All Questions : No

Enable Mark as Answered Mark for Review and

Maximum Instruction Time : 0

Question Shuffling Allowed : No

Is Section Default? : null

Question Number : 1 Question Id : 640653814914 Question Type : MCQ Is Question

Question Label : Multiple Choice Question

THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL : SEMESTER I:

Question Number : 2 Question Id : 640653814915 Question Type : MCQ Is Question

Question Label : Multiple Choice Question

6406532730505. Useful Data has been mentioned above.

Question Shuffling Allowed : Yes

Question Number : 3 Question Id : 640653814917 Question Type : MCQ Is Question

Question Label : Multiple Choice Question

What will N represent at the end of the execution?

6406532730512. Minimum number of bills issued to a single customer

6406532730513. Maximum number of bills issued to a single customer

6406532730514. Number of distinct customers in the dataset

Question Label : Multiple Choice Question

Question Shuffling Allowed : Yes