Home / Study library / Programming, Data Structures and Algorithms using Python / End Term · Jan 2023 Programming, Data Structures and Algorithms using Python · End Term · Jan 2023 · AN
Programming, Data Structures and Algorithms using Python · End Term · Jan 2023 AN
← Course papers · Start practice / exam
This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 28 published solutions
Q293 Q294 Q295 Q296 Q297 Q298 Q299 Q300 Q301 Q302 Q303 Q304 Q305 Q306 Q307 Q308 Q309 Q310 Q311 Q312 Q313 Q314 Q315 Q316 Q317 Q318 Q319 Q320
Question 293 MCQ · 3.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q293
Question 294 MCQ · 3.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q294
Question 295 MCQ · 3.0 marks A published solution is not available for this question yet.
Report a correction for Q295
Question 296 MCQ · 3.0 marks Consider the following statements:
1. Cross edges cannot occur in the DFS of an undirected graph
2. DFS of a directed graph always produces the same number of tree edges independent of the
node selected as the source.
3. If at least one topological order exists for a directed graph, then the DFS of that graph will not
produce any back edges.
Which of the given statement(s) is/are **true**?
A. Statement 1 and Statement 2
B. Statement 2 and Statement 3
C. Statement 1 and Statement 3
D. All three statements are true
A published solution is not available for this question yet.
Report a correction for Q296
Question 297 MCQ · 3.0 marks A binary search tree in which every node has either 0 or 2 children is referred as strictly binary
tree. Such a tree with 25 leaves _________________.
A. has exactly total 50 nodes
B. has exactly total 48 nodes
C. has exactly total 49 nodes
D. has exactly total 51 nodes
A published solution is not available for this question yet.
Report a correction for Q297
Question 298 MCQ · 3.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q298
Question 299 MCQ · 3.0 marks A published solution is not available for this question yet.
Report a correction for Q299
Question 300 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q300
Question 301 MCQ · 4.0 marks E. Can't be decided because the probability depends upon the key's value
A published solution is not available for this question yet.
Report a correction for Q301
Question 302 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q302
Question 303 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q303
Question 304 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q304
Question 305 MCQ · 4.0 marks Consider the characters **e, f, s, m, p** have probability of occurrence 1/2, 1/4, 1/8, 1/16, 1/32
respectively in a text. If **Huffman encoding** is used to compress the text, then what will be the
average number of bits required per character in the compressed text ?
A published solution is not available for this question yet.
Report a correction for Q305
Question 306 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q306
Question 307 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q307
Question 308 MCQ · 4.0 marks Which of the following combination of input text T and pattern P will exhibit the worst case
running time behavior for **Boyer-Moore skipping heuristic**?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q308
Question 309 MSQ · 3.0 marks Which of the following sorting algorithm will have the same time complexity irrespective of the
sequence of elements they are sorting?
A published solution is not available for this question yet.
Report a correction for Q309
Question 310 MSQ · 3.0 marks Which of the following statement(s) is/are **true**?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q310
Question 311 MSQ · 3.0 marks Which of the following is/are true about **AVL Tree**? Assume that the height of the empty tree is 0.
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q311
Question 312 MSQ · 3.0 marks Consider the following statements and choose the correct ones.
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q312
Question 313 MSQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q313
Question 314 MSQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q314
Question 315 NAT · 3.0 marks A published solution is not available for this question yet.
Report a correction for Q315
Question 316 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q316
Question 317 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q317
Question 318 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q318
Question 319 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q319
Question 320 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q320