SDDD-Advanced Data Structures using C and Algorithms

Project based Career Oriented Training

in

Software Design Development and Debugging

Module 7: Advanced Data Structures using C and Algorithms with Linux

Abstract:

We will look at the core data structures and algorithms used in modern applications, system software, firmware and device drivers. We will discuss the features involved with and choice of data structure, along with storage techniques, traversal, retrieval, and update algorithms. we would cover some advanced and complex data structures followed by analysis and design of algoritmms and strategies, like, divide and conquer, greedy atrategies. Advanced Data Structures deals with In this training we practice behaviorial model of training and keep the trainees hands on to the C coding syntax and standards. Data structures would be implemented in depth with descent variations. There would be an assignment after every session. Finally a project would be implemented for optimizing learning and adopting good debugging strategies.

Training Content for Module 7:Advanced Data Structures using C and Algorithms with Linux

• Divide and Conquer Strategy:
  • Binary Search,
  • Merge Sort,
  • Quick Sort
• Greegy Strategy:
  • Minimum Spanning Tree,
  • Dijkstra's algorithm,
  • Huffman codes,
  • Scheduling problem,
  • Avtivity Selection problem,
  • Fractional Knapsack problem
• File Structures
• Analysis, Time and Space Complexities:
  • Order of growth,
  • O-notation,
  • pie-notation,
  • thets-notation

Other Modules in SDDD Training are as follows.

__Back__

EmbLogic™ is an ISO 9001:2008(QMS) (Quality Management System) Certified Company.