Abstract

Basic concepts

CHARACTER ARRAY

In case of integer array, on printing the array name directly we get the address of array, whereas in case of char array we get the elements of the array unless it finds a NULL. (This is because of operator overloading).
In case of character array we don't need to use loop to take input.
Reading Sentences:
- cin doesnot input spaces.
- use cin.get() [It reads a single character at a time].
- cin.getline(array,maxlength,delimiter).
Palindromic String:
- Start comparing with the first and last character.
Remove consecutive duplicate characters from a string.
Find the largest string and it's length.

Memory Allocation in C++

Static Allocation
- Also known as compile time allocation
- Sizes and locations are fixed during the compile time.
- Fast but less flexible.
- Allocation and deallocation is done by compiler itself.
Dynamic
- Also known as run time allocation
- Allows to define memory size during execution of the program.
- Uses heap memory. (Dynamic part of the memory).
- Reusable memory.
- new is used to allocate the memory, delete is used to free the memory.
- Allocation and deallocation is done by programmer.

Pointers

&

Finds address of variable.
Returns address in hexadecimal value.
It doesn't work for character variables.
- It will return the char value instead of address.
- This is because of operator <<.
- To get the address we can do explicit typecasting! cout<<(void*)&ch;

Storing address

To store the address of another variable we need to create a pointer variable.
It will be of the type datatype* variablename
- Example: int* y = &x (Declaration with innitialization)
Space occupied to store the address of variable will be same irrespective of datatype.

Name		Name	Last commit message	Last commit date
Latest commit History 79 Commits
Number Theory		Number Theory
OOPS		OOPS
Recursion and Backtracking		Recursion and Backtracking
Strings		Strings
Vector		Vector
.gitignore		.gitignore
Dynamic Memory Allocation notes.pdf		Dynamic Memory Allocation notes.pdf
Function overriding.md		Function overriding.md
Generic programming iterator.cpp		Generic programming iterator.cpp
Pointer and Memory notes (Stanford CS).pdf		Pointer and Memory notes (Stanford CS).pdf
Pointers notes.pdf		Pointers notes.pdf
README.md		README.md
References in C++ notes.pdf		References in C++ notes.pdf
Time complexiy notes.pdf		Time complexiy notes.pdf
address of operator.cpp		address of operator.cpp
big-o-cheatsheet.pdf		big-o-cheatsheet.pdf
cinget.cpp		cinget.cpp
dereference operator.cpp		dereference operator.cpp
factorial and ncr function.cpp		factorial and ncr function.cpp
iterator (stl).cpp		iterator (stl).cpp
lower bound for sorting.md		lower bound for sorting.md
pass by reference using pointer.cpp		pass by reference using pointer.cpp
pointer.cpp		pointer.cpp
pointers.cpp		pointers.cpp
sorting algorithm cheatsheet.jpeg		sorting algorithm cheatsheet.jpeg
sorting complexities and stabilities.md		sorting complexities and stabilities.md
stl (algo_binarySearch_lower_upper).cpp		stl (algo_binarySearch_lower_upper).cpp
stl (algo_find).cpp		stl (algo_find).cpp
stl (algo_money).cpp		stl (algo_money).cpp
stl (algo_moneyChange_problem).cpp		stl (algo_moneyChange_problem).cpp
stl (algo_next_permutation).cpp		stl (algo_next_permutation).cpp
stl (algo_other_methods).cpp		stl (algo_other_methods).cpp
stl (algo_pair_stl).cpp		stl (algo_pair_stl).cpp
template.cpp		template.cpp
type conversion.cpp		type conversion.cpp

sanyathisside/Abstract

Folders and files

Latest commit

History

Repository files navigation

Abstract

Basic concepts

CHARACTER ARRAY

Memory Allocation in C++

Pointers

&

Order Complexity Analysis

About

Topics

Resources

Stars

Watchers

Forks

Languages