This set of MCQ(multiple choice questions) focuses on the **The Joy of Computing using Python NPTEL 2022 Week 12 Assignment Solutions**.

The course carries programming to your work area with stories, similarities and distinguished models. Going reflections to experiences and designing to engineering, the course concentrates fundamentally to rouse the student’s psyche to automatically think intelligently and show up at an answer. As a feature of the course, you will figure out how to practice and culture the craft of programming with Python as a language.

### Course layout

*Answers COMING SOON! Kindly Wait!*

**Week 0: Assignment answers**

Week 1:

**Assignment answers**

Week 2:

**Assignment answers**

Week 3:

**Assignment answers**

Week 4:

**Assignment answers**

Week 5:

**Assignment answers**

Week 6:

**Assignment answers**

Week 7:

**Assignment answers**

Week 8:

**Assignment answers**

Week 9:

**Assignment answers**

Week 10:

**Assignment answers**

Week 11:

**Assignment answers**

Week 12: Assignment answers

**NOTE:** You can check your answer immediately by clicking show answer button. **The Joy of Computing using Python **NPTEL 2022 Week 12 Assignment Solution” contains 10 questions.

Now, start attempting the quiz.

**The Joy of Computing using Python** NPTEL 2022 Week 12 Assignment Solutions

**Q1.** State True or False:

The number of people referring a person matters over who is referring a person.

a) True

b) False

**Answer:** b) False

**Q2.** Which of the following is true about page rank?

a) Websites are nodes and hyperlinks in websites are edges.

b) Hyperlinks in websites are nodes and websites are edges.

c) Websites will work as nodes and edges.

d) Hyperlinks will work as nodes and edges.

**Answer:** a) Websites are nodes and hyperlinks in websites are edges.

**Q3.** What is a drunkard’s walk?

a) Strategised walking

b) Walking one step at a time.

c) Random walking

d) Zig zag walking

**Answer:** c) Random walking

**Q4.** Given a set of networks, which node in that network is considered as most impressive?

a) Node with maximum incoming edges.

b) Node with maximum visits.

c) Node with minimum incoming edges.

d) Node with minimum visits.

**Answer:** b) Node with maximum visits.

**Q5.** What will be the **G.out_degree(8)** for the following graph(G)?

a) 0

b) 5

c) 3

d) 8

**Answer:** a) 0

**Q6.** Which of the following is true about undirected graphs?

a) One can come back and forth from one node to another using a single edge.

b) One can only go forward from one node to another using a single edge.

c) One can go to any node from one node using one edge.

d) None of the above.

**Answer:** a) One can come back and forth from one node to another using a single edge.

**Q7.** which of the following statements will choose a random node from graph A?

a) random.choices(A)

b) random.choices(A.nodes())

c) random.choice(A.nodes())

d) random.choice(A)

**Answer:** c) random.choice(A.nodes())

**Q8.** which of the following is not true about collatz conjecture?

a) Bigger the number, larger the steps it would take to converge.

b) The number of steps is independent of the number.

c) Collatz conjecture will always converge.

d) Collatz conjecture might or might not converge.

**Answer:** b), d)

**Q9.** In collatz conjecture, if a number is even then what should be the next step?

a) Divide it by 2

b) Multiply it by 3

c) Multiply it by 3 then add 1

d) Divide it by 2 then add 1

**Answer:** a) Divide it by 2

**Q10.** The collatz conversion of 10 looks like

a) 10 5 16 8 4 2 1

b) 10 22 11 8 4 2 1

c) 10 5 16 8 4 2

d) None of the above

**Answer:** a) 10 5 16 8 4 2 1

**<< Prev- The Joy of Computing using Python Week 11 Assignment Solutions**

DISCLAIMER:Use these answers only for the reference purpose. Quizermania doesn't claim these answers to be 100% correct. So, make sure you submit your assignments on the basis of your knowledge.

*For discussion about any question, join the below comment section. And get the solution of your query.* Also, try to share your thoughts about the topics covered in this particular quiz.

Checkout for more NPTEL Courses: *Click Here!*