Topic outline

• WELCOME MESSAGE
  

  WELCOME MESSAGE

  
  

  Hello, Greetings....
  

  My Dear Students, 

  Assalamulaikum and greetings to all of you. I'm Moushumi Zaman Bonny, Senior Lecturer in the Department of Computer Science and Engineering at the Daffodil International University. I am also a PhD researcher at  Jahangirnagar University.  My research topics covered Image Processing and Computer Vision. 
  

  I have received Bachelor degree of Science in Computer Science and Engineering (CSE)  from Jahangirnagar University and also received my Master's degree from the same university.

  In this semester I will take the course CSE 214 and CSE215: Algorithms and Algorithms Lab, which is designed for helping students to grow up with the understanding of algorithms and providing them the fundamental principles of algorithms. The course will introduce the students about  different well-known algorithms and their simulations and applications. 

  I'm delighted that you are interested in taking our specialization. We have done our part to make this a rewarding educational experience. Now it's your turn, good luck. 

  
  

  • 
    

    Instructor              : Moushumi Zaman Bonny
    Destination            : Senior Lecturer 
    Office                     : Room #110 (1st floor), Daffodil Tower-5, Daffodil International University, 102,                                                 Subhanbagh, Dhanmondi, Dhaka-1207
    Office Hour            : Sunday (08.00/10.00), Wednesday(08.00/10.00) or by appointment
    Contact Number    : 01923703097
    E-mail                     : bonny.cse@diu.edubd
    Web Profile            : Google Site , DIU Profile, Google Scholar Profile
    
    

  • Welcome to Algorithms Course.............

    Class Routine

    

    Get Appointments:

    

    
    

  • 
    

  • Course Rationale 

    Algorithms deals with efficient ways to solve different mathematical and real-life problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve computational problems. This course emphasizes the relationship between algorithms and programming and explores algorithms from the programmer’s perspective for solving problems efficiently using various programming languages.

    
    

  • Course Objective
    

    This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following:
    • Analyse the asymptotic performance of algorithms.
    • Demonstrate familiarity with major algorithms and data structures.
    • Apply important algorithmic design paradigms and methods of analysis.
    • Synthesize efficient algorithms in common engineering design situations.

  • Course Outcomes (CO’s)

    CO1	Analyze and calculate time complexity and space complexity of various algorithms or any written code using mathematical formula and comparison of algorithms.
    CO2	Generate and interpret the output of iterative and recursive codes with the analysis of the problem definition.
    CO3	Identify which algorithm listed under which algorithmic paradigm. Compare among various algorithms/implemented codes and choose the efficient one.
    CO4	Break down and describe the simulation of various algorithms for different input values.
    CO5	Design and apply appropriate algorithms to solve real-life problems.

    
    

  • Let Make Some Fun with Algorithm before starting with the visualization

  • Grading Scheme

    Theory Class                                                                                         
    Attendance: 7%                                                                                                              
    Class Tests/Quizzes: 15%                                                                             
    Assignment: 5%                                                                                           
    Presentation (using video/ppt): 8%                                                         
    Midterm Exam: 25%
    Final Exam: 40%
    

  • Student Interest Survey

    Please let me know what do you want to learn from this course

  • Text Book:

    

    Introduction to Algorithms, (3rd Edition, MIT Press, 2009) 

    Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein

    ISBN: 9780262033848.
    

    Course Outline

    Reference Books:
    a. Algorithms (4th Edition)
        Author: Robert Sedgewick and Kevin Wayne
    b. Algorithm Design
        Author: Jon Kleinberg, Eva Tardos
    c. Data Structures And Algorithms Made Easy In JAVA Author: Narasimha Karumanchi

    Useful Web Links:

    • www.visualgo.net 
    • www.geeksforgeeks.org
    • www.topcoder.com 
    • www.codeforces.com 

    Additional Support for Students

    ·         Student Portal: http://studentportal.diu.edu.bd/

    ·         Academic Guidelines https://daffodilvarsity.edu.bd/article/academic-guidelines

    ·         Rules and Regulations of DIU https://daffodilvarsity.edu.bd/article/rules-and-regulation

    ·         Career Development Center: https://cdc.daffodilvarsity.edu.bd/

    ·         For general queries: http://daffodilvarsity.edu.bd/

    
    

  • WELCOME MESSAGE/ VIDEO

    
    

    Mark as done
  • Google Classroom Code O1: 2zpfau2

    Restricted Not available unless: You belong to O1-MC
  • Announcements Forum
  • Google Classroom Code O2: hc6gurq

    Restricted Not available unless: You belong to O2-MC
• Week-01 Preparing Background
  

  Week-01 Preparing Background

  
  

  • Topics of discussion

    1. Introduction and importance of Algorithm and its application
    2. Function and Recursion, Euclid’s Greatest Common Divisor(GCD) Algorithm

    Expected Learning Outcome

    1. Gain knowledge about the importance of algorithm
    2. Perform exercise on function and recursion function

    
    

    Week-01 Plan

    week plan	Topics	Materials
    Week-01 Lecture-01           Video on Lecture  PPT on Lecture	Introduction, Motivation  Course logistics	Video Link of First Session      PPT link
    Week-01 Lecture-02 Video on Lecture  PPT on Lecture	Function and Recursion  Euclid’s Greatest Common  Divisor(GCD) Algorithm	Video Link of this session PPT link
    Week-01 Lab Video on Lab Manual on Lab	A decision on structures and loop,   Array, String, Function, Recursion	Video Link            Manual Link

    
    

    Restricted Not available unless: You belong to any group
  • Recorded Class video of Section O1: Week 1 Class 1 Date: 31.05.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Recorded Class video of Section-O1: Week 1 Class 2 Date:01.06.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Recorded Class video of Section O2: Week 1 Class 1 Date:01.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

  • Outcome of Week 01 Interactive Content

    Mark as done

    1. Introduction to Divide and Conquer Approach.
    2.  Introduction to the searching Algorithm based on Divide and Conquer Approach. 
    3. Introduction to the Sorting Algorithm based on Divide and Conquer Approach. 

    
    

  • Section-1, Week-1 Class-2, Attendance, Date:01.06.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Recorded Videos URL

    Mark as done

      

        

• Week-2:Searching and Sorting Algorithm Based on Brute Force Approach
  

  Week-2:Searching and Sorting Algorithm Based on Brute Force Approach

  
  

  • Topics of discussion

    1. Introduction to brute force techniques.
    2. Introduction to the searching Algorithm.
    3.  Introduction to the sorting Algorithm

    Expected Learning Outcome

    1. Knowledge about the Linear Search algorithm and its complexity
    2. Knowledge about the Insertion sort algorithm and its complexity
    3. Knowledge about the Bubble sort algorithm and its complexity
    4.  Knowledge about the Selection sort algorithm and its complexity
    5.  Exercise the Sorting and searching Algorithm with some additional problems.

    Week-02 Plan

    week plan	Topics	Materials
    Week-02 Lecture-01                  Video on Lecture  PPT on Lecture	Linear Search Brute Force algorithm    Insertion Sort	Video Link PPT link
    Week-02 Lecture-02 Video on Lecture  PPT on Lecture	Insertion Sort Selection Sort	Video Link PPT link
    Week-02 Lab Video on Lab Manual on Lab	Linear Search	Video Link Manual Link

    
    

  • Quiz-01

    Restricted Not available unless: You belong to O2-MC

    Quiz Syllabus:

    • Function and Recursion
    • Euclid’s Greatest Common Divisor(GCD) Algorithm
    • Searching: Linear Search and Binary Search
    • Sorting: Insertion Sort, Merge Sort, Quick Sort

  • Discussion on Week-03 Forum

    Discuss on Week-02 content if you have any problem and confusion. 

  • Week 2 Class 1: Recorded Class of Section O1, Date:07.06.2020 URL

    Restricted Not available unless: You belong to O1-MC

    

  • Week 2 Class 1: Recorded Class Video of Section-O2, Date: 08.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    

  • Class Lecture Notes URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2 Recorded Class Video, Date:11.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    

  • Recorded Videos URL

    Mark as done

      
    
• Week-03 Notation and Complexity Analysis
  

  Week-03 Notation and Complexity Analysis

  
  

  • Topics of discussion

    1. Introduction with the Asymptotic Notation 
    2. Discussion on the Complexity of Algorithms
    3.  Importance of Complexity for designing an Algorithm

    Expected Learning Outcome

    1. Gain knowledge about the importance of algorithm
    2. Find out the Asymptotic Notation from an Algorithm
    3. Find out the complexity from any code or algorithm

    
    

    Week-03 Plan

    week plan	Topics	Materials
    Week-03 Lecture-01 Video on Lecture  PPT on Lecture	Asymptotic Notation	Video Link PPT link
    Week-03 Lecture-02 Video on Lecture  PPT on Lecture	Complexity Analysis	Video Link PPT link
    Week-03 Lab Video on Lab Manual on Lab	problems with Array, String,  Function, Recursion	Video Link Manual Link

    
    

    Mark as done
  • Section O1 Week 3 Class1: Recorded Class video, Date 14.06.2020 URL

    Restricted Not available unless: You belong to O1-MC

    

  • Section O2 Week 3 Class 1: Recorded class video, Date: 15.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    

  • Section O1: Week 3 Class2: Recorded video, Date:17.06.2020 URL

    Restricted Not available unless: You belong to O1-MC

    

  • Section O2, Week 3 Class 2, Attendance, Date: 18.06.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2: Week 3 Class2 : Recorded Class Video, Date:18.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
  • Recorded Video

    
    

    Mark as done
• Week-4
  

  Week-4

  
  

  • Topics of discussion

    1. Introduction to Divide and Conquer Approach.
    2.  Introduction to the searching Algorithm based on Divide and Conquer Approach. 
    3. Introduction to the Sorting Algorithm based on Divide and Conquer Approach. 

    Expected Learning Outcome

    1. Knowledge about the Binary Search algorithm and its complexity
    2. Knowledge about the Merge sort algorithm and its complexity
    3. Knowledge about the Quicksort algorithm and its complexity
    4. Exercise the Sorting and searching Algorithm with some additional problems.

    
    

    Week-04 Plan

    week plan	Topics	Materials
    Week-04 Lecture-01                                   Video on Lecture  PPT on Lecture	Binary Search Merge Sort Divide and Conquer Approach	Video Link PPT link
    Week-04 Lecture-02 Video on Lecture  PPT on Lecture	Quick Sort	Video Link PPT link
    Week-04 Lab Video on Lab Manual on Lab	Bubble Sort Insertion Sort Binary Search	Video Link   Manual Link

    
    

  • Discussion on Week-04 Forum

    Discuss on Week-04 content if you have any problem and confusion. 

  • Section O1, Week 4 Class 1, Recorded Class video, Date:21.06.2020 URL

    Restricted Not available unless: You belong to O1-MC

    

  • Section O2: Quiz-1, Date: 22.06.2020

    Restricted Not available unless: You belong to O2-MC

    
    

  • Section-O2: Attendance of Week 4 Class 1, Date: 22.06.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2, Week 4 class 1: class recording, Date:22.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    

  • Section O1, Week 4 Class 2, Attendance, Date: 24.06.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section O1: Quiz-1

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2: Attendance of Week 4 Class 2, Date: 25.06.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2, Week 4 Class 2 : Recorded Video, Date: 25.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    

  • RECORDED VIDEOS

    
    

    Mark as done
• Week -5
  

  Week -5

  

  • Topics of discussion

    1. Introduction to Greedy Approach
    2. Discussion on Coin Change Problem
    3. Discussion on Bin packing Problem
    4. Discussion on Knapsack Problem
    5. Discussion on Hoffman coding
    6. Assignment-01

    Expected Learning Outcome

    1. Solve the Coin Change Problem based on Greedy Method
    2. Solve the Knapsack Problem based on Greedy Method
    3. Solve the Hoffman coding based on Greedy Method
    4.  Solve the  Bin packing Problem based on Greedy Method
    5.  Exercise the Sorting Algorithm with some additional problems in the Lab.

    
    

    Week-05 Plan

    week plan	Topics	Materials
    Week-05 Lecture-01           Video on Lecture  PPT on Lecture	Coin Change (Greedy Method)                       Bin-Packing Problem	Video Link                  PPT link
    Week-05 Lecture-02 Video on Lecture  PPT on Lecture	Greedy Partial Knapsack Greedy Huffman Coding	Video Link PPT link
    Week-05 Lab Video on Lab Manual on Lab	Selection Sort Merge Sort Quick Sort	Video Link Manual Link

    
    

  • Section-O1, Week 5 Class 1, Attendance, Date:28.06.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section O1: Recorded Class Video of Week 5 Class 1, Date:30.06.2020 URL

    Restricted Not available unless: You belong to O1-MC

    

  • Section O2, Week 5 Class 1, Attendance of Date: 29.06.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2 :Recorded Video Of Week5 Class1, Date:29.06.2020 URL

    Restricted Not available unless: You belong to O2-MC

    

  • O1 Attendance, Date: 01.07.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • O2: Attendance, Date: 02.07.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2, Week-5 Class 2, Recorded Class, Date:02.07.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

  • Asymptotic Notations and Complexity Analysis
    
    
    
    

    Mark as done
  • Asymptotic Notations and Complexity Analysis URL

    Mark as done

    
    

  • Section O1, Week-5, Class-2, Recorded Class, Date:01.07.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2: Week 5 Class 2:Huffman Coding Algorithms, Date:02.07.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

• Week 6
  

  Week 6

  Not available
• Week-7
  

  Week-7

  • Topics of discussion

    1. Introduction to Dynamic Programming (DP)
    2. Discussion on longest Common Subsequence and Edit Distance Problem
    3. Discussion on longest Increasing Subsequence (DP)

    
    

    Expected Learning Outcome
    

    1. Solve the Longest Common Subsequence (LCS) Problem based on DP
    2. Solve the Longest Increasing Subsequence (LIS)
    3. Exercise the Bin-packing, LCS, LIS Algorithm with some additional problems in the Lab.

    
    

    Week-07 Plan

    week plan	Topics	Materials
    Week-07 Lecture-01                  Video on Lecture  PPT on Lecture	Longest Common Subsequence (LCS)	Video Link PPT link
    Week-07 Lecture-02 Video on Lecture  PPT on Lecture	Longest Increasing Subsequence(LIS)	Video Link PPT link
    Week-07 Lab Video on Lab Manual on Lab	Bin Packing,  LCS, LIS	Video Link Manual Link

    
    

  • Section-O2, Attendance, Date: 13.07.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section-O1, Attendance, Date: 15.07.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section-O1, Recorded Class, Date:15.07.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2, Attendance : Week 7 Class-2, Date:16.07.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section-O2, Recorded Class, Date: 16.07.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

• Week-8
  

  Week-8

  • Topics of discussion

    1.  Introduction to Dynamic Programming (DP)
    2. Discussion on Fibonacci Numbers Problem
    3. Discussion on Coin Change Problem (DP)
    4. Discussion on Knapsack Problem (0/1)
    5. Quiz #02

    
    

    Expected Learning Outcome

    1. Solve the Coin Change Problem based on DP
    2. Solve the Knapsack Problem based on DP
    3. Solve the Fibonacci Numbers Problem based on DP
    4. Exercise the Bin-packing Algorithm with some additional problems in the Lab.

    Week-08 Plan

    week plan	Topics	Materials
    Week-08 Lecture-01                  Video on Lecture  PPT on Lecture	Dynamic Programming                           Fibonacci Numbers Problem	Video Link PPT link
    Week-08 Lecture-02 Video on Lecture  PPT on Lecture	DP: Coin Change  DP: 0/1 Knapsack	Video Link PPT link
    Week-08 Lab Video on Lab Manual on Lab	Bin Packing Lab performance-01	Video Link Manual Link

    
    

  • Discussion on Week-06 Forum

    Discuss on Week-06 content if you have any problem and confusion. 

  • Session-O1, Week-8 Class 1: attendance, Date: 19.07.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section-O1, Recorded Class :Week 8 Class 1,Date: 19.07.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2, Attendance, Date:20.07.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section-O2, Recorded Class, Date:20.07.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

  • Section-O1, Attendance, Date:22.07.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section-O1, Recorded Class, Week 8 Class 2, Date: 22.07.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2, Week-8 Class 2, Attendance, Date:23.07.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2:Recorded Class Week 8, Class 2, Date:23.07.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

• Week-9
  

  Week-9

  • Topics of discussion

    1. Introduction to Graph
    2. Graph Representation
    3. Discussion on Graph Traversal
    4. Assignment-02

    
    

    Expected Learning Outcome
    

    1. Solve the Breadth-First Search (BFS) algorithm
    2. Solve the Depth First Search (DFS) algorithm

    
    

    Week-09 Plan

    week plan	Topics	Materials
    Week-09 Lecture-01                  Video on Lecture  PPT on Lecture	Graph and Graph Representation	Video Link PPT link
    Week-09 Lecture-02 Video on Lecture  PPT on Lecture	BFS, DFS	Video Link PPT link
    Week-09 Lab Video on Lab Manual on Lab	DFS	Video Link Manual Link

    
    

  • Discussion on Week-09 Forum

    Discuss on Week-09 content if you have any problem and confusion. 

  • Section O1: Quiz-2

    Restricted Not available unless: You belong to O1-MC

    Section O1: Quiz-2
    

    

  • Section-O1, Attendance, Date:26.07.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section-O2,Attendance, Date:27.07.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section-O2, Recorded Class video, date: 27.07.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

• Lecture-10
  

  Lecture-10

  
  

  
  

  • Topics of discussion

    1. DFS Application
    2. Quiz #03
       

    
    

    Expected Learning Outcome
    

    1. Full Tree Traversal
    2. Cycle Finding
    3. Component FInding
    4. Topological Sort (TS)
    5. Strongly Connected Component (SCC)

    
    
    

    Week-10 Plan

    week plan	Topics	Materials
    Week-10 Lecture-01                  Video on Lecture  PPT on Lecture	Full Tree Traversal Cycle Finding Component Finding	Video Link PPT link
    Week-10 Lecture-02 Video on Lecture  PPT on Lecture	Ts, SCC	Video Link PPT link
    Week-10 Lab Video on Lab Manual on Lab	DFS, MST Lab performance-02	Video Link Manual Link

    
    

  • Section-O1, Attendance, Date:05.08.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section-O1: Recoreded Class Video, Date:05.08.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section O2, Attendance, Date: 06.08.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • SEction-O2, Recorded Class video, Date:06.8.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

• Week-11 Graph: Single Source Shortest Path Algorithm
  

  Week-11 Graph: Single Source Shortest Path Algorithm

  • Topics of discussion

    1. Discussion on Minimum Spanning Tree (MST)
    2. Discussion on Single Source Shortest Path

    Expected Learning Outcome
    

    1. Solve MST using Kruskal’s Algorithm
    2. Solve MST using Prim’s Algorithm
    3. Single-Source Shortest Path(SSSP) by Dijkstra’s Algorithm

    
    

    Week-11 Plan

    week plan	Topics	Materials
    Week-11 Lecture-01                  Video on Lecture  PPT on Lecture	MST: Kruskal’s Algorithm           MST: Prim’s Algorithm	Video Link            PPT link
    Week-11 Lecture-02 Video on Lecture  PPT on Lecture	SSSP: Dijkstra’s Algorithm	Video Link PPT link
    Week-11 Lab Video on Lab Manual on Lab	MST, Dijkstra’s Algorithm	Video Link Manual Link

    
    

  • Discussion on Week-11 Forum

    Discuss on Week-11 content if you have any problem and confusion. 

  • Section-O1, Attendance, Date: 09.08.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section O1, Recorded Class video, Date: 09.08.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2, Attendance, Date;10.08.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section O2, Recorded Class Video, Date: 10.08.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

  • Section O1: Attendance, date:12.08.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section-O1, Recorded Class video, Date: 12.08.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2, Attendance, Date: 13.08.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section-O2, Recorded Class video, Date:13.08.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

• Week-12 Graph: All Pair Shortest Path Algorithm
  

  Week-12 Graph: All Pair Shortest Path Algorithm

  Not available
• Week-12 Final Presentation and Lab Final
  

  Week-12 Final Presentation and Lab Final

  • Presentation Slide/Videos Submission Link
    

    Lab Final.

    
    

  • Discussion on Week-13 Forum

    Discuss on Week-13 on Final Presentation and Lab Final.

    
    

    
    

    . 

  • Section-O1 Attendance, Date:16.08.2020 URL

    Restricted Not available unless: You belong to O1-MC
  • Section-O1: Recorded Class Video, Date:16.08.2020 URL

    Restricted Not available unless: You belong to O1-MC

    
    

  • Section-O2, Attendance, Date: 17.08.2020 URL

    Restricted Not available unless: You belong to O2-MC
  • Section=O2, Recorded Class Video, Date: 17.08.2020 URL

    Restricted Not available unless: You belong to O2-MC

    
    

  • 
    

    Quiz-3

    Section-O2

    CSE 214, Algorithms, Marks-15, Time: 1hr, 7.30pm-8.30pm

    Submission within 9pm

    
    

    Question[download]

    Sumission[click here]

    Restricted Not available unless: You belong to O2-MC
  • Question Pattern Review: Recorded Video

    
    

    
    

    Mark as done
• Week-14 Final Examination
  

  Week-14 Final Examination

  • 
    

  • End of the Semester.

  • 

    FINAL EXAMINATION
    

    Section-O1
    

    Course Code: CSE-214, Course Title: Algorithms
    

    Date:27.08.2020, Time: 9.00 am-1.00 pm
    

    Question:[Download]
    

    Answer Script: [Download]
    

    Submit here[Fill up the Google Form]

    If you are facing problems during the time of download/upload/submission, then submit here...
    

    *Must Submit in both Google Form and Google Classroom 

    for 100% confirmation of your submission.

    
    

    
    

    
    

    Restricted Not available unless: You belong to O1-MC
  • 

    FINAL EXAMINATION
    

    Section-O2
    

    Course Code: CSE-214, Course Title: Algorithms
    

    Date:27.08.2020, Time: 9.00 am-1.00 pm
    

    Question:[Download]
    

    Answer Script: [Download]
    

    Submit here[Fill up the Google Form]

    If you are facing problems during the time of download/upload/submission, then submit here...
    

    *Must Submit in both Google Form and Google Classroom 

    for 100% confirmation of your submission.

    
    

    
    

    
    

    Restricted Not available unless: You belong to O2-MC