Scribd
Upload
109 views2 pages

DSA

This document outlines a course on data structures and algorithms that will cover topics such as linked lists, stacks, queues, trees, graphs, sorting, and hashing. The course is 3 credit hours and will include assignments, quizzes, a midterm exam, final exam, and potential project. Grading will be based on homework, class participation, quizzes, midterm, and final exam.

Uploaded by

Islamic Teacher
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
109 views2 pages

DSA

This document outlines a course on data structures and algorithms that will cover topics such as linked lists, stacks, queues, trees, graphs, sorting, and hashing. The course is 3 credit hours and will include assignments, quizzes, a midterm exam, final exam, and potential project. Grading will be based on homework, class participation, quizzes, midterm, and final exam.

Uploaded by

Islamic Teacher
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/ 2

Course Outline

Data Structures & Algorithms (3 credit hours)


Spring 2008

Schedule TBA (to be announced) Website -

Instructor Abdul Mateen Contact amateen@pucit.edu.pk

Office Faculty Room Office TBA


Hours

Teaching -- Contact --
Assistant

Office -- Office --
Hours

Course .
Description

Textbooks Text • Data Structures & Algorithms in JAVA BY Drozdek

Reference • Classic Data Structures by D. Samanta


• Data Structures Algorithms & Application in JAVA BY Sartaj Sahni
• Data Structures & Algorithms by Mark Allen Wiess

Assignments • 3-5 Assignments are Quizzes • Can be unannounced so ready for quiz
expected in every lecture
• All Assignments are • 5-10 quizzes are expected
Individual • No make-ups will be offered for missed
• No late submission without quizzes
penalty • Selection of best quizzes is teachers
• Teacher can offer late choice
submission with penalty

Midterms A single 90-minute midterm Final Will cover the whole course and will be of 2
exam that will cover all material hour duration
covered during the first 16
lectures

Project Small Project/Term Paper

Attendance Students missing more than 20% of the lectures will receive an “F” grade in the course.
Policy

Grading • Homework+Class Participation 10%


Policy • Quizzes: 15%
• Midterm: 35%
• Final: 40%
Lectures Plan

Week Topics Reference

1-2 Introduction to course + Revision of OOP and programming concepts

3 Complexity Analysis 2.1, 2.6-8

4 Linked Lists: Definition, Single linked list 3.1

Linked Lists: Header linked list, Circular linked list, Double linked list
5-6 3.2-3
Application of Linked Lists

7 Stacks 4.1

8 Queues & Recursion 4.2-3, 5

MID-TERM

Trees: Terminologies, Definition & concepts


9-10 6.1-2
Representation of Binary tree, Operations on binary trees

11 Binary Search Tree 6.3, 6.5-6

Height Balanced Trees: AVL 6.7.2


12-13
Heaps 6.9
Graphs: Introduction, terminologies, representation, operations 8.1-2
14-15
Shortest path problem, Minimum spanning trees 8.3, 8.5

Sorting Techniques 9.1,9.3


15-16
Hashing 10.1-2

FINAL

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