Scribd
Upload
8 views

Programming, Data Structures And Algorithms Using Python Week 7

Uploaded by

kumar.pawan2005g
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Programming, Data Structures And Algorithms Using Python Week 7

Uploaded by

kumar.pawan2005g
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Week 7 Quiz

Due date: 2024-09-11, 23:59 IST.


Assignment not submitted
1 All questions carry equal weightage. All Python code is assumed to be executed using Python3. You may
submit as many times as you like within the deadline. Your final submission will be graded.
Note:

• If the question asks about a value of type string, remember to enclose your answer in single
or double quotes.
• If the question asks about a value of type list, remember to enclose your answer in square
brackets and use commas to separate list items.

Given the following permutation of a,b,c,d,e,f,g,h,i,j, what is the next permutation in lexicographic
(dictionary) order? Write your answer without any blank spaces between letters.

fjadbihgec

2.5 points
2.5 points
2 We want to add a function length() to the class Node that implements user defined lists which will
compute the length of a list. An incomplete implementation of length() given below. You have to provide
expressions to put in place of XXX, YYY. and ZZZ.

def length(self):
if self.value == None:
return(XXX)
elif self.next == None:
return(YYY)
else:
return(ZZZ)

XXX: 0, YYY: 0, ZZZ: self.next.length()


XXX: 0, YYY: 0, ZZZ: 1 + self.next.length()
XXX: 0, YYY: 1, ZZZ: self.next.length()
XXX: 0, YYY: 1, ZZZ: 1 + self.next.length()
2.5 points
3 Suppose we add this function foo() to the class Tree that implements search trees. For a
name mytree with a value of type Tree, what would mytree.foo() compute?

def foo(self):
if self.isempty():
return(0)
elif self.isleaf():
return(1)
else:
return(self.left.foo() + self.right.foo()))

The number of nodes in mytree


The largest value in mytree.
The length of the longest path from root to leaf in mytree.
The number of leaves in mytree.

4 Inorder traversal of a binary tree has been defined in the lectures. A preorder traversal lists the vertices of a
binary tree (not necessarily a search tree) as follows:

• Print the root.


• Print the left subtree in preorder.
• Print the right subtree in preorder.

Suppose we have a binary tree with 10 nodes labelled a, b, c, d, e, f, g, h, i, j, with preorder


traversal gbhecidajf and inorder traversal ehbicgjafd. What is the right child of the root node?

Hint
2.5 points
You may submit any number of times before the due date. The final submission will be considered for grading.

You might also like