Data Structure and Lab

Section outline

• Select section Welcome to Data Structures

  Welcome to Data Structures

  Collapse all Expand all

  
  

  
  

   Welcome Video for my beloved students- Click here

  
  

  Instructor : Md Assaduzzaman Office : 505, AB-4, CSE Building. Office Hour   : Saturday(9.00 am - 2.00 pm), or by  appointment Telephone : 01824089009 Email              : assaduzzaman.cse@diu.edu.bd Appointment in Google Calendar: Click Here	Welcome Information on Data Structures Course Welcome Audio Listen to Course Objectives Listen to Expected Outcomes Listen to Course Delivery Plan Some Successful Projects Student Interests Survey Online C Compiler for Data Structures Lab

  Course Rationale
  

  This course investigates abstract data types (ADTs), recursion, algorithms for searching and sorting, and basic algorithm analysis. ADTs to be covered include lists, stacks, queues, priority queues, trees, sets, and graphs. The emphasis is on the trade-offs associated with implementing alternative data structures for these ADTs.

  Course Objectives

  • To introduce the fundamental concept of data structures including link-list
  • To emphasize the importance of data structures in implementing the algorithms
  • To develop effective skills in the implementation of data structure

  
  Course Outcomes (CO’s)

  • CO1 Able to explain implementation and operations of basic data structures: Linked list, stack, queue, tree and graph
  • CO2 Able to apply programming techniques using pointers, dynamic memory allocation and structures to implement data structures: stack, queue, tree and graph
  • CO3 Able to design and implement new abstract data using linked list, stack, queue, tree and graph with the help of programming implementations
  • CO4 Able to apply the knowledge of data structure in problem solving

  • Student Interest Survey
    

  
  

  Grading Scheme

  Theory Class	Lab Class
  Attendance: 7% Class Tests/Quizes:  15%  Assignment: 5% Presentation (using video/ppt): 8% Midterm Exam: 25% Final Exam: 40%	Lab Attendance: 10% Problem Solving: 40% Lab Performance Test: 25% Lab Report: 25%

  [All assessment will be based on onsite/online situation]
  

  Textbook
  

  a. Data Structures and Algorithm Analysis in C by Mark Allen Weiss
  b. Principles of Data Structures by Pande

  Reference Books/Materials
  

  • Google drive repository
  • Other online resources

  • Select activity Announcements

    

    Announcements Forum
  • Select activity FAQ & Announcements

    

    FAQ & Announcements Forum
  • Select activity Data Structure Simulation 

    Completion

    Students must

    

    Mark as done

    Data Structure Simulation 

    
    

  • Select activity Course Outline 

    Completion

    Students must

    

    Mark as done

    Course Outline 

  • Select activity Class discussion material 

    Completion

    Students must

    

    Mark as done

    Class discussion material 

  • Select activity Telegram group Link:CSE134(PC-E)CSE134(PC-F)CSE134...

    Completion

    Students must

    

    Mark as done

    Telegram group Link:

    CSE134(PC-E)

    CSE134(PC-F)

    CSE134+CSE135(PC-J)

  • Select activity Resources

    

    Resources File

    Completion

    Students must

    

    Mark as done
  • Select activity Google meet link: Click here

    Google meet link: Click here

    Not available unless: You belong to DS-(PC-E)
  • Select activity Google meet link: Click here

    Google meet link: Click here

    Not available unless: You belong to DS-(PC-F)
  • Select activity Google meet link: Click here

    Google meet link: Click here

    Not available unless: You belong to DS-(PC-J)
• Select section Week 1: Preparing Background

  Week 1: Preparing Background

  • Topics of discussion

  1. Introduction and importance of Data Structure in computing; Applications
  2. Review discussion on recursion, pointer, structure, self-referential structure; dynamic memory allocation

  • Expected Learning Outcome

  1. Appreciate the needs of data structure
  2. Visualize the applications
  3. Perform exercise on basic self-referential structure

  • Self-Test and Additional Problem Solving

  • Select activity Why data structure?

    Completion

    Students must

    

    Mark as done

    Why data structure?

  • Select activity Discussion on Dynamic Memory and Self-Referential ...

    Completion

    Students must

    

    Mark as done

    Discussion on Dynamic Memory and Self-Referential Structure

  • Select activity Self-referential Structure and Pointer

    Completion

    Students must

    

    Mark as done

    Self-referential Structure and Pointer

  • Select activity Lab Session 1: Working with self-referential struc...

    Lab Session 1: Working with self-referential structure and dynamic memory

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Video Lecture:Lecture-1 (Basic Data Structure )Lec...

    Completion

    Students must

    

    Mark as done

    Video Lecture:

    Lecture-1 (Basic Data Structure )

    Lecture -2(Dynamic memory allocation ,Structure)

    
    

  • Select activity Lab Video Lecture(PC-J):Lecture-1 (Pointer, Struct...

    Lab Video Lecture(PC-J):

    Lecture-1 (Pointer, Structure, Dynamic memory allocation )

    Lecture -2( Referential Structure) & (Recursion)

    
    

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Additional resources

    

    Additional resources File

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-F)

    

    Class Video Lecture(PC-F) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(Theory+Lab)-(PC-J)

    

    Class Video Lecture(Theory+Lab)-(PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-E)

    

    Class Video Lecture(PC-E) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion Forum on pointer, dynamic memory allocation(PC-J) (Week 1)

    

    Discussion Forum on pointer, dynamic memory allocation(PC-J) (Week 1)

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion Forum on pointer, dynamic memory allocation(PC-F)(Week 1)

    

    Discussion Forum on pointer, dynamic memory allocation(PC-F)(Week 1)

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion Forum on pointer, dynamic memory allocation(PC-E)(Week 1)

    

    Discussion Forum on pointer, dynamic memory allocation(PC-E)(Week 1)

    Completion

    Students must

    

    Mark as done
  • Select activity Lab Performance on structure(PC-J)(Week 1)

    

    Lab Performance on structure(PC-J)(Week 1) Assignment

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Interactive quiz on pointer

    

    Interactive quiz on pointer Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Students Feedback(Week-2)

    Completion

    Students must

    

    Mark as done

    Students Feedback(Week-2)

  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference Video:Click

    Completion

    Students must

    

    Mark as done

    Reference Video:

• Select section Week 2: Exercise and Course Project

  Week 2: Exercise and Course Project

  • Topics for discussion:

  1. Computational Complexity and exercises
  2. Self-referential structure application for link list
  3. Exercise on visualization of data node
  4. Course Project Team and discussion on presentation and deliverable

  • Expected Learning Outcome:

  1. Computational Complexity and exercises
  2. Self-referential structure application for link list
  3. Exercise on visualization of data node
  4. Course Project Team and discussion on presentation and deliverable

  • Select activity Typical Course Project

    Completion

    Students must

    

    Mark as done

    Typical Course Project

  • Select activity Review on self-referential structure

    Completion

    Students must

    

    Mark as done

    Review on self-referential structure

  • Select activity Analysis of Complexity

    Completion

    Students must

    

    Mark as done

    Analysis of Complexity

  • Select activity Record Project Team

    Completion

    Students must

    

    Mark as done

    Record Project Team

  • Select activity Lab Session 2: Working with self-referential struc...

    Completion

    Students must

    

    Mark as done

    Lab Session 2: Working with self-referential structure

  • Select activity Video Lecture:Lecture-3(Time Complexity)Lecture-4(...

    Completion

    Students must

    

    Mark as done

    Video Lecture:

    Lecture-3(Time Complexity)

    Lecture-4(Self Referential Structure-2)
    

  • Select activity Lab Video Lecture(PC-J):Lecture-3(Self referential...

    Lab Video Lecture(PC-J):

    Lecture-3(Self referential structure and dynamic memory allocation)

    
    

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Class Videos Lecture(Theory+Lab)-(PC-J)

    

    Class Videos Lecture(Theory+Lab)-(PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-E)

    

    Class Video Lecture(PC-E) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-F)

    

    Class Video Lecture(PC-F) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion Forum on time complexity, self referential structure (Week 2)

    

    Discussion Forum on time complexity, self referential structure (Week 2)

    Completion

    Students must

    

    Mark as done
  • Select activity Lab Performance on self referential structure(PC-J)(Week -2)

    

    Lab Performance on self referential structure(PC-J)(Week -2) Assignment

    Completion

    Students must

    

    View

    

    Make a submission

    

    Receive a grade
  • Select activity Assignment on Dynamic memory allocation(PC-E) (Week 2)

    

    Assignment on Dynamic memory allocation(PC-E) (Week 2)

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment on dynamic memory allocation(PC-F)(Week-2)

    

    Assignment on dynamic memory allocation(PC-F)(Week-2)

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment on dynamic memory allocation(PC-J)

    

    Assignment on dynamic memory allocation(PC-J)

    Completion

    Students must

    

    View

    

    Make a submission

    

    Receive a grade
  • Select activity Additional Resources

    

    Additional Resources File

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion forum week 2(Edited)

    

    Discussion forum week 2(Edited)

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on structure and time complexity

    

    Interactive quiz on structure and time complexity Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference Video:Click:

    Completion

    Students must

    

    Mark as done

    Reference Video:

• Select section Week 3: Discussion on Link-List

  Week 3: Discussion on Link-List

  Topics of discussion:

  1. Link-List and operations on link list
  2. Project Discussion and execution plan
  3. Class Test#1

  Expected Learning Outcome:

  1. Visualization of the link list
  2. Write code for the designed link list
  3. Selection of project topic by team

  • Select activity Discussion on Link-List

    Completion

    Students must

    

    Mark as done

    Discussion on Link-List

  • Select activity Lab Session 3: Working with Link-List

    Completion

    Students must

    

    Mark as done

    Lab Session 3: Working with Link-List

  • Select activity Video Lecture:Lecture-5(Linked list-Create, displa...

    Completion

    Students must

    

    Mark as done

    Video Lecture:

    Lecture-5(Linked list-Create, display)

    Lecture-6 (Linked list-first insert, last insert)
    

  • Select activity Lab Video Lecture(PC-J):Linked List(Part-1)

    Lab Video Lecture(PC-J):

    Linked List(Part-1)

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Class Video Lectures(PC-F)

    

    Class Video Lectures(PC-F) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-E)

    

    Class Video Lecture(PC-E) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class video Lecture(Theory +Lab)-(PC-J)

    

    Class video Lecture(Theory +Lab)-(PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Code: (Linked list )

    

    Code: (Linked list ) File

    Completion

    Students must

    

    Mark as done
  • Select activity Lab performance on linked list(PC-J) (Week-3)

    

    Lab performance on linked list(PC-J) (Week-3) Assignment

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Quiz-1(PC-E)

    

    Quiz-1(PC-E)

    Not available unless: You belong to DS-(PC-E)
  • Select activity Quiz-1 (PC-F)

    

    Quiz-1 (PC-F)

    Not available unless: You belong to DS-(PC-F)
  • Select activity Quiz-1 (PC-J)

    

    Quiz-1 (PC-J)

    Not available unless: You belong to DS-(PC-J)
  • Select activity Interactive quiz on Linked List-1

    

    Interactive quiz on Linked List-1 Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion forum on linked list(Week-3)

    

    Discussion forum on linked list(Week-3)

    Completion

    Students must

    

    Mark as done
  • Select activity Students Feedback(Week-3)

    Completion

    Students must

    

    Mark as done

    Students Feedback(Week-3)

  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference VideoClick 

    Completion

    Students must

    

    Mark as done

    Reference Video

• Select section Week 4: Adaptive Lesson on Link-List

  Week 4: Adaptive Lesson on Link-List

  Topics of discussion:

  1. Practice lesson on Link-List

  Expected Learning Outcome:

  1. Review of Link-List Knowledge
  2. Self-confidence building on applying the link-list concept

  • Select activity Review discussion on Link-List

    Completion

    Students must

    

    Mark as done

    Review discussion on Link-List

  • Select activity Lab Session 4: Application of Link-List

    Completion

    Students must

    

    Mark as done

    Lab Session 4: Application of Link-List

  • Select activity Video Lecture:Lecture-5(Linked list-Update,Search)...

    Completion

    Students must

    

    Mark as done

    Video Lecture:

    Lecture-5(Linked list-Update,Search)

    Lecture-6(Linked list-AnyInsert,Delete)
    

    
    

  • Select activity Lab Video Lecture(PC-J):Lecture-4(Linked list part...

    Lab Video Lecture(PC-J):

    Lecture-4(Linked list part-2)

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Class Video Lectures(PC-F)

    

    Class Video Lectures(PC-F) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lectures(PC-E)

    

    Class Video Lectures(PC-E) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-J)

    

    Class Video Lecture(PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Lab Performance on linked list(PC-J)(Week-4)

    

    Lab Performance on linked list(PC-J)(Week-4) Assignment

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Forum Discussion on linked list(Week-4)

    

    Forum Discussion on linked list(Week-4)

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on Linked list

    

    Interactive quiz on Linked list Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Student Feedback(Week-4)

    Completion

    Students must

    

    Mark as done

    Student Feedback(Week-4)

  • Select activity Reference videoClick

    Completion

    Students must

    

    Mark as done

    Reference video

• Select section Week 5: Review discussion on Link-List

  Week 5: Review discussion on Link-List

  • Topics of discussion:

  1. Review operations on Link list and applications
  2. Discussion on Stack data structure
  3. Exercise using Stack data structure

  • Expected Learning Outcome:

  1. Implement link list operations using C programming
  2. Analyzing stack data structure

  • Self-Test Questions

  • Select activity Discussion on Stack Data Structure

    Completion

    Students must

    

    Mark as done

    Discussion on Stack Data Structure

  • Select activity Lab Session 5: Working with Stack

    Completion

    Students must

    

    Mark as done

    Lab Session 5: Working with Stack

  • Select activity Video Lectures:Lecture-9(Basic of Stack,PUSH,POP)L...

    Completion

    Students must

    

    Mark as done

    Video Lectures:

    Lecture-9(Basic of Stack,PUSH,POP)

    Lecture-10(Expression,Prefix,Postfix,Infix)
    

  • Select activity Class Video Lecture(Theory+Lab)-(PC-J)

    

    Class Video Lecture(Theory+Lab)-(PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lectures(PC-E)

    

    Class Video Lectures(PC-E) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lectures(PC-F)

    

    Class Video Lectures(PC-F) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Code: Stack(Array implementation )

    

    Code: Stack(Array implementation ) File

    Completion

    Students must

    

    Mark as done
  • Select activity Additional Resources

    

    Additional Resources File

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment on stack (Week-5)

    

    Assignment on stack (Week-5)

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on Stack

    

    Interactive quiz on Stack Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Student Feedback(Week-5)

    Completion

    Students must

    

    Mark as done

    Student Feedback(Week-5)

    
    

  • Select activity Reference videoClick

    Completion

    Students must

    

    Mark as done

    Reference video

• Select section Week 6: Discussion on Stack Applications

  Week 6: Discussion on Stack Applications

  • Topics of discussion:

  1. Application of stack in processing expressions
  2. Discussion on Queue data structure
  3. Class Test# 2

  • Expected Learning Outcome:

  1. Implement processing of expression using stack   
  2. Analyze queue data structure

  • Presentation on Course Project

  • Select activity Discussion on Queue Data Structure

    Completion

    Students must

    

    Mark as done

    Discussion on Queue Data Structure

  • Select activity Lab Session 6: Working with Queue

    Completion

    Students must

    

    Mark as done

    Lab Session 6: Working with Queue

  • Select activity Pre-recorded Video Lectures:Lectures-11(Expression...

    Completion

    Students must

    

    Mark as done

    Pre-recorded Video Lectures:

    Lectures-11(Expression Conversion Using Stack,Queue)

    Lectures-12(Stack implementation using C )

  • Select activity Pre-recorded Lab video Lecture(PC-J):Lecture-6(Que...

    Pre-recorded Lab video Lecture(PC-J):

    Lecture-6(Queue implementation using array)

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Code: Queue implementation using C

    

    Code: Queue implementation using C File

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lectures(PC-J)

    

    Class Video Lectures(PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-F)

    

    Class Video Lecture(PC-F) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Class Video Lecture(PC-E)

    

    Class Video Lecture(PC-E) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Additional Resources

    

    Additional Resources File

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment on expression conversion using stack

    

    Assignment on expression conversion using stack

    Completion

    Students must

    

    Mark as done
  • Select activity Forum discussion on Queue and Expression conversion

    

    Forum discussion on Queue and Expression conversion

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on expression conversion and Queue.

    

    Interactive quiz on expression conversion and Queue. Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Student Feedback(Week-6)

    Completion

    Students must

    

    Mark as done

    Student Feedback(Week-6)
    
    

  • Select activity Quiz-2(PC-E)

    

    Quiz-2(PC-E)

    Not available unless: You belong to DS-(PC-E)
  • Select activity Quiz-2 (PC-F)

    

    Quiz-2 (PC-F)

    Not available unless: You belong to DS-(PC-F)
  • Select activity Quiz-2 (PC-J)

    

    Quiz-2 (PC-J)

    Not available unless: You belong to DS-(PC-J)
  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference Video:click

    Completion

    Students must

    

    Mark as done

    Reference Video:

• Select section Week 7: Midterm Exam

  Week 7: Midterm Exam

  
  

  • Topics for Mid Exam:

  1. Link-list and operations
  2. Stack and application of stack

  • Select activity Mid-Exam

    

    Mid-Exam Assignment

    Completion

    Students must

    

    Mark as done

    Dear students,

    You need to download (1) QuestionPaper.pdf and (2) AnswerScriptTemplate.doc from the Mid-exam. You will type your answers in the answer script doc file and save as pdf with your ID e.g. CSE134-PC-E-171-15-2345-mid.pdf (Course Code-Section-Student ID) and then upload in the following google form link:  https://forms.gle/2uu9eMeJcxGC79KA8

    
    

• Select section Week 8: Discussion on Tree Data Structure

  Week 8: Discussion on Tree Data Structure

  • Topics of discussion:

  1. Discussion on Tree data structure
  2. Tree traversals and applications

  • Expected Learning Outcome:

  1. Implementation of tree data structure
  2. Problem solving for tree traversal

  • Self-test on Tree Data Structure

  • Select activity Discussion on Tree Data Structure

    Completion

    Students must

    

    Mark as done

    Discussion on Tree Data Structure

  • Select activity Discussion on Binary Tree Traversal 

    Completion

    Students must

    

    Mark as done

    Discussion on Binary Tree Traversal 

  • Select activity Lab Session 7: Working with Tree

    Completion

    Students must

    

    Mark as done

    Lab Session 7: Working with Tree

  • Select activity Pre-recorded Video Lecture:Lecture-15(Tree Data St...

    Completion

    Students must

    

    Mark as done

    Pre-recorded Video Lecture:

    Lecture-15(Tree Data Structure)

    Lecture-16(Tree Traversal)
    

  • Select activity Class Video Lecture(PC-E+PC-F+PC-J)

    

    Class Video Lecture(PC-E+PC-F+PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Forum discussion on Binary Tree(Week-8)

    

    Forum discussion on Binary Tree(Week-8)

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment on Tree Traversal(Week-8)

    

    Assignment on Tree Traversal(Week-8)

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on Tree data structure

    

    Interactive quiz on Tree data structure Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Students Feedback(Week-8)

    

    Students Feedback(Week-8) URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference Video:click

    Completion

    Students must

    

    Mark as done

    Reference Video:

• Select section Week 9: Discussion on Binary Search Tree (BST)

  Week 9: Discussion on Binary Search Tree (BST)

  • Topics of discussion:

  1. BST and operations on BST
  2. Applications of BST

  • Expected Learning Outcome:

  1. Implementation of BST and related operations
  2. Problem solving using BST

  • Presentation on Course Project

  • Select activity Discussion on Binary Search Tree

    Completion

    Students must

    

    Mark as done

    Discussion on Binary Search Tree

  • Select activity Lab Session 8: Working with BST

    Completion

    Students must

    

    Mark as done

    Lab Session 8: Working with BST

  • Select activity Pre-recorded Video Lecture:Lecture-17(Binary Searc...

    Completion

    Students must

    

    Mark as done

    Pre-recorded Video Lecture:

    Lecture-17(Binary Search Tree)

    Lecture-18(Implementation of Binary Search Tree)
    

    Lab video lecture:

    Lecture-9(Implementation of  BST tree-Insert,Search)

  • Select activity Class Video Lecture(PC-E+PC-F+PC-J)

    

    Class Video Lecture(PC-E+PC-F+PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Code: Binary Search Tree

    

    Code: Binary Search Tree File

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment on Binary Search Tree

    

    Assignment on Binary Search Tree

    Completion

    Students must

    

    Mark as done
  • Select activity Forum discussion on Binary Search Tree

    

    Forum discussion on Binary Search Tree

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on Binary Search Tree

    

    Interactive quiz on Binary Search Tree Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Students Feedback(week-9)

    

    Students Feedback(week-9) URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference Video:Click

    Completion

    Students must

    

    Mark as done

    Reference Video:

• Select section Week 10: Discussion on Heap

  Week 10: Discussion on Heap

  • Topics of discussion:

  1. HEAP data structure and applications of Heap
  2. Exercise on BST and Heap

  • Expected Learning Outcome:

  1. Implementation of Heap and operations
  2. Problem solving using BST

  • Self-Test on BST

  • Select activity Discussion on Heap Data Structure

    Completion

    Students must

    

    Mark as done

    Discussion on Heap Data Structure

  • Select activity Lab Session 9: Working with Heap

    Completion

    Students must

    

    Mark as done

    Lab Session 9: Working with Heap

  • Select activity Pre-recorded Video Lecture:Lecture-19(Basic of Bin...

    Completion

    Students must

    

    Mark as done

    Pre-recorded Video Lecture:

    Lecture-19(Basic of Binary Heap)

    Lecture-20(Min heap, Heap sort)

  • Select activity Class video lecture(PC-E,PC-F,PC-J)

    

    Class video lecture(PC-E,PC-F,PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Students feedback

    

    Students feedback URL

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment on Heap

    

    Assignment on Heap

    Completion

    Students must

    

    Mark as done
  • Select activity Forum on discussion binary heap

    

    Forum on discussion binary heap

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on binary heap

    

    Interactive quiz on binary heap Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Reference Video:Click

    Completion

    Students must

    

    Mark as done

    Reference Video:

• Select section Week 11: Discussion on Graph

  Week 11: Discussion on Graph

  • Topics of discussion:

  1. Graph data structure and applications of graph
  2. Traversal of Graph

  • Expected Learning Outcome:

  1. Implementation of graph data structure
  2. Problem solving using Heap

  • Class Test 3

  • Select activity Discussion on Graph Data Structure

    Completion

    Students must

    

    Mark as done

    Discussion on Graph Data Structure

  • Select activity Discussion on Graph Implementation

    Completion

    Students must

    

    Mark as done

    Discussion on Graph Implementation

  • Select activity Discussion on Graph Traversal

    Completion

    Students must

    

    Mark as done

    Discussion on Graph Traversal

  • Select activity Lab Session 10: Working with Graph

    Completion

    Students must

    

    Mark as done

    Lab Session 10: Working with Graph

  • Select activity Class Video Lecture(PC-E,PC-F,PC-J)

    

    Class Video Lecture(PC-E,PC-F,PC-J) Page

    Completion

    Students must

    

    Mark as done
  • Select activity Lab Video Lecture:Lecture-10(Project follow up )

    Lab Video Lecture:

    Lecture-10(Project follow up )

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Assignment on Graph Data structure

    

    Assignment on Graph Data structure

    Completion

    Students must

    

    Mark as done
  • Select activity Forum discussion on Graph

    

    Forum discussion on Graph

    Completion

    Students must

    

    Mark as done
  • Select activity Reference website

    

    Reference website URL

    Completion

    Students must

    

    Mark as done
  • Select activity Students Feedback(Week-11)

    

    Students Feedback(Week-11) URL

    Completion

    Students must

    

    Mark as done
  • Select activity quiz-3(PC--F)

    

    quiz-3(PC--F) Assignment

    Completion

    Students must

    

    Mark as done
  • Select activity quiz-3(PC--J)

    

    quiz-3(PC--J) Assignment

    Completion

    Students must

    

    Mark as done
  • Select activity quiz-3(PC--E)

    

    quiz-3(PC--E) Assignment

    Completion

    Students must

    

    Mark as done
  • Select activity Interactive quiz on Graph

    

    Interactive quiz on Graph Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Reference videoclick

    Completion

    Students must

    

    Mark as done

    Reference video

• Select section Week 12: Review Discussion

  Week 12: Review Discussion

  • Topics of discussion:

  1. Review exercises on Tree, BST, Heap and Graph

  • Expected Learning Outcome:

  1. Problem solving using Tree, BST, Heap, and Graph

  • Self-test

  • Select activity Review discussion

    Completion

    Students must

    

    Mark as done

    Review discussion

  • Select activity Lab Video Lecture: PC-JLecture-12(Project presenta...

    Lab Video Lecture: PC-J

    Lecture-12(Project presentation and Viva)

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Class video Lecture: (PC-F)Lecture-23(Review discu...

    Completion

    Students must

    

    Mark as done

    Class video Lecture: (PC-F)

    Lecture-23(Review discussion)

    Lecture-24(Review discussion-2)

  • Select activity Class Video Lecture: PC-JLecture-23(Review discuss...

    Completion

    Students must

    

    Mark as done

    Class Video Lecture: PC-J

    Lecture-23(Review discussion)

    Lecture-24(Review discussion-2)

  • Select activity Class Video Lecture: PC-ELecture-23(Review discuss...

    Completion

    Students must

    

    Mark as done

    Class Video Lecture: PC-E

    Lecture-23(Review discussion)

    
    

    
    

• Select section Week 13-14: Final Exam

  Week 13-14: Final Exam

  
  

  • Topics of the final:

  1. Tree, BST and applications
  2. Heap and application of Heap
  3. Basics of Graph data structure

  • Select activity Lab final(PC-J)

    

    Lab final(PC-J) Assignment

    Not available unless: You belong to DSLab-(PC-J)
  • Select activity Final Exam

    

    Final Exam Assignment

    Completion

    Students must

    

    Mark as done

    Dear students,
    

    You need to download (1) QuestionPaper.pdf and (2) AnswerScriptTemplate.doc from the final-exam. You will type your answers in the answer script doc file and save as pdf with your ID e.g. CSE134-PC-E-111-15-2345-final.pdf (Course Code-Section-Student ID) and then upload in the following google form link: 

    https://forms.gle/ASvqKpXfYpUP9kk67
    

• Select section Topic 14

  Topic 14
• Select section Topic 15

  Topic 15
• Select section Topic 16

  Topic 16
• Select section Topic 17

  Topic 17
• Select section Topic 18

  Topic 18
• Select section Topic 19

  Topic 19
• Select section Topic 20

  Topic 20
• Select section Topic 21

  Topic 21
• Select section Topic 22

  Topic 22
• Select section Topic 23

  Topic 23
• Select section Topic 24

  Topic 24
• Select section Topic 25

  Topic 25
• Select section Topic 26

  Topic 26
• Select section Topic 27

  Topic 27
• Select section Topic 28

  Topic 28
• Select section Topic 29

  Topic 29
• Select section Topic 30

  Topic 30
• Select section Topic 31

  Topic 31
• Select section Topic 32

  Topic 32
• Select section Topic 33

  Topic 33
• Select section Topic 34

  Topic 34
• Select section Topic 35

  Topic 35
• Select section Topic 36

  Topic 36
• Select section Topic 37

  Topic 37
• Select section Topic 38

  Topic 38
• Select section Topic 39

  Topic 39
• Select section Topic 40

  Topic 40
• Select section Topic 41

  Topic 41
• Select section Topic 42

  Topic 42
• Select section Topic 43

  Topic 43
• Select section Topic 44

  Topic 44
• Select section Topic 45

  Topic 45
• Select section Topic 46

  Topic 46
• Select section Topic 47

  Topic 47
• Select section Topic 48

  Topic 48
• Select section Topic 49

  Topic 49
• Select section Topic 50

  Topic 50