Scribd Logo
Upload

Welcome to Scribd!

  • 38 views

    CSC 212 Course Compact

    Uploaded by

    Molly Brandon
    This document provides details about the "Fundamentals of Data Structures" course offered at the Faculty of Science. The 3-unit course covers topics like arrays, stacks, queues, trees and their implementations. The course objectives are for students to understand various linear and non-linear data structures and apply them to solve real-world problems. Assessment includes assignments, tests and a final exam. Lectures use interactive sessions and multimedia, and students complete individual and group projects.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CSC 212 Course Compact

    Uploaded by

    Molly Brandon
    38 views5 pages
    This document provides details about the "Fundamentals of Data Structures" course offered at the Faculty of Science. The 3-unit course covers topics like arrays, stacks, queues, trees and their implementations. The course objectives are for students to understand various linear and non-linear data structures and apply them to solve real-world problems. Assessment includes assignments, tests and a final exam. Lectures use interactive sessions and multimedia, and students complete individual and group projects.

    Original Title

    CSC 212 COURSE COMPACT

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides details about the "Fundamentals of Data Structures" course offered at the Faculty of Science. The 3-unit course covers topics like arrays, stacks, queues, trees and their implementations. The course objectives are for students to understand various linear and non-linear data structures and apply them to solve real-world problems. Assessment includes assignments, tests and a final exam. Lectures use interactive sessions and multimedia, and students complete individual and group projects.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    38 views5 pages

    CSC 212 Course Compact

    Uploaded by

    Molly Brandon
    This document provides details about the "Fundamentals of Data Structures" course offered at the Faculty of Science. The 3-unit course covers topics like arrays, stacks, queues, trees and their implementations. The course objectives are for students to understand various linear and non-linear data structures and apply them to solve real-world problems. Assessment includes assignments, tests and a final exam. Lectures use interactive sessions and multimedia, and students complete individual and group projects.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 5

    COURSE COMPACT

    Faculty: Faculty of Science


    Department: Computer & Information Sciences
    Programme: B.Sc Computer Science
    Course Code: CSC 212
    Course Title: Fundamentals of Data Structures
    Units: 3
    Course Lecturer: Miss Azeez Titilayo
    Semester/Session: First
    Session: 2020/2021
    Location: Lecture Room 3

    A. Brief Overview of Course


    Primitive types, Arrays, Records Strings and String processing, Data representation in
    memory, Stack and Heap allocation, Queues, TREES. Implementation Strategies for stack,
    queues, trees. Run time Storage management; Pointers and References, linked structures.
    Hereby, solving problems using data structures such as linear lists, stacks, queues, trees, heaps,
    trees, binary search trees, and graphs and writing programs for these solutions. Hence,
    developing proficiency in the specification, representation, and implementation of Data Types
    and Data Structures.

    B. Course Objectives/Goals
    At the end of this course, students should be able:
     Know the concept of data structure, explain various data types and discuss various
    data structures and its operations.
     Have a good understanding of Linear and Non-Linear Data Structures.
     Have a good understanding of algorithm formulation and application while
    solving real life problems.
     Understand the application of Linear and Non-Linear data.
     Understand the data structure that suits a defined problem.
     Know how to write programs implementing Linear and Non-Linear Data
    Structures.

    C. Methods of Lecture Delivery/Teaching Aids


     Lecture Delivery Methods
    o Interactive classroom session
    o Individual assignments
    o Lecture notes

    1
     Teaching Aids
    o Multimedia projection
    o Computer Laboratory

    D. Course Outlines

     Modules & Details of Topics

    Module I: Introduction and Overview of Data Structure

    Week 1: Introduction & Overview: Concept of data type, definition and brief description

    of various data structures.

    Week 2: Operations on data structures.

    Module II: Linear data Structures

    Week 3 & 4: Arrays: Linear and multi-dimensional arrays and their representation.

    Continuous Assessment One (CA1)

    Week 5: Arrays: Operations on arrays, sparse matrices and their storage.

    Week 6: Linked Lists: Linear linked list, operations on linear linked list, double linked list.

    Week 7: Stacks: Sequential and linked representations, operations on stacks, multi stacks;

    Stacks: application of stacks such as parenthesis checker, evaluation of postfix expressions

    Week 8: Queues: Sequential representation of queue, linear queue, circular queue,

    operations and applications, linked representation of a queue.

    Module III: Non-Linear Data Structures

    Week 9 & 10: Introduction to Trees: Binary Tree Representation, Traversal.

    Continuous Assessment Two (CA2)

    Week 11: Seminar.

    Week 12: Revision

    E. Structure of the Programme/Method of Grading

    1
     Continuous Assessment
    o Class test/Assignments 20% Marks
    o Mid Semester test 10% Marks

     Examination 70% Marks


    TOTAL 100%

    F. Ground Rules & Regulations


    o 75% attendance is required to sit for the examination.
    o Assignments must be submitted as at when due.
    o Contributions to group discussion and class work are noted.

    G. Topics of Term Papers/Assignment/Student Activities


     Individual Project that solves real world problem through application of abstract data
    type in addition, implementing it using Python programming language.

    H. Contemporary Issues/Industry Relevance


    Data structures are needed to make high quality software. Big I.T. companies like Amazon,
    Microsoft, Google recruit people with data structure knowledge for writing efficient
    programs. These product-based companies placed so much emphasis on data structure as
    they are hallmark for any good software developer. This course assist students in
    demonstrating problem solving skills, analytical skills; which are useful to pick out the
    underlying algorithm in real-world problems and solve them efficiently, and software
    developer skills that remain the same no matter the technology used; that put the focus on
    the problem rather than the technology. However, the knowledge gained in this course
    makes the students fit into any working area hereby; demonstrating all the required skills
    learnt during from the course.
    Therefore, this course is supposed to stimulate the interest of students and lay a compact
    foundation for fundamentals of data structures. Students will be given programming
    assignments across the numerous areas of the economy.

    I. Recommended Reading/Texts
    a. Sartaj Sahni, 1976, Fundamentals of data structures, Computer Science Press
    b. Samir Kumar Bandyopadhyay, 2009, Data Structures Using C, Pearson Education India
    c. Karthikeyan, Fundamentals Data Structures And Problem Solving, PHI Learning Pvt.
    Ltd
    d. Davidson, 2004, Data Structures (Principles And Fundamentals), Dreamtech

    Online Materials
    Data Structure
     http://www.roseindia.net/tutorial/datastructure

     http://www.cprograms.in/

     http://www.lix.polytechnique.fr/~liberti/public/computing/prog/c/C/

    1
    CONCEPT/data_types.html
     http://www.asic-world.com/scripting/data_types_c.html
    Arrray

     http://rajkishor09.hubpages.com/hub/Array-in-C-programming— Programmers-view

     http://www.eskimo.com/~scs/cclass/int/sx9.html

     http://www.eng.iastate.edu/efmd/cmultarray.html

     http://www.stanford.edu/~fringer/teaching/operating_systems_03/ handouts/lecture9.pdf

     http://www.cs.cornell.edu/courses/CS2022/2011sp/lectures/lect04.pdf

     http://euklid.mi.uni-koeln.de/c/mirror/mickey.lcsc.edu/%257Esteve/ c9.html

     http://www.cprogramming.com/tutorial/c/lesson6.html

    Linked List

     http://programmingexamples.wikidot.com/c-linked-lists

     http://123techguide.blogspot.in/2012/02/create-linked-list-inc.

     http://www.martinbroadhurst.com/articles/circular-linked-list.html

     http://www.c.happycodings.com/Data_Structures/code7.html

    Stack

     http://www.wiziq.com/tutorial/13556-STACKS-IN-DATA-STRUCTURE

     http://www.zentut.com/c-tutorial/c-stack-using-array/

     http://www.cmpe.boun.edu.tr/~akin/cmpe223/chap2.htm

     http://groups.csail.mit.edu/graphics/classes/6.837/F04/cpp_notes/ stack1.html

     http://www.thelearningpoint.net/computer-science/data-structuresqueues— with-c-
    program-source-code

     http://www.cs.ucf.edu/courses/cop3502/spr07/730/implementation.pdf

     http://jpkc.seiee.sjtu.edu.cn/ds/ds2/Course%20lecture/chapter%203.pdf\

    1
    Queues

     http://www.cs.cmu.edu/~wlovas/15122-r11/lectures/09-queues.pdf

     http://ideainfo.8m.com/

    Trees

     http://claymore.engineer.gvsu.edu/~jackh/books/analysis/pdf/trees.pdf

     http://www.cs.auckland.ac.nz/~jmor159/PLDS210/trees.html

     http://www.i-programmer.info/babbages-bag/477-trees.html

    You might also like