uLektz logo
login images close

Verify Account

A Verification Code has been sent to you registered email address shown below. Please enter the code to verify your account. You may edit the email address, if it is incorrect

Resend Code

Note: Please check your Spam or Junk folder, in case you didn't receive the email with verification code.

Learning Path

Linear: Sequential Order

About the Course

Course Description

This course provides students with concepts of String Handling, Polymorphism, Copy Constructor, Dynamic memory allocation, Standard libraries, Function adaptors and Parameterizing the class

Objectives 

1.Will familiarize about AVL trees

2.Will demonstrate Red-Black trees, Fibonacci Heaps and Amortized Analysis

3.Will develop knowledge in Kruskal and Prim algorithm

Prerequisite

There is no particular prerequisite to learn Programming and data structure 2, you will be able to do very well, if you have these basic skills: 

1. Basic Programming Skills

2. Good Understanding Skills

3. Good Communication Skills

.

Course Study Materials
Module 1: OBJECT ORIENTED PROGRAMMING FUNDAMENTALS
  • 1.1 C++ Programming features
  • 1.2 Encapsulation
  • 1.3 Object
  • 1.4 Constructors
  • 1.5 Static members
  • 1.6 Pointers
  • 1.7 Storage classes
  • OBJECT ORIENTED PROGRAMMING FUNDAMENTALS - ASSESSMENT 10 Questions
Module 2: OBJECT ORIENTED PROGRAMMING CONCEPTS
  • 2.1 String Handling
  • 2.2 Copy Constructor
  • 2.3 Polymorphism
  • 2.4 Operators overloading
  • 2.5 Dynamic memory allocation
  • 2.6 Nested classes
  • 2.7 Inheritance
  • 2.8 Virtual functions
  • OBJECT ORIENTED PROGRAMMING CONCEPTS - ASSESSMENT 10 Questions
Module 3: C++ PROGRAMMING ADVANCED FEATURES
  • 3.1 Abstract class
  • 3.2 Standard libraries
  • 3.3 Templates
  • 3.4 STANDARD TEMPLATE LIBRARY(STL)
  • 3.5 Function adaptors
  • 3.6 Parameterizing the class
  • C++ PROGRAMMING ADVANCED FEATURES - ASSESSMENT 10 Questions
Module 4: ADVANCED NON-LINEAR DATA STRUCTURES
  • 4.1 TREE INTRODUCTION
  • 4.2 AVL trees
  • 4.3 B-Trees
  • 4.4 Red-Black trees
  • 4.5 Splay trees
  • 4.6 Fibonacci Heaps
  • 4.7 Amortized Analysis
  • ADVANCED NON-LINEAR DATA STRUCTURES - ASSESSMENT 10 Questions
Module 5: GRAPHS
  • 5.1 Representation of Graphs
  • 5.2 Breadth-first search
  • 5.3 Topological sort
  • 5.4 Kruskal and Prim algorithm
  • 5.5 Shortest path algorithm
  • 5.6 Bellman-Ford algorithm
  • GRAPHS - ASSESSMENT 10 Questions
FINAL ASSESSMENT
  • FINAL ASSESSMENT 20 Questions

The certificate issued for the Course will have the student's Name, Photograph, Course Title, Certificate number, Date of course completion and the name(s) and logo(s) of the Certifying Bodies. Only the e-certificate will be made available. No Hard copies. The certificates issued by uLektz Learning Solutions Pvt. Ltd. can be e-verifiable at www.ulektzskills.com/verify.

  • Students are required to take online assessments with eProctoring.
  • Students will be assessed both at the end of each module and at the end of the Course.
  • Students scoring a minimum of 50% in the assessments are considered for Certifications
certificate
...
₹299
Features:
  • 80 hours Learning Content
  • 100% online Courses
  • English Language
  • Certifications

Course

Registration opens on 04-02-2019

Course

Your registration details are under review. It should take about 1 to 2 working days. Once approved you will be notified by email and then you should be able to access the course.

Course Approved

Approval Pending - In-Progress

Course access details will be shared within 24 hours.
For help contact: support@ulektz.com

Course Enrollment

Course

Course starts on 11-05-2021

Course

You have completed 6 hours of learning for 06-12-2021. You can continue learning starting 07-12-2021.

Course

This course can only be taken in sequential order.

Course

You have completed the course. You will be notified by email once the certificate is generated.

Course

Are you sure want to enroll this course?.

Course

Course

S.no Date Title Reason

Result Summary

Programming and data structure 2