Chandrashekhar Keeli India

iconComputer Programming, Teaching, Data Structures, C++, HTML5, Database Management

iconKannada, English, Hindi

icon
icon

About Me

Offering

4000 per course, 10,000 if all three courses taken as combo. Available timing 6pm to 8pm IST
Curriculum

C Programming Syllabus

1. Introduction to C

  • History & features of C

  • Structure of a C program

  • Compilation & execution

2. Basics

  • Variables, constants, keywords, identifiers

  • Data types & type modifiers

  • Input/Output (printf, scanf, gets, puts)

3. Operators & Expressions

  • Arithmetic, relational, logical, bitwise operators

  • Precedence & associativity

  • Type casting

4. Control Structures

  • Conditional statements (if, if-else, switch)

  • Loops (for, while, do-while)

  • Break, continue, goto

5. Functions

  • Function definition, declaration, and call

  • Recursion

  • Storage classes (auto, extern, static, register)

6. Arrays & Strings

  • 1D, 2D arrays

  • Character arrays & string handling functions

7. Pointers

  • Pointer basics, pointer arithmetic

  • Pointers with arrays, functions, and strings

  • Double pointers

8. Structures & Unions

  • Defining and using structures

  • Nested structures

  • Unions, typedef, enumerations

9. File Handling

  • File opening, closing, reading, writing

  • Random access files

10. Advanced Topics

  • Dynamic memory allocation (malloc, calloc, free, realloc)

  • Command-line arguments

 

C++ Programming Syllabus

1. Introduction to OOP & C++

  • Procedural vs. Object-Oriented programming

  • C++ syntax basics

2. Classes & Objects

  • Defining classes & objects

  • Access specifiers (public, private, protected)

  • Constructors & destructors

3. Functions in C++

  • Function overloading

  • Inline functions

  • Default & constant arguments

4. Operator Overloading

  • Overloading unary & binary operators

  • Friend functions

5. Inheritance

  • Types of inheritance (single, multiple, multilevel, hierarchical, hybrid)

  • Virtual base classes

6. Polymorphism

  • Function overriding

  • Virtual functions & pure virtual functions (abstract classes)

7. Templates

  • Function templates

  • Class templates

8. Exception Handling

  • Try, catch, throw

  • Handling multiple exceptions

9. Advanced C++

  • File I/O in C++

  • Namespaces

  • Standard Template Library (STL: vectors, lists, maps, stacks, queues)

  • Smart pointers (unique_ptr, shared_ptr) 

 

Algorithms Syllabus

1. Basics

  • Algorithm definition, properties

  • Time & space complexity

  • Asymptotic analysis

2. Divide & Conquer

  • Binary search

  • Merge sort, Quick sort

  • Matrix multiplication (Strassen’s)

3. Greedy Algorithms

  • Activity selection

  • Huffman coding

  • Minimum Spanning Trees (Prim’s, Kruskal’s)

  • Dijkstra’s algorithm

4. Dynamic Programming

  • Fibonacci sequence

  • Longest Common Subsequence (LCS)

  • Matrix chain multiplication

  • Knapsack problem (0/1, fractional)

  • Bellman-Ford algorithm

5. Graph Algorithms

  • BFS, DFS

  • Topological sorting

  • Floyd-Warshall algorithm

  • Minimum spanning tree (Prim’s, Kruskal’s)

6. Backtracking

  • N-Queens problem

  • Graph coloring

  • Hamiltonian cycle

  • Sudoku solver

Available timing 6pm to 8pm IST

Resume

PDA College of Engineering
Bachelor of Technology
Computer Science and Engineering
2012 — 2017
Programming Languages
GURUKUL COMPUTER INSTITUTE
Teacher
Teach the concepts and Conduct the Labs
September 2017 — February 2022
No certification found.
A logo of an arrow shape