Tuesday, November 15, 2011

C lab programs - help

c lab programs - help

The main aim of solving laboratory exercises of c programming is to provide
introduction to practical aspects of c programming and data structures. includes three areas: 1) common programming tools, including compilers and linkers, editors, debuggers, and Make files; basic programming techniques, including design, testing, and debugging.

 Largest database of c programs for solving c programming lab

http://www.itstudentjunction.com/c-lab-programs-solutions.htm

Understanding the basic programming concepts include 

Structure of a C program. Libraries and Includes.

understanding working of various data types in c programs

Types of variables, declaring them, initializing them

Type conversion of variables

understanding the c programming style

learning  implementing function in c

learning about various conditional statements (IF / ELSE statement, switch), loops (while, do-while,for, break, continue) and implementing them

learning implementing arrays in c programs

learning implementing pointers using them in c programs

Using structs and unions in c programs

Using various storage classes ( auto, static, extern, register )  in c programs

Using various access specifiers in c programs

Different ways of using macros (Simple Macros, Parameterized Macros,  # Operator The ## Operator, Parentheses in Macro Definitions, Creating Longer Macros Predefined Macros ) in c programs.

Implementing various string functions ( strLen, StrCat, StrUpp, Strlwr, StrRev,StrCmp)

various arithmetic logic and relational operations that can be carried

Order of expression evaluation

Accessing reading, wrting & modifying contents of files

preprocessor directives in c ( #include)

Other Directives (the  #error Directive ,The #line Directive, The  #pragma Directives)  in c language

understanding implementation of various data structures in c such as stacks, queues, linked lists,  doubley linked list, dequeues, circular queues, multiple stacks, various graphs such as Depth First  search technique (DFS), Best First search technique (BFS) And trees such as binary tree, avl tree, b-tree, m-array tree, splay tree, red black tree etc..

Implementing search techniques such as linear search, binary search using c programs.

Implementing various sorting techniques such as bubble sort, insertion sort, quick sort, merge sort, heap sort etc..

No comments: