United States | (UTC+05:30)  change

Algorithms, Data Structures & Problem Solving (Using C)



INR 4000.00

Course Code7121VVB5
Duration90 day(s)

Program Manager

Dr KRV Subramanian

sandeep@thegrace.in

919886003702


Social


This course is offered By Radix Learning Pvt. Ltd.

Course Objective

This course will help an entry-level programmer to understand the basics of Procedural Programming using the C Language. The course is heavily practice oriented.

Learning Tools

  • Study Material - Standard
  • Radix Learning
  • Assessment
  • Participant Questions
  • Forum

Mode of Payment

1. Online

Course Delivery and Access Methodology

The course is delivered over internet.  You must complete the enrollment process before you can access the course.
You must use Internet Explorer 11.0 (or above), Mozilla Firefox 35.0 (or above) or Google Chrome 40.0 (or above) to use Quampus. Additionally you must install Adobe Flash Player (latest version) in your browser also.  Your browser must have Java Scripts enabled. There may not be difficulty in running on other browsers, but it is not tested on them.

Withdrawal and Refund Policy

Withdrawal is permitted but there will be no refund of payment.


Collapse

Chapter 1: Introduction to Algorithms Computing and Problem Solving

Reference(s):
  • To define algorithm and state its characteristics
    To state the different types of algorithms
    To discuss the nature of computational problems and algorithmic approach to solving them
    To explain how to represent algorithms as flowcharts and as pseudo code

Chapter 2: Problem Solving with Basic Building Blocks of C

Reference(s):
  • To state the overview of the building blocks of the C programming language
    To discuss the nature and characteristics of simple data types
    To explain how to form and use arithmetic expressions
    To discuss the use of assignment statements
    To explain simple I/O through scanf and printf functions
    To illustrate problem solving using simple building blocks of C

Chapter 3: Problem Solving Using Decision Control Structures

Reference(s):
  • To articulate the need for decision control structures in problem solving
    To illustrate use of decision control structures in problem solving
    To explain the use of the if – else construct of C and its use in problem solving
    To discuss appropriate uses of the nested conditional structures in problem solving

Chapter 4: Problem Solving using Simple Iterative Structures

Reference(s):
  • To articulate the need for iterative structures in problem solving
    To discuss the use of some simple iterative constructs in C like the “while” , “for” and “do while”
    To explain the use of simple iterative constructs in problem solving
    To explain how to trace a program that involves these iterative structures

Chapter 5: More Problem Solving Using Iteration and Stepwise Refinement

Reference(s):
  • To articulate the importance of the approach of stepwise refinement in problem solving
    To illustrate its use through application in solving computational problems

Chapter 6: Problem Solving With Nested Iterative Structures

Reference(s):
  • To articulate the need for nested iterative structures in problem solving
    To discuss the use of some nested iterative constructs in C built upon the “while” , “for” and “do while”
    To explain the use of nested iterative constructs in problem solving
    To explain how to trace a program that involves these nested iterative structures

Chapter 7: Using Functions From a Library for Problem Solving

Reference(s):
  • To explain the importance and use of builtin functions in the C language
    To discuss some of the categories of functions available in a library
    To illustrate application of functions from a library for problem solving

Chapter 8: Developing Your Own Functions in Problem Solving

Reference(s):
  • To explain the need, importance and use of user developed functions in problem solving
    To discuss methods of writing one’s own functions
    To illustrate application of user developed functions for problem solving

Chapter 9: Scope Lifetime and Parameter Transfers

Reference(s):
  • To distinguish between different methods of parameter transfer between functions
    To explain how to transfer parameters by value and by reference
    To illustrate the subtleties of parameter transfer through several problem solving situations

Chapter 10: Problem Solving Using Recursion I

Reference(s):
  • To define what recursion is and its importance in problem solving
    To illustrate the technique of recursion and its application in problem solving
    To apply recursion to solve simple problems

Chapter 11: Problem Solving Using Recursion II

Reference(s):
  • To explain the use of recursion in problem solving in nontrivial applications
    To discuss how to write and employ recursive functions
    To explain the dynamics of parameter transfers when using recursive functions
    To discuss when to use recursion and when not to use recursion

Chapter 12: Using Single Dimensional Arrays

Reference(s):
  • To articulate the need for structured data types in problem solving
    To explain the use of single dimensional arrays in problem solving
    To explain how to define and use single dimensional arrays in the C language
    To illustrate the use of single dimensional arrays and functions in problem solving

Chapter 13: Algorithms for Searching

Reference(s):
  • To state the need and importance for searching through a list in problem solving
    To discuss various searching algorithms like the Linear Search and Binary Search

Chapter 14: Algorithms for Sorting

Reference(s):
  • To state the need and importance of sorting elements in single dimensional arrays
    To explain various sorting algorithms such as Insertion Sort, Bubble Sort and Quick Sort

Chapter 15: Using Multimensional Arrays

Reference(s):
  • To explain the use of multi dimensional arrays in problem solving
    To explain how to define and use two dimensional arrays in the C language
    To illustrate the use of two dimensional arrays and functions in problem solving

Chapter 16: Problems Involving Structured Data Types – A Miscellany

Reference(s):
  • To state how the C language provides facility to declare and use structures
    To illustrate the use of structures through a miscellany of programming problems

Chapter 17: Basics of Pointer Data Types

Reference(s):
  • To state the limitations of static data structures
    To articulate the need, nature and importance of dynamic data structures
    To explain the use of dynamic data structures in problem solving

Chapter 18: Implementing Dynamic Data Structures Using Pointers

Reference(s):
  • To explain how to implement dynamic data structures using the pointers of C language
    To illustrate the use of pointers in creating and using a simple, singly linked list
    To provide the foundation and motivation for implementing other dynamic data structures in problem solving situations

Chapter 19: Abstract Definition of Data Structures and Implementation

Reference(s):
  • To illustrate and strengthen the foundation of using dynamic data structures through an miscellany of situations in problem solving

Chapter 20: File Handling

Reference(s):
  • To articulate the need and importance of handling data from secondary storage devices
    To explain the use of files in the C language
    To illustrate the use of files in problem solving

Chapter 21: Problems Involving Files & File Handling

Reference(s):
  • To illustrate and strengthen the foundation of using files through an miscellany of situations in problem solving

Chapter 22: Survey of Some Miscellaneous Features of C

Reference(s):
  • To show that the C language is rich in features beyond what has been illustrated and used so far
    To explain some of the miscellaneous features of C through examples

Chapter 23: Reinforcing Problem Solving, Algorithms and the Procedural Paradigm

Reference(s):
  • To reinforce the problem solving abilities through algorithms and the procedural paradigm
    To illustrate problem solving approaches through a miscellany of interesting cases

Chapter 24: Thinking Beyond the Procedural Algorithms - Challenges & Way Forward

Reference(s):
  • To illustrate situations of problem solving that could be better served using approaches different from procedural algorithmic approach
    To provide a view of the challenges in problem solving beyond the procedural algorithmic approach
    To introduce some potential problem solving paradigms like the objectoriented approach

Chapter 25: Some Advanced Uses of Pointers

Reference(s):
  • To state some of the potential advanced uses of pointers in C
    To illustrate through examples some potential and pitfalls of using pointers in C

Mfr Ashok Kumar Yadav
Assigned Subjects
  • Algorithms, Data structures & Problem Solving (C) (BTH0000234)