Lecture Notes || SNS Courseware

Subject Details

Dept : EEE

Sem : 2

Regul : R2019

Faculty : Devi

phone : NIL

E-mail : devi.g.cse@snsct.org

1.006K

Page views

Files

Videos

R.Links

Lecture Notes

UNIT 1:

Introduction Algorithm Analysis

Asymptotic Notations

Searching algorithm

sorting Selection sort

Bubble sort

Insertion sort

Merge sort

Quick sort

UNIT 2:

Introduction,Abstract Data Types

List ADT using Array

List ADT using Linked List Implementations

Stack ADT

Implementation of stack ADT

Applications of Stack ADT

Infix to Post fix conversion

Expression Evaluation

Queue ADT

UNIT 3:

Tree ADT

Tree Traversals - In-order traversal

Pre-order traversal

Post order traversal

Binary Tree ADT

Representation of binary tree

Applications of Trees

Binary Search Tree ADT

Routines of binary search tree

UNIT 4:

Definitions & Introduction to Graphs

Topological Sort

Breadth First Traversal

Depth First Traversal

Minimum Spanning Tree

Kruskal’s Algorithms

UNIT 5:

Introduction to Hashing

Separate Chaining

Open Addressing

Priority Queue

Binary Heap

Applications of Heap

Lecture Notes

Announcements

Recent Files

Copyright © SNS College Of Engineering 2014 Developed bySNSCE