Scribd
Upload
16 views

0-CST3011 - Algorithms and Data Structures - Course Introduction

Algorithm lecture0

Uploaded by

Ben Aiah
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
16 views

0-CST3011 - Algorithms and Data Structures - Course Introduction

Algorithm lecture0

Uploaded by

Ben Aiah
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

CSC3011 – Algorithms and Data

Structures
Course Introduction
Outline
 Class Introduction

 Course Objectives

 Course Outline

 Course Assessment

 Course Materials

 Q&A Session
Class Introduction
 Lecturer: David M. Zulu
 Mathematics/Computer Science
[email protected], [email protected]
Course Objectives
 Algorithms and Data Structures is a course in which
you will be introduced to
 Data Structures a means of organising large amounts of data
 The design of algorithms and a mechanism of theoretically
analysing the performance of algorithms

 At the end of this course you should be able to


 Design simple and complex data structures
 Analyse the performance of an algorithm
 Improve upon the performance of the algorithms
 Compare various algorithms in searching and sorting
 Determine the suitability of data structures for a given
problem
 Apply algorithm design techniques
Course Outline
1. Mathematics review
 Review of mathematics concepts relevant to this course including recursion and recurrence
problems
2. Algorithm Analysis
3. Sorting
 Bubble, insertion, selection,
4. Simple Data Structures
 Lists, stacks and queues
5. Trees
 General trees, binary trees, Balanced trees, AVL and specialised trees
6. Priority Queues
 Implementations
 Advanced sorting
 Merge sort, Quicksort
1. Hashing
 Hashing concepts, hash functions, separate chaining, open addressing, rehashing
 Graphs
 Representation, Topological sort, Minimum spanning tree, Shortest path, graph traversal
 Algorithm design techniques
 Greedy algorithms, Divide and conquer, dynamic programming, randomised algorithms,
backtracking algorithms
Course Assessment
 Continuous Assessment (40%)
 Class/Lab Exercises (5)
 Non-deterministically given - randomly and arbitrarily to
keep you awake
 Quizzes (10+)
 Deterministic: basically each topic attracts a number of
quizzes
 Assignments
 To be submitted as research reports on various subjects
related to the course
 Tests (20%)
 2+ tests
 Examination (60%)
 1 final examination
Course Materials
 Prescribed Text (s)
 Mark Allen Weiss, 3rd Ed, Data Structures and
Algorithms Analysis in Java, Addison Wesley, 2012.
(PDF provided)
 Cormen, Leiserson, and Rivest, Introduction to
Algorithms, McGraw Hill, 1990 (PDF provided)
 Recommended
 Sedgewick and Flajolet, Analysis of Algorithms,
Addison Wesley, 1996 (PDF)
 Internet Resources

You might also like