School of Computing prospectus 2012 - Walter Sisulu University

Content /
Syllabus
Theory: Introduction to Computer Networks, Historical Overview,
Communications Technology; Messages &switching : messages & packets, store
& forward, circuit switching, multiplexing; Layered network architecture: Over
view of layered model – OSI Model: Physical layer, Data link layer, Network layer,
Transport layer, Resources Access, Session layer, Presentation layer, Application
layer; Computer-networks (revisited); Recent Development in communication
technology Computer Communications Architectures, LAN Systems, Internetwork
Protocols, Inter-network Operation, Transport Protocols, Network
Security, Distributed Applications
Practicals: Consist of 14 tutorials chosen from each section of content covered.
Entry Rules Pre-requisites: CSI1101, CSI1102, CSI1201and CSI1202, MAT1101, CSI1102,
CSI1203 and MAT1201 or APM1101, APM1201
Assessment
and progression
rules
Data Structures
Continuous Assessment (CA) (Compulsory): The contribution of CA to the
overall assessment (OA) is 60%.
Examination (Compulsory): One examination (EA). The contribution of the
examination (EA) to the overall assessment (OA) is 40%.
Re-examination (Not compulsory):
Module Code Module Name NQF Level Credits Semester
CSI 2202 DATA STRUCTURES 6 14 1
Lectures per week Practicals per week Tutorials
per week
21
Number
of weeks
1 x 2 hr 1 x 2 hr 14 140
Notional
hours
Content / Syllabus Theory: Introduction to Data Structures, and Abstract Data Types. Overview,
Arrays, declaration, limitations of arrays. Overview, Strings Manipulation,
Multidimensional arrays, applications, Analysis and Design of Algorithms.
Complexity functions. The big-O notation. Sorting & Searching Algorithms,
Pointers & Dynamic Structures, Linked-Lists: Singly-linked lists, Doubly-linked
lists, Circular linked lists, Ordered lists, Stacks – Definitions & declaration, Stack
operations, Stacks implemented as linked lists, Application; Queues – Definition
and Declaration, Implementation, Queue operations, Queues implemented
as linked Lists, Priority Queues, Application; Trees – Definition & Declaration,
Recursive algorithms, Implementation, Binary trees, Binary Search trees,
Binary tree traversal, Application. Templates, Implementing Generic Data Type.
Practicals: Consist of 14 practicals chosen from each section of content covered.
Entry Rules Pre-requisites: CSI1101, CSI1102, CSI1201and CSI1202, MAT1101, CSI1102,
CSI1203 and MAT1201 or APM1101, APM1201
Assessment
and progression
rules
Continuous Assessment (CA) (Compulsory): The contribution of CA to the
overall assessment (OA) is 60%.
Examination (Compulsory): One examination (EA). The contribution of the
examination (EA) to the overall assessment (OA) is 40%.
Re-examination (Not compulsory):
2012
PROSPECTUS