Connected successfully Announcements || SNS Courseware
Menu
Subject Details
Dept     : CSE-IOT
Sem      : 5
Regul    : 2019
Faculty : Ms.B.Sangeethapriya
phone  : 7010189775
E-mail  : sangeetha.b.iot@snsce.ac.in
197
Page views
32
Files
3
Videos
2
R.Links

Icon
Announcements

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Algorithm, pseudo code for expressing algorithms, , </br>divide and conquer

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Divide and conquer algorithm , </br>Analysis of binary search ,quick sort , </br>Merge sort ,and or graph , </br>Greedy algorithm,job sequencing with deadlines, </br>Minimum cost spanning trees, </br>Single source shortest path, </br>Breadth first search and traversal, Depth first search and traversal, </br>, Spanning trees, connected components , </br>bi-connected components, </br>Articulation points, </br>DYNAMIC PROGRAMMING: General method, applications , </br>0/1 knapsack problem, </br>All pairs shortest path problem, </br>Travelling sales person problem, </br>, Reliability design

  • Puzzles

    Dear Students the Puzzles has been uploaded for the following topics:</br>divide and conquer algorithm

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Algorithm, pseudo code for expressing algorithms, , </br>Algorithm, pseudo code for expressing algorithms, , </br>Time complexity asymptotic notation , </br>performance analysis-space complexity,, </br>Big o notation,omega notation , </br>Theta notation ,little o notation , </br>Recurrences, probabilistic analysis , </br>Disjoint set operation,union and find algorithm , </br>Fractional knapsack problem

  • Assignment

    Assignment topic is fractional knapsack problem and due date is 09-09-2024.

  • Assignment

    Assignment topic is Fractional knapsack problem and due date is .

  • Assignment

    Assignment topic is Fractional kanpsack problem and due date is .

  • Question Bank

    Dear Students the Question Bank has been uploaded for the following topics:</br>Internal questions bank

  • Resource Link

    Dear Students the Resource Link has been uploaded for the following topics:</br>Searching in array</br>Recurrences

  • Youtube Video

    Dear Students the Youtube Video has been uploaded for the following topics:</br>Analysis of merge sort using divide and conquer algorithm </br>Course outline</br>Quick sort

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Time complexity asymptotic notation , </br>Performance analysis space complexity , </br>Big o notation,omega notation , </br>Theta notation ,little o notation , </br>Recurrences, probabilistic analysis , </br>Disjoint set operation,union and find algorithm , </br>Divide and conquer algorithm , </br>Analysis of binary search ,quick sort , </br>Merge sort ,and or graph , </br>Greedy algorithm,job sequencing with deadlines, </br>Fractional knapsack problem, </br>Minimum cost spanning trees, </br>Single source shortest path

  • Question Bank

    Dear Students the Question Bank has been uploaded for the following topics:</br>IAE 2