CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
Data Structures and Algorithms - MCA II SEMESTER - 2020-2021
0%
Previous
Course data
General
ASSIGNMENTS - DSA - 20MCC107
ASSIGNMENT - 1
ASSIGNMENT - 2
UNIT - I - C++ INTRODUCTION - C++ CLASS OVERVIEW
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210525-1-INTORUCTION TO C++
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210525-2-FUNCTION OVERLOADING CONCEPT
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210527-3-FUNCTION WITH DEFAULT VALUE
AY2021-PG-SEM-2-MCA-20MCC107--DSA-20210531-4-OOP CONCEPT
AY2021-PG-MCA-20MCC107-DSA-20210601-5-POLYMORPHISM AND DATA BINDING
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210602-6-SCOPE RESOLUTION OPERATOR
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210602-7- CONSTRUCTOR vs. DESTRUCTOR
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210603-8- DATA TYPES –TYPE CAST – ENUM DATA
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210608-9- DYNAMIC MEMORY – USING NEW & DELETE
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210609-10-OPERATOR OVERLOADING AND EXAMPLE PROGRAMS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210609-11- USING NAME SPACE – OPERATOR OVERLAODING PROGRAMS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210610-12- SCOPE RESOLUTION OPERATOR-USAGE-PROGRAMS
LECTURE MATERIAL - UNIT I
CPP - INTRODUCTION
FUNCTION OVERLOADING CONCEPT
INLINE FUNCTION & SAMPLE PROGRAMS USING OOP CONCEPTS
POP and OOP CONCEPTS
OOP CONCEPT CONTINUATION
CLASS CONCEPT & SCOPE RESOLUTION PURPOSE
constructor and destructor
DATA TYPES - OPERATORS - TYPE CAST - ENUM - IN C++
Mem. Allocation & Deallocation , Pointers in c++
FUN OVER - REF VAR - NAMESPACE CONCEPT - 2 & 5 hr
implementation of scope resolution operator
UNIT - II OOPS CONCEPTS - ANALYSIS OF ALGORITHMS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210615-13-FRIEND FUNCTION ADVANTAGE – PROGRAMMING IMPLEMENTATION
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210616-14-INHERITANCE CONCEPT – TYPE OF INHERITANCE
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210616-15-INHERITANCE EXAMPLE PROGRAMS – PUBLIC, PRIVATE, PROTECTED LABELS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210617-16-MULTIPLE AND MULTI LEVEL INHERITANCE WITH PROGRAMS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210622-17-HYBRID AND HEIRARCHICAL INHERITANCE WITH EXAMPLE PROGRAMS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210623-18- Importance of "this" operator - example programs - importance of activation record
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210623-19 - Linear sort -Bubble sort techniques example and implementation using C++
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210624-20 - Template concept - Types of templates - function template and class template - example programs
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210629-21 - NAME SPACE THEORY - RUNTIME POLYMORPHISM THEORY - DESIGN AND ANALYSIS OF ALGORITHMS CONCEPTS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210630 - 22 – 3rd hour - Algorithm specifications - Implementation of Selection sort technique - Symbols used in Pseudo code generation
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210630 - 23 – 5th hour - Recursive Algorithms implementation - Design - Example - TowersofHanoi - Permutations
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210701 - 24 – 1st hour - Algorithm performance evaluation - requirement of PA - Measures - Parameters - Space complexity of an algorithm
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210706 - 25 –2ND hour - TIME complexity of an algorithm – examples
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210707 - 26 – 3 RD hour TIME COMPLEXITY EVALUATION ON ALGORITHM - EXAMPLE ALGORITHMS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210707 - 27 – 5TH hour Divide and Conquere Technique - Binary search programs and algorithms
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210708 - 28 – 2nd - Backtracking algorithm - characteristics - constraints - Si & xi - Algorithm design
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210708 - 29 – 3rd hour – Backtracking problems - 4 Queen & 8 Queen problems - implementation - algorithm design
LECTURE MATERIAL - UNIT II
friend function - CONCEPT
types of inheritance - access contrls
EXAMPLE ON HYBRID INHERITANCE
EXAMPLE ON HEIRARCHICAL INHERITANCE
USING NAME SPACE - DYNAMIC BINIDING - RUNTIME POLYMORPHISM
TEMPLATE CONCEPT - TYPES OF TEMPLATES
LINEAR AND BUBBLE SORT TECHNIQUES
IMPORTANCE OF "this" OPERATOR
Algorithm specifications - Pseudo code generation - Recursive Algorithms - examples
Algorithm performance evaluation - requirement of PA - Measures - Parameters - Space complexity of an algorithm
Linear search Problem
LINEAR SORT PROBLEM
BUBBLE SORT PROGRAMS
Time complexity evaluation of an algorithm - example
TIME COMPLEXITY EVALUATION ON ALGORITHM - EXAMPLE ALGORITHMS
Divide and Conquer Technique - Binary search programs and algorithms
Backtracking problems - 4 Queen & 8 Queen problems - implementation - algorithm design
UNIT III - SPARSE MATRIX - STACKS - QUEUES - LINKED LISTS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210714 - 30 – 4th - Sparse matrix - its representation - Triplex representation and linked representation
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210714 - 31 – 5th - Stack - Operations of stack - formula based representation - abstract structure
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210715 - 32 – 1st - Stack program implementation - Introduction to Queue - Abstract data structure for Queue process
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210720 - 33 – 1st - Queue program implementation - Abstract data structure for Queue process – Queue operations
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210722 - 34 – 3RD - LINKED LIST PROCESS - OPERATIONS ON SINGLE LINKED LIST - PROGRAM
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210727 - 35 – 2ND - SINGLE WAY LINKED LIST – ABSTRACT DATA STRUCTURE – ABSTRACT DATA TYPE DECLARATION – CONSTRUCTOR AND DESTRUCTOR WITH CODE
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210728 - 36 – 5TH - SINGLE WAY LINKED LIST OPERATIONS – INSERTION – DELETION – FIND – SERARCH – LENGTH AND OUTPUT OPERATIONS CODING
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210729 - 37 – 1st - SINGLE WAY LINKED LIST - DELETION OF A NODE – DISPLAYING DATA IN FIFO AND LIFO ORDERS.
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210731 - 38 – 5th hour – Extra class - INTORDUCTION TO DOUBLE WAY LINKED LIST - APPLICATIONS OF QUEUE, STACKS, LINKED LISTS – TIME AND SPACE COMPLEXITY FOR VARIOUS SORTING AND SEARCHING TECHNIQUES
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210803 - 39 – 2ND hour – SINGLE WAY LINKED LIST CREATION AND OPERATIONS – INSERT - DELETE – FIND – SEARCH – ISEMPTY – LENGTH – etc.
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210803 - 40 – 3rd hour – SINGLE WAY LINKED LIST CREATION AND PROCESSING ELEMENTS IN FIFO AND LIFO ORDERS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210804 - 41 – 3RD hour – Node Deletion operation in DDL - Circular linked list Representation - Single way circular - Double way circular linked list.
LECTURE MATERIAL - UNIT III
Sparse matrix - its representation - Triplex representation and linked representation
Stack - Operations of stack - formula based representation - abstract structure
Stack program implementation - Introduction to Queue - Abstract data structure for Queue process
Queue Abstract data type using class and program
LINKED LIST REPRESENTATION - OPERATIONS
SINGLE WAY LINKED LIST AND ITS OPERATIONS
STRUCTURE OF SLL (LIFO)
SINGLE WAY LINKED LIST (FIFO ) STRUCTURE
SINGLE LINKED LIST OPERATION AND LIFO LIST
DOCUMENT FOR DOUBLE WAY LINKED LIST - APPLICATIONS OF STACKS, QUEUES , LINKED LISTS - TIME AND SPACE COMPLEXITY FOR VARIOUS SORTING AND SEARCHING TECHNIQUES
DOUBLE WAY LINKED LIST OPERATIONS
DOUBLE WAY LINKED LIST CREATION AND FIFO - LIFO OUTPUT
Circular linked list operations
Sorting Introduction - method of sorting
UNIT - IV SORTING - HASHING
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210804 - 42 – 5th hour – IV unit Introduction - Sorting Techniques - linear - bubble - selection - insertion - programming on insertion sort technique
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210809 - 43 – 1st hour – Quick Sort algorithm – Example – Implementation – C++ programming for Quick Sort method
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210810 - 44 –2ND hour – MERGE Sort algorithm – Example – Implementation – C++ programming for Merge Sort method
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210811 - 45 –3RD hour – HEAP Sort algorithm – Example – Implementation – C++ programming for HEAP Sort method
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210812 - 46 –1st hour – Hashing Technique - Hash table - Hash value formula - Hash function - Collision Handling techniques
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210814 - 47 –2ND hour – Hashing Technique - EXAMPLES -Collision Handling techniques – linear probing – linked representation.
LECTURE MATERIAL - UNIT IV
sorting concepts- several sorting methods
Insertion sort technique - examples
Quick sort Algorithm - Example Implementation - Theory - Programming using C++
Bubble sort - Insertion Sort techniques
Merge sort Technique - Programming using C++
Heap sort method - theory - Example and program using C++
Hashing Technique - Hash table - Hash value formula - Hash function - Collision Handling techniques
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210814 - 47 –2ND hour – Hashing Technique - EXAMPLES -Collision Handling techniques – linear probing – linked representation.
UNIT - V TREES - GRAPHS
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210814 - 48 – 3rd hour – Trees – Definition – Binary tree representation – examples - formula presentation - Definitions
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210817 - 49 –2ND hour – Binary tree Structure - Difference between tree and binary tree - Properties of Binary tree - Binary tree creating for the given formula
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210818 - 50 – 3RD hour – Binary tree construction with numerical inputs - Accessing data in inorder, preorder and postorder using examples
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210818 - 51 – 5TH hour – programming and execution of binary tree traversal techniques - insertion - deletion - search operations
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210819 - 52 – 1ST hour – Representation of formula in Inorder - preorder and postorder - conversions - Introduction to graph theory
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210824 - 53 – 2ND hour – Revision on earlier topics with introduction to graphs
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210825 - 54 – 3RD hour – Graph theory - directed - undirected - complete - bipartite - sub graph - incident - adjacent - path and other definitions
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210825 - 55 – 5th hour – Asymptotic notations - purpose-Big O, Omega, Theta notations - time complexity of various search and sort techniques
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210826 - 56 – 1st hour – Graph representation using 3 methods - 1. Matrix Representation 2. List representation 3. Multi list representation
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210826 - 57 – 3rd hour – Graph Search techniques - Depth first search - Breadth first search - Comparison - examples
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210826 - 58 – 5th hour – AVL trees - properties - heigh balancing - Insertion of a node - searching - algorithm - examples
AY2021-PG-SEM-2-MCA-20MCC107-DSA-20210902 - 59 – 1st hour – Minimal spanning tree – Kruskal’s Algorithm - examples
LECTURE MATERIAL - UNIT V
Trees Introduction - Types of trees - Operations on Tree for formula representation - Definitions of Tree
Binary tree Structure - Difference between tree and binary tree - Properties of Binary tree - Binary tree creating for the given formula
programming and execution of binary tree traversal techniques - insertion - deletion - search operations
Binary tree construction with numerical inputs - Accessing data in inorder, preorder and postorder using examples
Introduction to graph theory
Representation of formula in Inorder - preorder and postorder - conversions
Asymptotic notations - purpose-Big O, Omega, Theta notations - time complexity of various search and sort techniques
Graph theory - directed - undirected - complete - bipartite - sub graph - incident - adjacent - path and other definitions
Graph representation using 3 methods - 1. Matrix Representation 2. List representation 3. Multi list representation
AVL trees - properties - heigh balancing - Insertion of a node - searching - algorithm - examples
Graph Search techniques - Depth first search - Breadth first search - Comparision - examples
Minimal spanning tree - Krushkal's Algorithm - examples
Next
CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
Side panel
Log in
Username
Password
Remember username
Forgot Password?
Log in
Data Structures and Algorithms - MCA II SEMESTER - 2020-2021
Home
Skip to main content
Course info
Home
Courses
MCA
AY 2020 - 2021
MCA II Semester 2020-2021
Data Structures and Algorithms - MCA II SEMESTER - 2020-2021
Summary
Data Structures and Algorithms - MCA II SEMESTER - 2020-2021
Data Structures and Algorithms - MCA II SEMESTER - 2020-2021
Teacher:
Dr. K. S. Sadasiva Rao Professor
Skill Level
:
Beginner