Skip course categories
Skip available courses

Available courses

Provide the basics of 16,32 and 64bit  microprocessor architecture, programming and interfacing

Core/Elective: Core Semester: 1 Credits: 4
Course Description

This course describes the techniques for the design and analysis of efficient algorithms, giving emphasis on methods useful in practice. Topics include graph algorithms; divide-and-conquer algorithms and recurrences; dynamic programming; greedy algorithms; amortized analysis; network flow; randomized and approximation algorithms.

Course Objectives

To know problem solving techniques
To understand techniques for the design and analysis of efficient algorithms
To be able to design algorithms for new problems with volume of data

I: Introduction to Statistics

II: Control Charts

III: Acceptance Sampling

IV: Life Testing and Reliability

Heat and Mass Transfer

This course deals with:

  • Problem solving techniques by writing algorithms and 
  • Development of programming skill using C