# Programming, Data Structures And Algo Using Python Assignment 6 Answers

Programming, Data Structures And Algo Using Python Assignment 6 Answers 2022:- In This article, we have provided the answers to Programming, Data Structures And Algo Using Python Assignment 6. You must submit your assignment with your own knowledge.

This course is an introduction to programming and problem-solving in Python.  It does not assume any prior knowledge of programming.  Using some motivating examples, the course quickly builds up basic concepts such as conditionals, loops, functions, lists, strings and tuples.  It goes on to cover searching and sorting algorithms, dynamic programming and backtracking, as well as topics such as exception handling and using files.  As far as data structures are concerned, the course covers Python dictionaries as well as classes and objects for defining user-defined datatypes such as linked lists and binary search trees.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the average of the best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF YOUR AVERAGE ASSIGNMENT SCORE >=10/25 AND YOUR EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Below you can find the answers for Programming Data Structures And Algo Using Python Assignment 6

## Programming Data Structures And Algorithms Using Python Assignment 6 Quiz Answers [July – Dec 2022]

1. Suppose u and v both have values of type set and are disjoint. Which of the following expressions evaluates to True?

a. u == v | (u^v)
b. u == (v^u)
c. u == v^(u | v)
d. u == u^(v | u)

`Answer:- c`

2. Suppose u and v both denote sets in Python. What is the most general condition that guarantees that u|v = uv?

a. The sets u and v should be disjoint.
b. The set u should be a subset of the set v.
c. The set v should be a subset of the set u.
d. This is true for any u and v.

`Answer:- a`

3. Consider the min-heap [15, 27, 33, 39, 66, 39, 47, 58, 51]. built by repeatedly inserting values into an empty heap. Which of the following could not have been the last element inserted into this heap?

a. 27
d. 15
c. 58
d. 51

`Answer:- c`

4. Suppose we execute delete-min twice on the min-heap [13,29,24,67,52,89,45,98.79,58]. What is the resulting heap?

`Answer:- [29, 52, 45, 67, 79, 89, 58, 98]`

## Programming, Data Structures And Algo Using Python Assignment 6 Answers 2022 {Jan – June}

Q1. Suppose u and v both denote sets in Python. Under what condition can we guarantee that u-(v-u) == u?

Q2. Suppose u and v both denote sets in Python. and u|v != u^v. What can we conclude about u and v?

Q3. Which of the following does not correspond to a min-heap on the list of values [19,97,83,45,72,55,31,28,31,29].

Q4. Consider the min-heap [19, 28, 31, 31, 29, 83, 55, 97, 45, 72]. Suppose we apply the operation delete_min() to this min-heap. The resulting min-heap is:if( aicp_can_see_ads() ) {}