pdsa
  • Welcome
  • Course
    • Introduction
  • CONTENT
    • Week 1
      • Chapter 1
      • Chapter 2
      • Chapter 3
      • Chapter 4
      • Chapter 5
      • Chapter 6
      • Chapter 7
    • Week 2
      • Chapter 2.1
      • Chapter 2.2
    • Week 3
      • Chapter 3.1
    • Week 4
      • Chapter 4.1
    • Week 5
    • Week 6
    • Assessment I
      • A I 1
    • Assignment I
      • CA | 1
Powered by GitBook
On this page
  1. CONTENT
  2. Assignment I

CA | 1

Test I

Question 1: Delete nodes in linked list

Question 2: Find all connected (disconnected) nodes in a network or graph given a base node.

Question 3: Minimum cost of spanning nodes in a tree or network or graph

Question 4: Given a list, add the elements to get the maximum sum provided no two adjacent elements are added/chosen in the selected list of elements.

PreviousAssignment I

Last updated 3 months ago