• Hinjawadi Pune: +91 7410071951/ 9881208115
  • Marketyard Pune: +91 7410071953/ 9881208115
  • Karad: +91 9561213447/ 9881208114

Data Structures and Algorithms - 65% Discount

Course Name : Data Structures and Algorithms - 65% Discount

Batch Schedule : 07-May-2020   To   29-May-2020

Schedule : Weekdays (Mon-Sat)

Duration : 54 Hrs

Timings : 06:30 PM  To  09:30 PM

Fees : Rs. INR 9500/- 3300/- (Inclusive GST)

  • Students
  • Fresher's
  • Working professionals
Click to Register
  • Algorithm Analysis:
    • Time complexity
    • Space complexity
  • Introduction to STL:
    • Containers: stack, queue, list & vector
    • Algorithms & Iterators
  • Linked List:
    • Array advantages and disadvantages
    • Linked List concept
    • Linear Singly Linked List
    • Circular Singly Linked List
    • Linear and Circular Doubly Linked List
    • Complexity analysis of Linked List operations
  • Stack:
    • Stack concept
    • Stack using Array
    • Stack using Linked List
    • Expression conversion & evaluation (prefix, infix and postfix)
    • Parenthesis balancing
    • Complexity analysis of Stack operations
  • Queue:
    • Queue concept & types
    • Queue using Array
    • Queue using Linked List
    • Complexity analysis of Queue operations
  • Sorting:
    • Selection sort
    • Bubble sort
    • Insertion sort
    • Quick sort
    • Merge sort
    • Heap sort
    • Complexity analysis of sorting algorithms
  • Searching:
    • Linear Search
    • Binary Search
    • Hashing
    • Complexity analysis of searching algorithms
  • Tree:
    • Tree concept & types
    • Tree traversal (Inorder, Preorder and Postorder)
    • Binary Search Tree (BST) implementation
    • BST: add node, traversal, delete node, balancing, BFS & DFS.
    • Complexity analysis of BST algorithms
  •  Graph:
    • Graph concept & types
    • Adjacency Matrix implementation
    • Adjacency List implementation
    • Spanning Tree algorithms: Prim’s MST, Kruskal’s MST
    • Shortest Path algorithms: Dijkstra, Bellaman Ford, Warshal Floyd
    • Search algorithms: BFS, DFS
    • Complexity analysis of Graph algorithms
Click to Register
  • C++ Programming: Class, Object, Constructor, Destructor, Dynamic memory allocation (new & delete operator), Templates.
Click to Register
  • Understand common data structures (array, linked list, stack & queue) and their applications.
  • Learn advanced data structures (trees & graphs) and their operations.
  • Implement data structures and algorithms using C++.
Click to Register
  • Any IDE & compiler for C++
  • May use online editor
Click to Register
  • Code along with trainer in live class.
  • Assignments will be given for self practice.
  • Learn to code data structure & algorithm in C++.
  • Java codes will be shared at the end of session.
Click to Register
Sr.No Batch Code Start Date End Date Time
1 DSA-O-01 07-May-2020 29-May-2020 06:30 PM  To  09:30 PM

Schedule : Weekdays (Mon-Sat)

Click to Register

Contact us

Sunbeam Market Yard Pune

'Sunbeam Chambers', Plot No.R/2, Market Yard Road, Behind Hotel Fulora, Gultekdi,    Pune - 411 037. MH-INDIA.

+7410 071 953 / 020-2426 0308
Sunbeam Hinjawadi Pune

Authorized Training Center of C-DAC

"Sunbeam IT Park", Phase 2 of Rajiv Gandhi Infotech Park,Hinjawadi, Pune - 411057, MH-INDIA

+7410 071 951 / 020- 6193 0400
Sunbeam Karad

Authorized Training Center of C-DAC

'Anuda Chambers', 203 Shaniwar Peth, Near Gujar Hospital, Karad - 415 110,     Dist. Satara, MH-INDIA.

02164 - 225500 / 225800