Question Label : Multiple Choice Question
Which of the following could be the possible output of print(results.best_score_)?
Options :
6406531512789. 1
6406531512790. -2999.79
6406531512791. 0.528
6406531512792. 0.681
PDSA
Section Id : 64065329424
Section Number : 8
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 30
Number of Questions to be attempted : 30
Section Marks : 100
Display Number Panel : Yes
Group All Questions : No
Enable Mark as Answered Mark for Review and
Yes
Clear Response :
Maximum Instruction Time : 0
Sub-Section Number : 1
Sub-Section Id : 64065365744
Question Shuffling Allowed : No
Is Section Default? : null
Question Number : 218 Question Id : 640653454911 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 "DIPLOMA LEVEL: PROGRAMMING DATA
STRUCTURES AND ALGORITHMS USING PYTHON"
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 :
6406531512904. YES
6406531512905. NO
Sub-Section Number : 2
Sub-Section Id : 64065365745
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 219 Question Id : 640653454912 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531512906.
6406531512907.
6406531512908.
6406531512909.
Question Number : 220 Question Id : 640653454913 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531512910.
6406531512911.
6406531512912.
6406531512913.
Question Number : 221 Question Id : 640653454919 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
A BFS traversal from a source node s in an unweighted, connected and undirected graph results in
a BFS tree T. The tree T is a data structure for computing___
Options :
6406531512932. the shortest path between every pair of vertices.
6406531512933. the shortest path from S to only those nodes that are leaves of T.
6406531512934. the shortest path from S to every vertex in the graph.
6406531512935. the longest path from S to every vertex in the graph.
Question Number : 222 Question Id : 640653454920 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531512936. 3
6406531512937. 4
6406531512938. 5
6406531512939. 6
Question Number : 223 Question Id : 640653454921 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531512940.
6406531512941.
6406531512942.
6406531512943.
Question Number : 224 Question Id : 640653454923 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Which one of the following algorithm design techniques is used in Huffman Encoding algorithm ?
Options :
6406531512948. Greedy
6406531512949. Dynamic programming
6406531512950. Divide and conquer
6406531512951. None of these
Question Number : 225 Question Id : 640653454924 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Let G = (V, E) be an undirected graph having distinct positive edge weights. Let V be partitioned
into two non-empty sets X and Y. Let e = (s, t) be the minimum cost edge, with s belonging to X and
t belonging to Y. Which of the following statement(s) is/are true?
1. There must be only one unique spanning tree with minimum weight for G.
2. The edge e must definitely belong to minimum cost spanning tree of G
Options :
6406531512952. Only 1
6406531512953. Only 2
6406531512954. Both 1 and 2
6406531512955. Neither 1 nor 2
Question Number : 226 Question Id : 640653454926 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Consider the following binary search tree. The letters indicate the names of the nodes, not the
values that are stored.
Which of the following nodes is 3rd smallest node (in terms of value) in the given binary search
tree?
Options :
6406531512960. B
6406531512961. I
6406531512962. O
6406531512963. P
Question Number : 227 Question Id : 640653454927 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
The maximum and the minimum number of nodes possible in a binary search tree of height 5
are___. Consider that the height of the empty tree is 0.
Options :
6406531512964. 32 and 5, respectively
6406531512965. 32 and 4, respectively
6406531512966. 31 and 5, respectively
6406531512967. 31 and 4, respectively
Question Number : 228 Question Id : 640653454939 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531512996.
6406531512997.
6406531512998.
6406531512999.
Question Number : 229 Question Id : 640653454940 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531513000.
6406531513001.
6406531513002.
6406531513003.
Question Number : 230 Question Id : 640653454942 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531513010. Only statement 1
6406531513011. Only statement 2
6406531513012. Only statement 3
6406531513013. Statement 2 and Statement 3
6406531513014. Statement 1 and Statement 2
Sub-Section Number : 3
Sub-Section Id : 64065365746
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 231 Question Id : 640653454914 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Options :
6406531512914.
6406531512915.
6406531512916.
6406531512917.
Question Number : 232 Question Id : 640653454916 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Options :
6406531512923.
6406531512924.
6406531512925.
6406531512926.
Question Number : 233 Question Id : 640653454925 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Options :
6406531512956. 1
6406531512957. 2
6406531512958. 3
6406531512959. 4
Question Number : 234 Question Id : 640653454935 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Options :
6406531512986.
6406531512987.
6406531512988.
6406531512989.
Question Number : 235 Question Id : 640653454938 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Which of the following options represents the fail function (or prefix function) for pattern
'ABABAABA' in the Knuth-Morris-Pratt (KMP) algorithm?
Options :
6406531512992.
6406531512993.
6406531512994.
6406531512995.
Sub-Section Number : 4
Sub-Section Id : 64065365747
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 236 Question Id : 640653454915 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Selectable Option : 0
Question Label : Multiple Select Question
Options :
6406531512918. 44
6406531512919. 12
6406531512920. 55
6406531512921. 101
6406531512922. 112
Question Number : 237 Question Id : 640653454918 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Selectable Option : 0
Question Label : Multiple Select Question
Which of the following statements is/are true about adjacency list representation and adjacency
matrix representation of a graph?
Options :
6406531512928.
6406531512929.
6406531512930.
6406531512931.
Question Number : 238 Question Id : 640653454922 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Selectable Option : 0
Question Label : Multiple Select Question
Which of the following statements is true about Dijkstra's algorithm to find the shortest path?
Options :
6406531512944. The shortest path returned by Dijkstra's algorithm always passes through the
least number of vertices.
6406531512945. To decide which node to visit next, Dijkstra's algorithm selects the node with
smallest known distance.
6406531512946. Dijkstra’s algorithm may fail for graphs with negative weights because it does
not reconsider a node once it marks it as visited even if a shorter path exists than the previous
one.
6406531512947. It returns the shortest path between all pairs of nodes.
Question Number : 239 Question Id : 640653454929 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Selectable Option : 0
Question Label : Multiple Select Question
Which of the following is/are true about AVL Tree? Assume that the height of the empty tree is 0.
Options :
6406531512969.
6406531512970.
6406531512971.
6406531512972.
Question Number : 240 Question Id : 640653454930 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Selectable Option : 0
Question Label : Multiple Select Question
Which of the following statements is/are true about Huffman coding algorithm?
Options :
6406531512973. In an optimal Huffman tree, if leaf labelled x is at depth smaller than leaf
labelled y, then frequency(x) >= frequency(y)
6406531512974. In an optimal Huffman tree, if leaf labelled x is at depth smaller than leaf
labelled y, then frequency(x) <= frequency(y)
6406531512975. Huffman coding algorithm always generates prefix code.
6406531512976. Huffman coding algorithm is based on a greedy approach.
Sub-Section Number : 5
Sub-Section Id : 64065365748
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 241 Question Id : 640653454917 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 4
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 :
14
Question Number : 242 Question Id : 640653454928 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 4
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 :
227
Question Number : 243 Question Id : 640653454936 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 4
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 :
23
Question Number : 244 Question Id : 640653454937 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 4
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 :
19000
Sub-Section Number : 6
Sub-Section Id : 64065365749
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 245 Question Id : 640653454931 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 3
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-Section Number : 7
Sub-Section Id : 64065365750
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 246 Question Id : 640653454941 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4 Selectable Option : 0
Question Label : Multiple Select Question
Options :
6406531513004.
6406531513005.
6406531513006.
6406531513007.
6406531513008.
6406531513009.
Sub-Section Number : 8
Sub-Section Id : 64065365751
Question Shuffling Allowed : No
Is Section Default? : null
Question Id : 640653454932 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 : (247 to 248)
Question Label : Comprehension
Based on the above data, answer the given subquestions.
Sub questions
Question Number : 247 Question Id : 640653454933 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531512978. A greedy algorithm
6406531512979. A dynamic programming algorithm
6406531512980. A divide and conquer algorithm
6406531512981. None of these
Question Number : 248 Question Id : 640653454934 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406531512982.
6406531512983.
6406531512984.
6406531512985.
DBMS
Section Id : 64065329425
Section Number : 9
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 25
Number of Questions to be attempted : 25
Section Marks : 50
Display Number Panel : Yes
