Note: Please check your Spam or Junk folder, in case you didn't receive the email with verification code.
Non-Linear: Random Order
Dear Students
This course is offered under Syllabus Completion program. It will help the students to revise and summarize your core topics for better preparation for semester exam. The course scheduled for 15 to 20 hours to covers the core topics by the faculty those who are currently teaching this course
Schedule for DATA STRUCTURES
Course Faculty : V.Saravanakumar
Live teaching from 3rd June 2020 to 11th June 2020
Registration from on 7th May 2020 to 2nd June 2020
Topics Focused On
Singly linked lists
Circularly linked lists
Doubly-linked lists – applications of lists
Polynomial manipulation
Stack adt – operations
Evaluating arithmetic expressions
Conversion of infix to postfix expression
Queue adt – operations – circular queue
Tree ADT – tree traversals
Expression trees
Avl trees
B-tree – b+ tree
Heap – Applications of heap
Types of graph – Breadth-first traversal – Depth-first traversal
Topological Sort – Bi-connectivity
Searching- linear search – binary search
Sorting – Bubble so1rt – Selection sort
Insertion sort – Shell sort
Hashing- hash functions – separate chaining – open addressing
Features
Online live Teaching
Limited Participants Only
Taught by Experts those who are teaching the syllabus Currently
Selected and core Topics will be handled
Lecture Notes will be provided
Question Banks will be provided
For Further Details
Dr.A.Clementking
Director
INTEGRATED INTELLIGENT RESEARCH (IIR)
No 29 E, Sarojammal Complex 1st Floor,Keelkattalai, Chennai - 600117,
Mobile : +91 -9884568399 ;+91 9791163515. Email : iirindia2020@gmail.com
Web : www.iirgroups.org
.
Singly linked lists circularly linked lists on 03-06-2020 Wednesday 11AM-12NN
Doubly-linked lists – applications of lists on 03-06-2020 Wednesday 12NN-1PM
Polynomial Manipulation on 04-06-2020 Thursday 11AM-12NN
Stack ADT – Operations Evaluating arithmetic expressions Conversion of Infix to postfix expression on 05-06-2020 Friday 11AM-12NN
Queue ADT – Operations – Circular Queue on 05-06-2020 Friday 12NN-1PM
Tree ADT – tree traversals expression trees on 06-06-2020 Saturday 11AM-12NN
AVL Trees on 06-06-2020 Saturday 12NN-1PM
B-Tree – B+ Tree on 08-06-2020 Monday 11AM-12NN
Heap – Applications of heap on 08-06-2020 Monday 12NN-1PM
Types of graph – Breadth-first traversal – Depth-first traversal on 09-06-2020 Tuesday 11AM-12NN
Topological Sort – Bi-connectivity on 09-06-2020 Tuesday 12NN-1PM
Searching- Linear Search – Binary Search on 10-06-2020 Wednesday 11AM-12NN
Sorting – Bubble so1rt – Selection sort on 10-06-2020 Wednesday 12NN-1PM
Insertion sort – Shell sort on 11-06-2020 Thursday 11AM-12NN
Hashing- Hash Functions – Separate Chaining – Open Addressing on 11-06-2020 Thursday 12NN-1PM
The certificate issued for the Course will have
Only the e-certificate will be made available. No Hard copies. The certificates issued by Integrated Intelligent Research . can be e-verifiable at www.ulektzskills.com/verify.