Scribd
Upload
3 views4 pages

Dse 314 Data Structures and Algorithms Courseoutline

The document outlines the unit DSE 314: Data Structures and Algorithms, detailing its objectives, expected learning outcomes, course syllabus, teaching methodologies, assessment criteria, and reference materials. Students will learn about various data structures such as arrays, linked lists, stacks, queues, and graphs, as well as sorting and searching algorithms. The assessment includes assignments, class tests, and a final examination, with a requirement of over 80% class attendance.

Uploaded by

cossykin19
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
3 views4 pages

Dse 314 Data Structures and Algorithms Courseoutline

The document outlines the unit DSE 314: Data Structures and Algorithms, detailing its objectives, expected learning outcomes, course syllabus, teaching methodologies, assessment criteria, and reference materials. Students will learn about various data structures such as arrays, linked lists, stacks, queues, and graphs, as well as sorting and searching algorithms. The assessment includes assignments, class tests, and a final examination, with a requirement of over 80% class attendance.

Uploaded by

cossykin19
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/ 4

F-7-16

Unit Code: DSE 314


Unit Title: DATA STRUCTURES AND ALGORITHMS
Program(s): DSE
Lecturer Name: Godfrey Karugu
Lecturer Email: godfrey.karugu @zetech.ac.ke
Contacts: Phone.: 0721 574 328
Consultation Wednesday
time:

UNIT DESCRIPTION/ OBJECTIVES OF THE UNIT

The course introduces the basic data structures arrays, records, strings,
linked lists, stacks, and queues BTrees, graphs, Searching & Sort techniques
and the algorithms for manipulating the data structures including analysis
of BIG o notations.

EXPECTED LEARNING OUTCOMES


By the end of this unit, the student should be able to:

i. Describe types of data structures


ii. Use primitive and built-in data structures.
iii. Apply techniques of algorithm analysis of data structures
iv. Write programs that use each of the following data structures: arrays,
linked lists, stacks, and queues.
COURSE SYLLABUS AND SCHEDULE

Week Topics Details


1 Introduction Meaning of data structures, types of data
to Data structures - linear and non-linear
Structures
2 Array Data Definition of array, advantages and disadvantages,
Structure operations on array, sorting methods, bubble sort
3 Sorting Selection sort, merge sort, quick sort
Algorithms
4 Searching Searching methods, linear/sequential search,
Algorithms binary search
5 Stack Meaning of stack, stack operations – pop and
push, application of stack in conversion of infix
notation to postfix notation, conversion of decimal
number to binary
ASSIGNMENT 1(WEEK 5)

6& Linked List Meaning of linked list, types of linked list, linked list
7 operations

CAT 1 (WEEK 7)
8 Queues Definition of queue, application of queue, types of
queue
9 Queue Queue operation, enqueue, dequeue
Operations
ASSIGNMENT 2(WEEK 9)
10 Graphs Definition of graph, application of graphs, graph
traversals, BFS
11 Graph Graph degrees, DFS, graph web application
Degrees and
DFS
12 Emerging Trends and challenges in data structures
Trends in
Data
Structures
CAT 2(WEEK 12)
13 & Revision
14
15 & Final examinations
16
TEACHING/LEARNING METHODOLOGY
Discussions, presentations, assignments, case studies, essays, critical
thinking, problem solving activities and class exercises, lectures, practical.

INSTRUCTIONAL MATERIALS
Overhead Projector, Computers, Compilers Handouts, smart boards Text
books, white board marker, LMS, IDEs

ASSESSMENT CRITERIA
The student must have attended more than 80% of the total classes

Assessment Type Frequen Percentag


cy e
Assignment 2 10%
CATs 2 30%
Final Examination 1 60%
Total 100%

REFERENCE TEXTBOOKS

Core Reading Materials for the Course


1. Storer, J.A. (2018), An Introduction to Data Structures and Algorithms.
Springer ISBN: 978-0-8176-4253-2
2. Thomas H. Cormen, et al (2017) Introduction to Algorithms, 2nd Ed.,
The MIT Press
3. by Pai, Coimbatore (2018) Data structures and algorithms: concepts,
techniques and applications

Recommended Reference Materials


1. Michael T. Goodrich (2016) Data structures and algorithms in Java.
Roberto Tamassia

E-Resources
1. International Journal of Data Structures and Algorithms.
2. ScienceDirect Journal
3. Research Gate Journal
Approval for circulation by:

Unit Lecturer Name: Godfrey Karugu Signature:

HOD Name: David Kanyi signature:

Head of ICT and Engineering Department

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