Gain insights into dynamic memory allocation, creating classes, and functions. Delve into inheritance, I/O, exception handling. Explore 90+ examples to master advanced C++ functionalities.

c.tar.gz

ConsoleInputJob

IOjob83

IOjob84

Lesson26and27

If you’re looking to sharpen up your C++ programming skills, then you’re in the right place. You will start with learning about dynamic memory allocation, how to create classes, and constructors. 

In the latter half of the course, inheritance, functions, I/O, exception handling, and more. Throughout the course, you will study over 90 carefully designed examples aimed to enhance your understanding of the C++ language.  

By the time you finish this course, you will be able to use more advanced functionality in your C++ programs.

C++ Programming for Experienced Engineers

## Challenge

Write a program to find the index of the first term in the Fibonacci sequence to contain 10 digits?

For this problem, you will have to write two functions:

**1.** `countdigits ( )`

This function takes an integer and returns the number of digits in that integer.

**2.** `printNumberandIndex ( )`

This function creates a Fibonacci sequence and checks whether the latest number generated in the sequence has 10 digits using the **countdigits()** method.



## Example

The Fibonacci sequence is defined by the recurrence relation:

F( n )= F ( n − 1 ) + F ( n − 2 ), where F( 1 ) = 1 and F( 2 ) = 1.

Hence the first 12 terms will be:

F( 1 ) = 1

F( 2 ) = 1

F( 3 ) = 2

F( 4 ) = 3

F( 5 ) = 5

F( 6 ) = 8

F( 7 ) = 13

F( 8 ) = 21

F( 9 ) = 34

F( 10 ) = 55

F( 11 ) = 89

F( 12 ) = 144

The 12th term, F( 12 ), is the first term to contain three digits.

## Coding exercise

Try to solve this challenge on your own. If you can’t solve it, you can look at the solution and explanation below.

# Challenge

Write a program to find the index of the first term in the Fibonacci sequence to contain 10 digits?

For this problem, you will have to write two functions:

**1.** `countdigits ( )`

This function takes an integer and returns the number of digits in that integer.

**2.** `printNumberandIndex ( )`

This function creates a Fibonacci sequence and checks whether the latest number generated in the sequence has 10 digits using the **countdigits()** method.



# Example

The Fibonacci sequence is defined by the recurrence relation:

F( n )= F ( n − 1 ) + F ( n − 2 ), where F( 1 ) = 1 and F( 2 ) = 1.

Hence the first 12 terms will be:

F( 1 ) = 1

F( 2 ) = 1

F( 3 ) = 2

F( 4 ) = 3

F( 5 ) = 5

F( 6 ) = 8

F( 7 ) = 13

F( 8 ) = 21

F( 9 ) = 34

F( 10 ) = 55

F( 11 ) = 89

F( 12 ) = 144

The 12th term, F( 12 ), is the first term to contain three digits.

# Coding exercise

Try to solve this challenge on your own. If you can’t solve it, you can look at the solution and explanation below.

Learn to generate the Fibonacci sequence. 

Fibonacci Sequence

Learn to generate the Fibonacci sequence.

Getting Off the Ground

Starters

Basic C++ Examples

Class Organization Examples

Class Constructor Examples

Classes and Objects Examples

More Classes and Objects Examples

Function Examples

Function Overloading Examples

Operator Overloading Examples

Free Store Examples

Inheritance Examples

Virtual Function Examples

Input Output Examples

Template Examples

Exception Handling Examples

STL Examples

Miscellaneous Examples

Conclusion

Fibonacci Sequence

Challenge