1 / 12

C training institute ameerpet hyderabad

Sathya Tech's concise C, C & Data Structures course structure covers all the essential features of the programming language.

sathya111
Download Presentation

C training institute ameerpet hyderabad

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Mail Us:sathyainhyd@gmail.comCall Us: 65538958 /65538968 / 65538978 C: Introduction to Computers Computer Generations Block Diagram & I/O Devices Hardware and Software Operating System Introduction to ‘C’ History and Generations of Language Algorithms Flowcharts Evaluation of ‘C’

  2. Basics of ‘C’ • Character set • Keywords and identifiers • Constants and variables • Data Types • Type Conversion • Structure of ‘C’ Program • Execution of ‘C’ under MS-Dos. • Unix / Linux • Operators of ‘C’ • Arithmetic • Assignment • Relational • Logical • Bitwise • Conditional • Special • Precedence of Operators • Control Statements • If Statements • Switch Statements • Nested Switch / If • While loop • For loop • Do-while loop • Nested switch / if • Nested loops

  3. Arrays • One Dimensional • Two Dimensional • Multi Dimensional • Strings • String Operations • String handling functions • Structures & Unions • Accessing Structure elements • Structure initialization • Array of structures • Nested structures • Unions • Typedef • Enumeration • Preprocessor and macro • Functions • Types of functions • Function prototype • Function with arguments and • return value • Passing arrays as arguments • Passing string as arguments • Call by value • Call by reference • Recursion

  4. Searching and sorting • Selection sort • Insertion sort • Merge sort • Sequential sort • Radix sort • Bubble sort • Quick sort • Heap sort • Linear search • Binary search • 11.Pointers • Advantages of pointers • Types of pointers • Pinter arithmetic • Pointer to arrays • Pointer to string • Structure to pointer • Pointer to pointer • Dynamic memory Allocation • Malloc(), Calloc() • Realloc(), & Free() • Command line arguments

  5. File handling • Operating a file • File I/O • Character I/O • Line I/O • Format I/O • Structure I/O • Random Access file processing • DS: • Data structures • Classification of data structures • List • Linear • Non Linear • Linked list • Single Linked list • Double Linked list • Singly circular List • Doubly circular List • Operations on Linked list • Insert • Delete • Search • Sort • Traverse • Modify • Merge

  6. Stacks • Implementation of stacks • Operations on stack • Application on stack • Infix, Postfix & Prefix • Queues • Implementation of Queues • Operation on Queues • Application on Queues • Circular Queues • Dequeue • Priority Queue • Non Linear data structures • Trees • Binary trees • Binary search tree • Tree traversals • Inorder • Preorder • Postorder • Operations on Binary trees • Insert, Delete & Modify • Graphs • Breadth first search and traversal • Depth first search and traversal • FAQS

  7. C++ • Introductions • Disadvantage of C • Evaluation of C++ • Differences between C&C++ • Features of C++ • C++Fundamentals • Character set • Data types in C++ • Structure of C++ • Operators in C++ • Control Statements • Conditional statements • Un Conditional statements • Switch statements • Nested if • Nested switch • Multi dimensional • String library functions

  8. Loops • While • For • Do While • Nested Loops • Arrays and Strings • Single dimensional • Multi dimesional • String library functions • Functions • Function prototype • Functions with passing of arguments • Functions passing arrays • Function passing strings • Function passing structures • Call by value • Call by reference • Recursion • OOPs concepts • Classes • Data members • Member functions • Array of instances • Nested classes

  9. Constructors and destructors • Default constructors • Parameterized constructor • Copy constructor • Destructor • Functions in C++ • Friend function • Inline function • Polymorphism • Early binding • Function overloading • Operator overloading • Late binding • Virtual functions • Pure virtual functions • Tern plates • Function templates • Class templates • Friend class • Exceptional Handling • Try • Catch • Throw

  10. Inheritance • Single level • Multi level • Multiple • Hybrid • Hierarchy • 14 Pointers • Pointers to arrays • Pointers to strings • Pointers to structures • Pointers to classes • Pointers to pointers • Dynamic memory allocation • New • Delete • This pointer • Searching and sorting • Merge sort • Bubble sort • Quick sort • Heap sort • Linear and Binary search • File Handling • Opening and closing a file • Mode of access • Ifstream • Ofsiream • Fstream • Sequential access • Random Access

  11. DS: • Data structures in C++ • Classification of DS • Lists • Linear • Non Linear • Linked list • Single linked list • Double linked list • Singly circular • Doubly circular • Operations on Linked list • Insert • delete • Search • Sort • Modify • Merge • Stacks • Implementation of stacks • Operation on stacks • Application of stacks • Infix, Postfix & Prefix

  12. Queues • Implementation of Queues • Operation on Queues • Application of Queues • Circular Queues • Dequeue • Priority Queue • Non linear Datastructures • Trees • Binary trees • Binary search Trees • Tree traversals • Inorder • Preorder • Postorder • Operations on Binary Tree • Insert • Delete • Modify • Graphs • Breath First search and traversal • Depth first search and traversal • C++ Graphics • FAQS & Project

More Related