Course

Title : C & C++ PROGRAMMING - Expert Level

Hours : 60 Hrs

Batches : Weekday ( Mon - Fri )|Weekend ( Sat & Sun )

Trisoft-Session-image

60 Hours of
Class Room Training

Trisoft-Session-image

30 Sessions of
Class Room Training

Trisoft-Session-image

90 Hours of
Coding Assignment

Trisoft-Session-image

50 Coding Tasks
For Interview Purpose

Course Overview

We provide an Expert level course in C/C++ Programming Language that covers END to END learning of C (Programming Features) & C++(Data Structures & a wide variety of Algorithms) that a Developer must know and to be skilled in to get a Software Jobs in your Dream Company. Also, you will learn various concepts like class, objects, procedure-oriented and object-oriented methodologies

Prerequisites

  • Anyone aspiring to enter into Software Programming Jobs can take this course.
  • Software Graduates looking to enter into IT field should opt for this course.
  • Good Mathematical knowledge is desirable, but not mandatory.

Batches

Weekday Batch:
9:00 AM to 11:00 AM | Monday to Friday | 5 Days/Week | 6 Weeks Course

Weekend Batch:
9:00 AM to 11:00 AM | Saturday & Sunday | 2 Days/Week | 15 Weeks Course

Curriculum

Download Curriculum
  • Class-1 : Introduction to C
  • Class-2 : Data Types
  • Class-3 : String Manipulation
  • Class-4 : Conditional Expressions & Loops
  • Class-5 : Arrays
  • Class-6 : Pointers
  • Class-7 : Storage Class
  • Class-8 : Functions
  • Class-9 : Function Pointer
  • Class-10 : Structures
  • Class-11 : Advanced Structures & Unions
  • Class-12 : Preprocessors
  • Class-13 : File Operations
  • Class-14 : Error Handling
  • Class-15 : Linked Lists
  • Class-16 : C++ - How it differs from C
  • Class-17 : Big-O Notation Analysis
  • Class-18 : Stacks: Infix, Prefix and Postfix Expressions
  • Class-19 : Queues: Simulation: Printing Tasks
  • Class-20 : Implementing Recursion: Stack Frames
  • Class-21 : Complex Recursive Problems
  • Class-22 : Sorting
  • Class-23 : Greedy Algorithms
  • Class-24 : Brute-Force Algorithms
  • Class-25 : Searching
  • Class-26 : Trees and Tree Algorithms
  • Class-27 : Binary Search Trees
  • Class-28 : Graphs and Graph Algorithms
  • Class-29 : Implementing Breadth First Search
  • Class-30 : Dijkstra’s Algorithm

Class Features