A data structure is a specialized format for organizing and storing data. In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently. Data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways.

Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms. Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory. Different kinds of data structures are suited to different kinds of applications, for example, relational databases commonly use B-tree indexes for data retrieval, while compiler implementations use hash tables to look up identifiers.



CERTIFYING BODY

  • In-house certification

CAREER PROSPECTS

  • Developer – Datastructures
  • Analyst – Datastructures
  • L2 support – Datastructures

SYLLABUS

    INTRODUCTION TO C
    • History of C, Features
    • Rules of writing a C program
    • Declaration of variables
    • Types of Variables
    • Constants
    • Naming Conventions
    • Data Types, Classification
    • Assigning values, Initialization
    • Storage classes
    • Functions in C
    • Input/ Output Statements
    • printf( ), scanf( )
    • getch( ), putch( )
    • Operators
    – Unary
    – Binary
    – Ternary
    – Arithmetic
    CONTROL STRUCTURES
    • Conditional statements
    – if, if .. else, if .. else if
    – switch .. case
    – nested if
    • Loops
    – while, do .. while
    – for nested loops
    • goto
    ARRAYS
    • Arrays – Single / multi dimensional
    • Processing arrays
    • Passing arrays to functions
    • Sorting & Searching arrays
    STRINGS
    • Strings, gets( ), puts( )
    • String functions

    FUNCTIONS
    • Built-in functions
    – stdio.h, conio.h
    – string.h, math.h
    – ctype.h, malloc.h
    • User-defined functions
    – Definition, Prototype, Body
    • Calling functions
    – Call-by-value
    – Call-by-address
    – Recursion
    • User-defined header files
    POINTERS
    • Uses, Processing Arrays
    • Strings
    • Dynamic memory allocation
    • malloc( ), free( )
    STRUCTURES
    • Definition, Array of Structures
    • Accessing with Pointers
    FILE HANDLING
    • Importance of Data management
    – storing, retrieving
    – searching, modifying
    • File pointer
    • fopen( ), fprintf( ), fscanf( ), feof( )
    • rename( ), remove( ), fclose( )
    • dos.h
    DATA STRUCTURES
    • Importance of Data Structures
    • Linked lists
    – Single, Double & Circular
    • Stacks
    • Queues
    • Trees