Subcribe and Access : 5200+ FREE Videos and 21+ Subjects Like CRT, SoftSkills, JAVA, Hadoop, Microsoft .NET, Testing Tools etc..

Batch Date: Mar 2nd @ 10:30AM

Faculty: Smt. Santhoshi

Duration: 45 day's

Fee: Just 1000/- INR + Reg Fee 100/-INR

Location : Maitrivanam - 202, Hyderabad.

Venue :
DURGA SOFTWARE SOLUTIONS at Maitrivanam
Plot No : 202,
IInd Floor ,
HUDA Maitrivanam,
Ameerpet, Hyderabad-500038
Ph.No : 09246212143.

Syllabus:

C - LANGUAGE

1. Introduction about Computer Language Need.
2. Introduction to ‘C’
3. Program Structure
4. Constants and Variables

4.1. Constants
4.2. Variables/Identifiers
4.3. Keywords

5. Data Types

5.1. Primary Data Types
5.2. User-defined Data Types
5.3. Derived Data Types

6. Flow of Control

6.1. Different Types of Operator
6.2. Unary operators
6.3. Binary Operators
6.4. Ternary Operators
6.5. Bit-wise Operators

7. Control Structures

7.1. Sequential Structures
7.2. Conditional or Decision or Selection Structures

8. LOOPS
9. Arrays

9.1. Assigning Constant Value
9.2. Single Dimensional Array
9.3. Multi Dimensional Array
9.4. Passing Arrays to Functions
9.5. Searching and Sorting Array

10. Functions

10.1. Types of Functions
10.2. Purpose of Functions
10.3. Characteristics of a Function
10.4. Call by Reference
10.5. Recursion

11. Built in String Functions
12. Storage Class
13. Introduction to Pointers

13.1. The Address and Indirection Operator
13.2. Pointer to Pointer
13.3. Function with pointer
13.4. Array of pointer
13.5. The Dynamic Memory Allocation

14. Structures and Unions

14.1. Concept about Structure
14.2. Declaring and Initializing a Structure
14.3. Arrays of Structures
14.4. Functions using Structures
14.5. Pointer using Structures
14.6. Concept about Union
14.7. Difference b/w Structure & Union and Array & Structures
14.8. Bit fields

15. Preprocessor Directives
16. Macro Substitution and File Inclusion
17. Files and Command line arguments
18. C-PROJECT
19. Interview based Question and Answers

DATA STRUCTURES

Module – I
1.1. Input and output – concept of a file
1.2. Text files and binary files
1.3. Streams
1.4. Standard I/o
1.5. Formatted I/o
1.6. File I/o operations error handling
1.7. C program examples.

Module – II
2.1. Searching – Linear and binary search methodas
2.2. Sorting –

2.2.1. Bubble sort
2.2.2. Selection sort
2.2.3. Insertion sort
2.2.4. Quick sort
2.2.5. Merge sort.

Module – III
3.1. Introduction to data structures
3.2. Linked Lists

3.2.1. Singly linked lists
3.2.2. Doubly linked lists
3.2.3. Circular list

3.3. Representing stacks and queues in C using arrays and linked lists
3.4. Infix to Post fix conversion, Postfix expression evaluation

Module – IV
4.1. Trees- Binary tress
4.2. Terminology
4.3. Representation, Traversals,
4.4. Graphs - Terminology, Representation, Graph Traversals (dfs & bfs)