Scribd
Upload
16 views11 pages

Lecture 0 - About This Course

This course outline provides information about a Data Structures and Algorithms course including the course code, credits, contact hours, topics to be covered, assessments, resources and policies. The document details the course structure, schedule, learning outcomes and assessments across 14 weeks covering fundamental data structures, algorithms and their analysis.

Uploaded by

Ezekiel Ignatius
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views11 pages

Lecture 0 - About This Course

This course outline provides information about a Data Structures and Algorithms course including the course code, credits, contact hours, topics to be covered, assessments, resources and policies. The document details the course structure, schedule, learning outcomes and assessments across 14 weeks covering fundamental data structures, algorithms and their analysis.

Uploaded by

Ezekiel Ignatius
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

COS3711 Data Structures and Algorithms

Course Outline

University of Namibia, 2023


About Me

Prof. Kauna Mufeti


(Prefers to be addresses as Mee Kauna)
Department of Computing, Mathematical and Statistical sciences
University of Namibia Main Campus
Office E210
Email: tndakunda@unam.na
Tel: +264 61 2063348
Course Information

COURSE CODE: COS3711

COURSE TITLE: Data Structures and Algorithms

CONTACT HOURS: 4 hours of teaching (total 52 hours)

Tuesday 14:30 | Wednesday 16:30 | Thursday 15:30 |Friday 15:30

Practical: 3 hours (total 39 hours)

Monday 14H30 – 17H30 | THIRD YEAR LAB

Self-directed learning hours, including assessment:69 hours

NQF LEVEL: 7

NQF CREDITS: 16

PRE-REQUISITES: COS3612 Object Oriented Programming II


About this Course

• concepts to design, implement and analyze data structures and algorithms


• practical of use of data structures and algorithms in everyday applications
• demonstrates:
• theory of common data structures and algorithms
• practical implementation using the Java programming language
• typical use cases of data structures
• algorithmic design techniques
• analysis of performance
• scaling implementation in large implementation projects
• comparison of different algorithms
Learning Outcomes

After completing this course, you should be able to:

• Implement basic data structures

• Use basic sorting and searching algorithms

• Determine an appropriate algorithmic approach to a problem

• Explain the differences in the time complexities of different


algorithms

• Discuss the runtime and memory efficiency of principal algorithms

• Solve problems using fundamental graph algorithms

• Determine the appropriate strategy to use (e.g brute-force, greedy,


divide-and-conquer) to find an appropriate solution to a problem

• Evaluate possible algorithmic solutions to a problem and provide


justification for selecting specific algorithms in a particular context
Course Resources

PRESCRIBED BOOKS:
Robert Lafore. 2003. Data Structures and Algorithms in Java (2 ed.) SAMS
Publishing, (ISBN 9780672324536).

RECOMMENDED READING:
• Robert Sedgewick & Kevin Wayne (2011). Algorithms, 4th Edition. Addison-
Wesley. ISBN 978-0-321-57351-3

• Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson.


2001. Introduction to Algorithms (2nd ed.). McGraw-Hill Higher Education.
Course Topics

Common Data
Sorting and
Review of object- Structures (Arrays,
Algorithm Analysis Searching Linked Lists
oriented framework Lists, Stacks and
Algorithms
Queues)

Binary and other


Advanced Sorting trees (Red black Priority Queues
Recursion Hash functions
Algorithms trees, 2-3-4Trees and (Heaps)
External Storage)

Graphs and Graph Hard and Intractable Algorithmic Design


Algorithms Problems Methods
Course Schedule
Week Dates Topics Readings Assessment
1 15 Feb- 17 Feb Review of OOP Chapters 1
2 20 Feb – 24 Feb Array Data Structure Chapter 2
Algorithm Analysis
3 27 Feb – 03 March Basic Sorting Algorithms Chapter 3 Assignment 1
4 06 Mar – 10 March Stacks and Queues Chapter 4 Test 1
5 13 Mar – 17 March Linked Lists Chapter 5
6 20 Mar – 24 March Recursion Chapter 6
7 27 Mar – 31 Apr Advanced Sorting Chapter 7 Test 2
8 03 Apr – 07 Apr Trees Chapter 8,9
9 10 Apr – 14 April Trees Chapter 9, 10 Assignment 2
10 17 Apr – 21 April Maps, Hash Tables, Skip Lists Chapters 11 Test 3
11 24 Apr – 28 Apr Heaps Chapter 12
12 01 May – 05 May Graphs Chapter 14 Assignment 3
13 08 May – 12 May Graphs Chapter 14 Test 4
14 15 May - 17 May Graphs, Design Methods Assignment 4
Assessment Activities

• Continuous Assessment: 50%

• 2 class tests 75%

• Lab work 20%

• Attendance 5%

• Exams: 50%
Academic Dishonesty

• To protect UNAM’s reputation, plagiarism policy will


be enforced
• Plagiarism policy does not condone any form of
academic dishonesty
• Ensure you do your own assignments and produce
your own academic work
• UNAM’s Plagiarism policy available on the website
Lecture Attendance - Rule 7.14 of UNAM’s General Rules and Regulations

Course Completion Minimum 80% lecture attendance


Requirements
Minimum of 40% continuous assessment

Minimum mark 40% exam mark

Total mark 50 % to pass

Total mark 45% to qualify for supplementary

If there are problems/issues:


• complete the necessary application form
• supply the necessary documentation in advance
• ensure you have necessary approvals beforehand

It is your responsibility, not your lecturer’s, to make up for missed classes, tests and assignments.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy