Mastering Data Structures with CSC 301 Course Overview
Dive into the world of data structures with CSC 301 course, where students learn fundamental concepts, algorithms, and applications. Explore grading policies, student learning outcomes, and course resources to excel in software design and algorithm analysis.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Course Preliminaries Course Objectives Students Learning Outcomes Grading Policy Course Resources Course Outline CSC 301: Data Structures 0.1
Course Objectives The objectives of this course are to: Introduce students to fundamental data structures; their algorithms, implementations and applications. Teach students how to analyze the efficiency of the fundamental data structures in terms of both time and space so that they are able to decide what data structure is suitable for a given problem. CSC 301: Data Structures 0.2
Students Learning Outcomes After completion of this course, the student shall be able to: Apply object oriented concepts (inheritance, polymorphism, design patterns, etc.) in software design. Implement various data structures and their algorithms, and apply them in implementing simple applications. To analyze simple algorithms and determine their efficiency using big-O notation. To apply the knowledge of data structures to other application domains like data compression and memory management. CSC 301: Data Structures 0.3
Grading Policy Grading is based on the standard University guidelines: 40% CA, 60% Exams The CA scores will be earned through A written test Several programming assignments Additional marks can be earned through dedication and quality work! CSC 301: Data Structures 0.4
Course Resources Reference Textbooks: Data Structures and Algorithms in Java , 2nd Edition, Adam Drozdek, Thomson Learning, ISBN 0-534- 49252-5. Data Structures and Algorithms with Object Oriented Design Patterns in Java , Bruno R. Preiss, John Wiley & Sons, Inc., 2000. Electronic Copy also available PowerPoint Slides These textbooks are available in the departmental library CSC 301: Data Structures 0.5
Course Outline Topics of Coverage Number of Lectures Lecture Slides & Text Book References 2 Review & Introduction to Design Patterns Lectures 1-2, Preiss Chapter 5 2 Introduction to Algorithm Analysis Lectures 3-4, Preiss Chapter 3, Drozdek Chapter 2 2 Review of Linked Lists Lectures 5-6, Preiss Chapter 4, Drozdek Chapter 3 2 Review of Stacks & Queues Lectures 7-8, Preiss Chapter 6, Drozdek Chapter 4 4 Recursion and Recursive Algorithms Lectures 9-12, Slides, Drozdek Chapter 5 CSC 301: Data Structures 0.6
Course Outline Topics of Coverage Number of Lectures 8 Lecture Slides & Text Book References Lectures 13-20, Preiss Chapter 9, Drozdek Chapter 6 and 7, Heap Sort (Drozdek pg 484) Lectures 21-27, Preiss Chapter 16, Drozdek Chapter 8 Lectures 287-30, Preiss Chapter 8 Lectures 310-32, Slides, Drozdek Chapter 10 Lectures 33-34, Preiss Chapter 13, Drozdek Chapter 12 Tree Structures and their Applications 7 Graphs and Graph Algorithms 3 Hashing Techniques 2 Data Compression 2 Memory Management & Garbage Collection CSC 301: Data Structures 0.7
