Data Structures and Algorithms

Topic outline

• 

  General

  
  

  
  

  
  

  
  

  Welcome to the Data Structures and Algorithms Course 

  BIT Program | Semester 3 | Part-Time Courses 

  
  

  In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification.

  More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations (algorithms) that can be applied to the data.

  ArrayList, LinkedList, Stacks, Queues, Trees, Graph, Hash Tables are examples for data structures. 

  Sorting and Searching are generic algorithms executed on data collections in addition to operational algorithms executed on various data structures. There are some structure specific operations such as balancing in trees and shortest path calculation in graph.    

  
  

  Your facilitators:
  Mr. Dimuthu Suranga (Course Coordinator)
  Mr. Janitha Chamara  (Online Facilitator)

  • Announcements Forum
  • 
    
• 

  1. Data Structures and Algorithm

  • 1.1 Overview to Different Data Structures SCORM package
  • 1.1.1  Implementable - Array List vs Linked List 
    
  • Review Questions Quiz
  • Past Paper Questions Quiz
  • 1.1.2  Abstract - Stacks, Queues, Tree, Graph 
    
  • 1.1.3  Importance of Having Abstract Data Structures 
    
  • Review Questions Quiz
  • Past Paper Questions Quiz
  • 1.2 Overview to Algorithms SCORM package
  • 1.2.1  Basic Algorithms on All Data Structures  
    
  • 1.2.2  Specific Algorithms on Different Data Structures  
    
  • 1.2.3  Searching and Sorting Algorithms   
    
  • Review Questions Quiz
  • Past Paper Questions Quiz
  • 1.3 Efficiency Analysis of Algorithm SCORM package
  • 1.3.1  Time Complexity - Processor Performance     
    
  • 1.3.2  Space Complexity - Memory/RAM Performance     
    
  • Review Questions Quiz
  • Past Paper Questions Quiz
  • S3-DSA | 1A-FO | Introduction to DSA | 06 March | 7.30pm-9.30pm Zoom meeting
  • Recording of the Class

  • Feedback on Lecture Participation
  • S3-DSA | 1B-FO | Introduction to DSA | 09 March | 7.30pm-9.30pm Zoom meeting
  • Recording of the Class

  • 1.4 Algorithm Evaluation with Dry Testing SCORM package
  • 1.6 Searching Techniques SCORM package
  • 1.7 Java Collection Framework SCORM package
  •   Java Collection Framework (java.util)  
    
  • Sample Upload Assignment
  • Sample Discussion Forum
• 

  2. Recursion

  • 2.1 Anatomy of Recursive Call SCORM package
  • 2.1.1  JVM Call Stack and Activation Record  
    
  • 2.1.2  Anatomy of a Recursive Call - Base Case and Recursive Case   
    
  • 2.3 Recursion vs Iteration SCORM package
  • 2.2 Examples for Recursive Applications SCORM package
  • 2.2.1  Power    
    
  • 2.2.1  Factorial     
    
  • 2.2.1  Fibonacci Numbers       
    
  • 2.2.1  Triangle Numbers       
    
  • 2.3 Recursion Types SCORM package
  • 2.4 Merge Sort SCORM package
  • 2.5 Quick Sort SCORM package
• 

  3. Array Lists
• 

  4. Linked Lists
• 

  5. Stacks
• 

  6. Queues
• 

  7. Trees
• 

  8. Graphs
• 

  9. Hash Tables