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

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

Hindi

(Hindi) Introduction to Algorithms: NTA UGC NET

Models of Computation

Algorithms

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

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

Introduction to an Algorithms (in Hindi)

1) Compile Time
2) The Running Time of a Program
3) Measuring the Running Time of a Program
4) Time Complexity 
5) Analysis

Algorithm Analysis (in Hindi)

1) What is Rate of Growth?
2) Increasing Rate of Growth with big image.
3) Types of Analysis

Rate of Growth (in Hindi)

1) Big oh(O)& Small oh(o)
2) Big Omega & Small Omega
3) Theta Notation
4) Theorem
5) Properties
6) Conclusion

Asymptomatic Notations (in Hindi)

1) What is Master Theorem?
2) Master Theorem for D&C with big Image.

Master Theorem (in Hindi)

🌟 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

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.

Recurrence a Tool for Algorithm Analysis: 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 • 43m

Invalid Date

NaN

Introduction to an Algorithms (in Hindi)

Invalid Date

NaN

Algorithm Analysis (in Hindi)

Invalid Date

NaN

Rate of Growth (in Hindi)

Invalid Date

NaN

Asymptomatic Notations (in Hindi)

Invalid Date

NaN

Master Theorem (in Hindi)