Skip to main content

C Programming_SIP-2017 APSSDC

About this course:
A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.

A few examples of questions that we are going to cover in this class are the following:

1. What is a good strategy of resizing a dynamic array?

2. How priority queues are implemented in C++, Java, and Python?

3. How to implement a hash table so that the amortized running time of all operations is O(1) on average?

4. What are good strategies to keep a binary tree balanced?

> You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space!

Who is this class for: 
Programmers with basic experience looking to understand the practical and conceptual underpinnings of algorithms, with the goal of becoming more effective software engineers. Computer science students and researchers as well as interdisciplinary students (studying electrical engineering, mathematics, bioinformatics, etc.) aiming to get more profound understanding of algorithms and hands-on experience implementing them and applying for real-world problems. Applicants who want to prepare for an interview in a high-tech company.

Overview of C

C is a general-purpose, high-level language that was originally developed by Dennis M. Ritchie to develop the UNIX operating system at Bell Labs. C was originally first implemented on the DEC PDP-11 computer in 1972. In 1978, Brian Kernighan and Dennis Ritchie produced the first publicly available description of C, now known as the K&R standard. The UNIX operating system, the C compiler, and essentially all UNIX application programs have been written in C. C has now become a widely used professional language for various reasons:

∙  Easy to learn
∙  Structured language
∙  It produces efficient programs
∙  It can handle low-level activities
∙  It can be compiled on a variety of computer platforms

Features of C language:

- It is a robust language with the rich set of built-in functions and operators that can be used to write any complex program.
- The C compiler combines the capabilities of an assembly language with features of a high-level language.
- Programs Written in C are efficient and fast. This is due to its variety of data type and powerful operators.
- It is many time faster than BASIC.
- C is highly portable this means that programs once were written can be run on another machine with little or no modification.
- Another important feature of C program is its ability to extend itself.
- A C program is basically a collection of functions that are supported by C library. We can also create our own function and add it to C library.
- C language is the most widely used language in operating systems and embedded system development today.

Course Staff

Course Staff Image #1

Master Trainer

T Srinivasa Rao


C Fundamentals C Fundamentals
  • C Introduction
  • History of C
  • First C Program
  • Identifiers and Keywords
  • C Data Types
  • C Variables
  • C Constants and Literals
  • printf and scanf Function
  • Operators Introduction
  • Arithmetic Operator
  • Assignment Operator
  • Relational Operator
  • Logical Operator
  • Bitwise Operator
  • Conditional Operator
  • Type Casting in C
  • Decision Making Introduction
  • if Statement
  • if...else Statement
  • Nested if Statement
  • if-else Ladder Statement
  • switch case Statement
  • Loops and Jumps Introduction
  • for Loop
  • while Loop
  • do..while Loop
  • break Statement
  • continue Statement
  • Function Introduction
  • Function Declaration
  • Function Definition
  • Calling a Function
  • Passing Function Arguments
  • Important Facts about Functions
  • Variable Scope Rules in C
  • Storage Classes in C
  • Array Introduction
  • Array Initialization
  • Accessing Array Elements
  • MultiDimensional Array
  • Passing Array to Function
  • Returning Array from Function
  • C Strings
  • Pointers Introduction
  • Pointer Arithmetic
  • Passing Pointer to Function
  • Returning Pointer from Function
  • Arrays of Pointers
  • Pointer to a Pointer
  • Structure Introduction
  • Accessing Members of Structure
  • Pointer to Structure
  • Passing Structure to Function
  • Nesting of Structures
  • Array of Structure
  • C Unions
  • ctype.h header file
  • math.h header file
  • string.h header file
  • stdlib.h header file
  • stdio.h header file
  • errno.h header file
  • assert.h header file
  • C Input Output Library Functions
  • Typedef in C
  • File Handling in C
  • C Preprocessor Directives
  • C Header Files

Frequently Asked Questions

What is use of Data structure?

Data Structure in C. Data structures are used to store data in a computer in an organized form. In C language Different types of data structures are; Array, Stack, Queue, Linked List, Tree. Array: Array is collection of similar data type, you can insert and deleted element form array without follow any order.