Description
This is the last course in a series of four courses. It provides skills that enable the student to store data in the form of linked lists, binary trees, stacks, and queues. It also enables the students to perform bit-level operations.
Audience
Application Developers, System Analysts, Programmer/Analysts.
Prerequisites
The necessary skills to apply advanced concepts and techniques to C programs. The set of skills include using directives and performing I/O operations. The student should be proficient in using a text editor. Students will be required to have access to an ANSI C compiler to complete lab exercises.
Objective
Upon completion of this course, the student will be able to:
- perform pointer operations on single-dimensional arrays
- perform pointer operations on multi-dimensional arrays
- define dynamic memory allocation
- identify the functions used for dynamic memory allocation
- create a singly linked list manipulate singly linked lists
- create a doubly linked list
- manipulate a doubly linked list
- store data using stacks
- store data using queues
- identify the use of binary trees to store data
- manipulate binary trees
- identify the need for bit manipulation
- manipulate bits using bitwise operators
- perform masking using AND (&) bitwise operator
- perform masking using OR (I and ^) bitwise operators
Topics Include
Advanced Memory Operations in C
- Advanced Pointer Operations
- Dynamic Memory Allocations
Linked Lists
- Singly Linked Lists
- Doubly Linked Lists
Stacks, Queues and Binary Trees
- Stacks and Queues
- Binary Trees
Bitwise Operations in C
- Bitwise Operations
- Masking
Duration
4 hrs
Minimum Requirements
Netscape or Internet Explorer (versions 4.0 or higher). Â Browsers should be capable of accepting cookies; SVGA Hi-color mode 800x600 resolution display; Macromedia Shockwave Version 6.02 or higher.
Media
Web Based Training
|
