Skip available courses

Available courses

Course Outcome

  1. Analyse the performance of the algorithm and represent it using asymptotic notations.
  2. Solve real world problem using appropriate data structures among arrays, linked list, stack and queue. 
  3. Design algorithms for various application using nonlinear data structures trees and graphs
  4. Compare Searching (Linear search & Binary search) and Sorting ( Bubble sort, Selection Sort, Insertion sort, Merge sort, Quick sort and Heap sort ) Techniques.
  5. Compare different memory management techniques and their significance.
  6. Exemplify various hashing techniques. 

This course is designed for Third semester B. Tech (Mechanical Engg.) of APJ Abdul Kalam Technological University.

Course Objectives: 

 Analyze the asymptotic performance of algorithms. 

 Write rigorous correctness proofs for algorithms. 

 Demonstrate a familiarity with major algorithms and data structures. 

 Apply important algorithmic design paradigms and methods of analysis. 

 Synthesize efficient algorithms in common engineering design situations.

Course Objectives: 

  •  Analyze the asymptotic performance of algorithms. 
  •  Write rigorous correctness proofs for algorithms. 
  •  Demonstrate a familiarity with major algorithms and data structures. 
  •  Apply important algorithmic design paradigms and methods of analysis. 
  •  Synthesize efficient algorithms in common engineering design situations.

  • To introduce the major concepts related to artificial intelligence and machine

learning.

• To develop awareness on the languages and programming techniques

related to artificial intelligence