101 Challenges In C++ Programming
Solve 101 Challenges to sharpen C++ Programming skills
Yashavant Kanetkar,Aditya Kanetkar
- English
- ePUB (mobile friendly)
- Available on iOS & Android
101 Challenges In C++ Programming
Solve 101 Challenges to sharpen C++ Programming skills
Yashavant Kanetkar,Aditya Kanetkar
About This Book
Practice them to be a mature a C++ programmerVery often it is found that while creating C++ programs programmers are simply doing C programming with a C++ compiler. As a result, they are unable to exploit the real power that C++ lays at their door steps. Also there are not enough challenges/problems available in text books that would test the programmer' understanding of C++ and OOP concepts. To address these issues Authors have crafted well thought out this book. Their complete solution, sample runs and explanation. These challenges would test and improve your knowledge in every aspect of C++ programming.KEY FEATURES• Strengthens the foundations, as detailed explanation of programming language concepts are given.. • Lists down all important points that you need to know related to various topics in an organized manner.• Prepares you for coding related interview and theoretical questions.• Provides In depth explanation of complex topics and Questions.• Focuses on how to think logically to solve a problem.• Follows systematic approach that will help you to prepare for an interview in short duration of time. WHAT WILL YOU LEARN• Basic C++, Class organization, Class constructor, Classes and Objects, Function challenges• Function, Operator overloading challenges• Free store, Inheritance, Virtual function, Input/output, Exception handling, STL challenges WHO THIS BOOK IS FORStudents, Programmers, researchers, and software developers who wish to learn the basics of C programming language.
Frequently asked questions
Information
07
More Classes and Objects Challenges
Challenges: 6
Challenge 43
Solution
// Project: chall43
// Array operations
#include <iostream>
using namespace std;
const int MAX = 5;
class array
{
private:
int arr[ MAX ];
public:
void insert (int pos, int num);
void del (int pos);
void reverse(); void display();
void search (int num);
};
// inserts an element num at given position pos
void array:: insert (int pos, int num)
{
int i;
// shift elements to right
for (i = MAX - 1; i >= pos; i--)
arr[ i ] = arr[ i - 1 ]; arr[ i ] = num;
}
// deletes an element from the given position pos
void array:: del (int pos)
{
int i;
// skip to the desired position
for (i = pos; i < MAX; i++)
arr[ i - 1 ] = arr[ i ];
arr[ i - 1 ] = 0;
}
// reverses the entire array
void array:: reverse()
{
int i;
for (i = 0; i < MAX / 2; i++)
{
int temp = arr[ i ];
arr[ i ] = arr[ MAX - 1 - i ];
arr[ MAX - 1 - i ] = temp;
}
}
// searches array for a given element num
void array:: search (int num)
{
int i;
// Traverse the array
for (i = 0; i < MAX; i++)
{
if (arr[ i ] == num)
{
cout << “\n\nThe element” << num
<< “ is present at” << (i + 1) << “th position\n”;
return;
}
}
if (i == MAX)
cout << “\n\nThe element” << num
<< “ is not present in the array\n”;
}
// displays the contents of an array
void array:: display()
{
cout << endl;
// traverse the entire array
for (int i = 0; i < MAX; i++)
cout << “” << arr[ i ];
}
int main()
{
array a;
a.insert (1,11);
a.insert (2,12);
a.insert (3,13);
a.insert (4,14);
a.insert (5,15);
cout << “\nElements of Array: “;
a.display();
a.del (5);
a.del (2);
cout << “\n\nAfter deletion: “;
a.display();
a.insert (2, 222);
a.insert (5, 555);
cout << “\n\nAfter insertion: “;
a.display();
a.reverse();
cout << “\n\nAfter reversing: “;
a.display();
a.search (222);
a.search (666);
return 0;
}