Federal University of Rio Grande do Norte

Technology Center

Department of Computer Engineering and Automation

Algorithms and Data Structure II (DCA3702)

This is the repository for the Algorithms and Data Structures II course, offered by the Department of Computer Engineering and Automation (DCA) of the Technology Center (CT) at the Federal University of Rio Grande do Norte (UFRN).

The DCA aims to train professionals capable of designing and developing computer systems for industrial automation, embedded systems, software systems, distributed systems, computer networks, and information systems. The CT offers undergraduate and graduate courses in Engineering. This course is part of the curriculum of the Computer Engineering program at DCA/UFRN.

References

• 📚 Coscia, Michele. The Atlas for the Aspiring Network Scientist
• 📚 Newman, Mark. Networks

Tool	Link
😃 Networkx	networkx.org
⚙️ Gephi	gephi.org
🚀 OSMnx	github.com/gboeing/osmnx
💾 Dataset	snap.stanford.edu/data

Lessons

Week 01

• Course Outline: Provides an overview of the course structure and topics covered.
  • 🎉 GitHub Education Benefits
    • GitHub Education Pro: Get access to the GitHub Education Pro pack by visiting GitHub Education
  • 📖 Learning Resources
    • GitHub Learning Game: Check out the interactive Git learning game at GitHub Learning Game
    • Basic Python: Enhance your Python skills through the Kaggle Python course.
• Network Fundamentals I: ntroduction to network science, including its scope, real-world applications, mathematical foundations, and core concepts from graph theory.
  • Network elements using networkx tool.
  • 📚 Further reading: Chapters 2, 3, 6, and 7 of The Atlas For The Aspiring Network Scientist.

Week 02

• Network Fundamentals II: Probability, extended graphs, matrices, degree and representation.
  • Extended graphs and representation using networkx tool.
  • 📚 Further reading: chapters 7, 8, 9 of the book The Atlas For The Aspiring Network Scientist.

Week 03

• Small-World Networks: This week introduces fundamental concepts in network science, including small-world phenomena. The lecture explores how these properties influence the structure and dynamics of real-world networks.
  • In this case study, you will construct and analyze a real-world network derived from Wikipedia pages using a snowball sampling approach.
  • Build a graph from Wikipedia pages starting from a seed node
  • Collect data through a snowballing (BFS-like) exploration process
  • Clean the dataset by truncating expansion depth and removing duplicates
  • Explore structural properties of the resulting network (e.g., degree distribution, connectivity)
  • Wikipedia Pages Network Notebook