[go: up one dir, main page]

0% found this document useful (0 votes)
105 views11 pages

C++: Basics and Beyond

The document discusses core and advanced concepts in C++, including basic concepts like if/else statements, loops, functions, pointers and strings. It also covers advanced topics like recursion, backtracking, arrays and structures. Finally, it details various data structures in C++ such as linked lists, stacks, queues, vectors, binary trees, binary search trees, and heaps.

Uploaded by

ujjwal jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
105 views11 pages

C++: Basics and Beyond

The document discusses core and advanced concepts in C++, including basic concepts like if/else statements, loops, functions, pointers and strings. It also covers advanced topics like recursion, backtracking, arrays and structures. Finally, it details various data structures in C++ such as linked lists, stacks, queues, vectors, binary trees, binary search trees, and heaps.

Uploaded by

ujjwal jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

C++ : Basics and Beyond

Core and Advanced Concepts of C++


Basic cocepts of C++

• If-else: Used for instruction


control and decision
making.

• Loops(for, while, do-while):


Used for repeating
particular tasks upto a
limit.
Basic cocepts of C++

• Switches: An efficient form


of if-else ladder which
provides more flexibility
and reduces indentation.
• Functions: Optimised way
of performing a task
without rewriting the code
again and again.
Basic cocepts of C++

• Pointers: Stores address


of a variable and helps in
tracking changes at that
address.
• Strings: Strings represent
sequence of characters.
many operations can be
performed on strings like
comparison, concatenation
etc.
Advanced Concepts of C++

• Recursion: When a
function calls itself to
accomplish a task, it is
called recursion.
• Backtracking: General
algorithmic technique that
considers searching every
possible combination to
solve a computational
problem.
Advanced Concepts of C++

• Array: An array is
collection of same data
types in contiguous
memory locations.
• Structure: A structure is
basically a user defined
data type in C++.
Data Structures in C++

• Link List: It is a linear data


structure in which
elements are not stored at
continuous locations rather
are connected by pointers.
• Stacks: These are a type
of container adaptors with
LIFO(Last In First Out)
type of working.
Data Structures in C++

• Queues: These are a type


of container adaptors with
FIFO(First In First Out)
type of working.
• Vectors: These are
dynamic arrays with the
ability to resize itself
automatically when an
element is inserted or
deleted.
Data Structures in C++

• Tree(Binary): It is a non-linear data structure in which


each node can have upto 2 connections(children).
• BST(Binary Search Tree): This is a binary tree with
following properties:-
1) The left subtree of a node contains only nodes with keys
lesser than the node’s key.
2) The right subtree of a node contains only nodes with
keys greater than the node’s key.
Data Structures in C++

3) The left and right subtree each must also be a binary


search tree.
• Heap: A Heap is a special Tree-based data structure in
which the tree is a complete binary tree. Generally, Heaps
can be of two types:
1) Max-Heap: In a Max-Heap the key present at the root
node must be greatest among the keys present at all of it’s
children.
Data Structures in C++

2) Min-Heap: In a Min-Heap
the key present at the root
node must be minimum
among the keys present at
all of it’s children.

You might also like