Menu
Subject Details
Dept     : CSE-IOT
Sem      : 3
Regul    : 2023
Faculty : RR.Kmalakkannan
phone  : NIL
E-mail  : kamalakannan.r.iot@snsce.ac.in
807
Page views
46
Files
2
Videos
4
R.Links

Icon
Announcements

  • Grades & Toppers of IAE2

    &nbsp;<div id="maingrade"> <div id="photor"><img src="files/CW_66d53e2de3b3f/gradesimg/WhatsApp Image 2024-10-29 at 3.32.39 PM.jpeg" width="47" height="52" class="roundnews1" /></div> <div id="gratitile">Wedha Prabha R </div> <div id="grdm">1</div> </div><div id="maingrade"> <div id="photor"><img src="files/CW_66d53e2de3b3f/gradesimg/WhatsApp Image 2024-10-29 at 3.26.49 PM.jpeg" width="47" height="52" class="roundnews1" /></div> <div id="gratitile">Shree Harish G </div> <div id="grdm">2</div> </div><div id="maingrade"> <div id="photor"><img src="files/CW_66d53e2de3b3f/gradesimg/gowtham 3.jpg" width="47" height="52" class="roundnews1" /></div> <div id="gratitile">Gowtham S </div> <div id="grdm">3</div> </div>

  • Grades & Toppers of IAE2

    &nbsp;<div id="maingrade"> <div id="photor"><img src="files/CW_66d53e2de3b3f/gradesimg/WhatsApp Image 2024-10-29 at 3.32.39 PM.jpeg" width="47" height="52" class="roundnews1" /></div> <div id="gratitile">Wedha Prabha R </div> <div id="grdm">1</div> </div><div id="maingrade"> <div id="photor"><img src="files/CW_66d53e2de3b3f/gradesimg/WhatsApp Image 2024-10-29 at 3.26.49 PM.jpeg" width="47" height="52" class="roundnews1" /></div> <div id="gratitile">Shree Harish G </div> <div id="grdm">2</div> </div><div id="maingrade"> <div id="photor"><img src="files/CW_66d53e2de3b3f/gradesimg/gowtham 3.jpg" width="47" height="52" class="roundnews1" /></div> <div id="gratitile">Gowtham S </div> <div id="grdm">3</div> </div>

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Graph ADT, </br>representations of graph – graph traversals , </br>DAG, </br>topological ordering , </br>dynamic programming: shortest paths

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Tree ADT , </br>Binary Tree ADT , </br>tree traversals , </br>Back Tracking , </br>binary search trees , </br>AVL trees , </br>heaps, </br>multi- way search trees

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Applications of Stack: Infix to Postfix conversion, </br>Postfix Evaluation, </br>Balanced parentheses -Function Call, </br>Queue ADT, </br>Circular Queue, </br>double ended queues , </br>applications Queue, </br>Exercise: 3.Implementation of Stack and Queue ADTs 4.Applications of Stack and Queue ADTs, </br>Exercise: 1.Implement List ADT 2.Linked list implementations of List

  • Youtube Video

    Dear Students the Youtube Video has been uploaded for the following topics:</br>Introduction to Data structure & Algorithm</br>Programming in Data Structure & Algorithm

  • Resource Link

    Dear Students the Resource Link has been uploaded for the following topics:</br>Queue ADT</br> Sorting</br>Assignment 1: Static vs. Dynamic Analysis

  • Puzzles

    Dear Students the Puzzles has been uploaded for the following topics:</br>Introduction

  • Question Bank

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

  • Assignment

    Assignment topic is Sorting and due date is 30-09-2024.

  • Assignment

    Assignment topic is Queue ADT and due date is 16-09-2024.

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Abstract Data Types (ADTs) , </br>Introduction to analysis of algorithms – asymptotic notations , </br>Non recursion & recursion, </br>analyzing recursive algorithms, </br>List ADT – array-based implementations , </br>linked list implementations , </br>singly linked lists , </br>circularly linked lists , </br>doubly linked lists, </br>Stack ADT , </br>Applications of Stack: Infix to Postfix conversion

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:</br>Bubble sort – selection sort , </br>insertion sort – divide & conquer, </br>merge sort – quick sort , </br>analysis of sorting algorithms, </br>– linear search – binary search , </br>hashing – hash functions , </br>collision handling, </br>load factors, </br>rehashing, and efficiency