CSE 225 - Data Structures and Algorithms [Section 4]
General Information
Course Overview : Outline
Faculty Information
Md. Mahfuzur Rahman, Email: mahfuzur.rahman05@northsouth.edu
Office Location : SAC 1044A Office Hours : S: 11:45 - 12:45; M: 10:15 - 11:15 and 3:00 - 7:00; T: 11:45 - 12:45; W: 10:15 - 11:15; TA Information
Kalyan Roy, Email: kalyan.roy@northsouth.edu,
Office Location: Cyber center Archive, Level 3, Central Library
Office Hours: Monday, Wednesday : 1:00 PM - 4:10 PM Tuesday : 2:40 PM - 5:50 PM Assignments
Assignment 1 [ Players ] Lecture Notes
Software Development Basics Unit 1-A [ Slides / Notes / E1 ] Unit 1-B [ Slides / Notes / E2 ] List Data Structure Unit 2-A [ Slides / Notes / E3 ] Unit 2-B [ Slides / Notes / E4 ] Stack and Queue Structure Unit 3-A [ Slides / Notes ] Tree Structure Unit 4-A [ Slides / Notes ] Unit 5-A [ Slides / Notes ] Graph Structure Unit 6-A [ Slides / Notes / E6 ] Sorting Algorithms Unit 7-A [ Slides / Notes / E7 ]
Source Codes
Unit 2 - Lists Implementation Codes Unit 2 - Unsorted and Sorted List Implementation Example Unit 3 - Stack and Queue Implementation Codes Unit 3 - Stack and Queue Implementation Example
Sample Questions
MidExam
Final Exam
Theory & Code : - Stack (Array, Linked List), Queue (Array, Linked List)
Theory & Example :- Tree, Graph, Sorting Algorithms (Bubble, Insertion, Selection, Heapsort, RadixSort)
Special Questions
Marks Improvement - Submission Deadline (April 21, 2019)
General Information
Course Overview : Outline
Faculty Information
Md. Mahfuzur Rahman, Email: mahfuzur.rahman05@northsouth.edu
Office Location : SAC 1044A Office Hours : S: 11:45 - 12:45; M: 10:15 - 11:15 and 3:00 - 7:00; T: 11:45 - 12:45; W: 10:15 - 11:15; TA Information
Kalyan Roy, Email: kalyan.roy@northsouth.edu,
Office Location: Cyber center Archive, Level 3, Central Library
Office Hours: Monday, Wednesday : 1:00 PM - 4:10 PM Tuesday : 2:40 PM - 5:50 PM Assignments
Assignment 1 [ Players ] Lecture Notes
Software Development Basics Unit 1-A [ Slides / Notes / E1 ] Unit 1-B [ Slides / Notes / E2 ] List Data Structure Unit 2-A [ Slides / Notes / E3 ] Unit 2-B [ Slides / Notes / E4 ] Stack and Queue Structure Unit 3-A [ Slides / Notes ] Tree Structure Unit 4-A [ Slides / Notes ] Unit 5-A [ Slides / Notes ] Graph Structure Unit 6-A [ Slides / Notes / E6 ] Sorting Algorithms Unit 7-A [ Slides / Notes / E7 ]
Source Codes
Unit 2 - Lists Implementation Codes Unit 2 - Unsorted and Sorted List Implementation Example Unit 3 - Stack and Queue Implementation Codes Unit 3 - Stack and Queue Implementation Example
Sample Questions
MidExam
Final Exam
Theory & Code : - Stack (Array, Linked List), Queue (Array, Linked List)
Theory & Example :- Tree, Graph, Sorting Algorithms (Bubble, Insertion, Selection, Heapsort, RadixSort)
Special Questions
Marks Improvement - Submission Deadline (April 21, 2019)