Data Structures and Algorithm

#C++#data structures#algorithms

CSE225: Data Structures and Algorithms


This course is about an introduction to the theory and practice of data structuring techniques. Topics include internal data representation, abstract data types (ADT), stacks, queues, list structures, recursive data structures, trees, regraphs and networks. Concept of object orientation as a data abstraction technique will be introduced.

Course Objectives: The objectives of this course are

  • introduce the basic data structures for storage and retrieval of ordered or unordered data using arrays, linked lists, binary trees, heaps, graphs and hash tables.
  • develop the concept of asymptotic analysis using Big-O techniques to compare different algorithmic solutions.
  • introduce tools to implement relevant data structures

This course also has a corresponding non-credit lab session. Lab Coursework includes implementing algorithms and theoretical concepts with respective programming languages as deemed necessary by the course curriculum.


Course Outcomes: Upon Successful completion of this course, students will be able to:

  • CO1 : Explain fundamental Data Structures including arrays, linked lists, trees, binary search trees, stacks, queues, heaps, priority queues, graphs, and hash tables.
  • CO2 : Identify appropriate data structures for solving complex problems
  • CO3 : Use programming tools for the implementation of abstract data types (ADT)

Informations

  • Credit Hours : 03
  • Type: Core
  • Prerequisites: CSE215 Programming Language II
  • Faculty Name: Muhammad Shafayat Oshman (MUO)
  • Office Room: SAC1181
  • Consultation Hours: STW 4:15 PM - 6:00 PM
  • Email: muhammad.oshman@northsouth.edu
  • Lectures - 3 Hours/week
  • Class timing of Theory:
    • Section 3 - MW 1:00 PM - 2:30 PM - SAC209
    • Section 4 - MW 2:30 PM - 4:10 PM - SAC209
  • Class timings of Lab:
    • Section 3 - MW 8:00 AM - 9:30 AM - LIB603
    • Section 4 - MW 9:40 AM - 11:10 PM - LIB603
  • Teaching Assistant: TBA
    • Email: TBA
    • Consultation Hours: TBA
    • Office Room: TBA
  • Lab Instructor: TBA
    • Email: TBA
    • Consultation Hours: TBA
    • Office Room: TBA

Resources

Text Books :

  • C++ Plus Data Structures by Nell Dale

Course Slides :

Any and all course materials and announcements will be posted in Canvas.


Topics (not limited to)

  • Abstract data type and data structures
  • Software design principles
  • Growth rate of algorithms
  • Dynamic memory allocation
  • List-based data structures
  • Recursion
  • Binary search tree
  • Heaps and priority queues
  • Graph based data structures
  • Sorting algorithms

Marking Scheme (Theory)

Assessment ToolsWeightage (%)
Assignments (Written + Viva)10
Quiz15
Mid-term25
Lab20
Final30
100

Marking Scheme (Lab)

Assessment ToolsWeightage (%)
Lab Tasks40
Mid-term15
Final25
Project (Code Implementation + Report)20
100

Grading policy

As per NSU grading policy available in http://www.northsouth.edu/academic/grading-policy.html


Course Policies

  • Be good and follow university policies. Any breach of university policies will be reported to the Department, Proctor Office and University Syndicate for further actions. Any additional directions will be updated as we proceed through the course.
  • Plagiarism is strictly prohibited. Plagiarism can be defined as "presenting someone else's work or ideas as your own, with or without their consent, by incorporating it into your work without full acknowledgement." First offense of plagiarism will result in losing the entire marks of the assignment/exam where plagiarism is detected. Second offense will result in awarding the student an F grade for the entire course.
  • Attendance is not mandatory, hence you may choose to skip classes if you wish to. However, if you do decide to come to the class, please make sure you are adhering to class etiquettes: do not talk to anyone except the instructor, eat or drink or use any device such as mobile or laptops. In case of emergency, please ask permission from the instructor before leaving the classroom.
  • Assignments won't be accepted after deadline.
  • No make-up quiz, mid or final will be held except for valid medical reasons, in which case the student must present medical documents as proof.
  • Sharing assignment or quiz specifications or posting them online (to sites like Chegg, CourseHero etc.) is considered academic misconduct. You are never permitted to post, share, or upload course materials without explicit permission from your instructor.
  • If you are ever in doubt about anything, consult with instructor.
Junior Design Project Programming Language II
Shafayat Oshman

Shafayat Oshman

Lecturer

My research interests are Computer Networks, Data Communications, Computer and Cloud Security.

Social Links
Home Courses