Pursuing PhD in Computer Science, MCA, 5 year teaching experience, NET qualified, passionate about Teaching, writing and travelling.

Poonam 

This course provides the tools for analysing the running time of any algorithm. It also compare and analyse the recursive algorithms.  Divide and conquer approach is also included.

Prepare for UGC NET 2019 by watching our free online lessons covering UGC Net syllabus and also helping you solve Previous year question papers. Pursue your dream of JRF.

NTA-UGC-NET & SET Exams

English

Recurrence a Tool for Algorithm Analysis: NTA-UGC NET

Models of Computation

Algorithms

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

This lesson gives the basic introduction to recurrence and the methods for solving recurrence. The working of substition method is proven with a suitable example

Introduction to Recurrence

This lesson covers the iteration method and master mathod for solving recurrence.

Iteration and Master Method

This lesson covers all the details of quick sort. The working of quick sort is explained with an example. The best case and worst case running time of an algorithm is also discussed.

Quick Sort

This lesson covers all the algorithm, recurrence and complexity of merge sort.

Analysis of Merge Sort

In this lesson we have discussed about binary search algorithm. It's running time is calculated with the help of master method.

Analysis of Binary Search

🌟 MCA Gold Medalist 🌟 Star Educator 🌟Gate Qualified 🔴UGC NET qualified🌟BOOK published on LINUX ADMINISTRATION by kalyani publish

Nisha Mittal

The course is very important for examination point of view , In this course we will cover Analysis of Algorithm in detail and previous year queations.

(Hindi) Analysis of Algorithm - NTA UGC NET Computer Science

In this course Nisha Mittal will provide solutions of questions of algorithm for NTA NET computer science examination

(Hindi) Utmost Important Course on Algorithm for NTA NET Computer Science Examination

Lect. at MIMT College. MCA from Institute of Science BHU Varanasi. Twice Qualified NTA-UGC NET. Having two year's of experience.

Naushad Ahmad

Unit-7: Data Structures and Algorithms,Performance Analysis of Algorithms & Recurrences  for
NTA-NET Updated Syllabus for June 2k19

(Hindi) Introduction to Algorithms: NTA UGC NET

In this course, the educator is discussing 1)Graph Algorithm
2) Shortestst Path Problem
3) Minimum Spanning Tree 
4)Maximum Flow

(Hindi) NTA-UGC NET: Basics of the Graph Algorithm

Varsha Agarwal

(Hindi) Theory of Automation Concept

This course covers all basic concept of automata and Discusses about D. F. A AND NFA IN Detail

Lessons

5 lessons • 52m

Introduction to Recurrence

Iteration and Master Method

Quick Sort

Analysis of Merge Sort

Analysis of Binary Search