🌟 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.

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) Analysis of Algorithm - NTA UGC NET Computer Science

Models of Computation

Algorithms

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

This course is for NTA NET computer science, KVS PGT aspirants related to algorithm.  In this course we 'll cover all important topics of Algorithm like 
● analysis of Algorithm 
● asymptotic notations 
● previous year queations of Algorithm 
● Multiple choice questions

Overview of Course (in Hindi)

In this lesson we are going to discuss Asymptotic notation in algorithm. To find best case , average case , worst case. we represent upper bound and lower bounds with the help of asymptotic notations.

Asymptotic Notation of Algorithm(in Hindi)

In this lesson we are going to cover asymptotic notations
1. big O 2. Omega notation 3. Theta notation with diagramattical representations . Also we will do some examples related to topics .

Best Diagrams for Asymptotic Notation (in Hindi)

In this lesson we 'll discuss important examples to understand asymptotic notations like BIG O,  Omega,  theta , small omega and small o . Here we 'll completely understand the meaning of tight and non tight upper and lower bounds .

Easy way to understand Big O and Omega Notations (in Hindi )

In this course we 'll cover types of time complexities in algorithms in detail and shortcut tricks to solve questions of algorithms .

Shortcut Tricks of Time Complexities (in Hindi)

In this lesson we 'll cover NTA NET Computer Science TOPIC of Algorithm | difference between big O and small o and big omega and small omega.

Difference between notations in algorithm (in Hindi )

This lesson is important for NTA NET computer science, KVS PGT aspirants . As here you ll be able to understand whole algorithm basic in short time and you can make your own notes by following these all videos .

Last minute revision of Algorithm (in Hindi)

NTA NET computer science | 
Topic : Algorithm 
Subtopic : Properties of Algorithm Notations

Properties of Asymptotic Notations (in Hindi )

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

Master theorem previous year Question( in Hindi )

Which of the following is ALWAYS TRUE? (In Hindi)

Increasing order of asymptotic notation( In Hindi)

Complexity of algorithm related isro question (in Hindi )

Which of the following is false ? (In Hindi )

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

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

14 lessons • 1h 18m

Invalid Date

NaN

Overview of Course (in Hindi)

Invalid Date

NaN

Asymptotic Notation of Algorithm(in Hindi)

Invalid Date

NaN

Best Diagrams for Asymptotic Notation (in Hindi)

Invalid Date

NaN

Easy way to understand Big O and Omega Notations (in Hindi )

Invalid Date

NaN

Shortcut Tricks of Time Complexities (in Hindi)

Invalid Date

NaN

Difference between notations in algorithm (in Hindi )

Invalid Date

NaN

Last minute revision of Algorithm (in Hindi)

Invalid Date

NaN

Properties of Asymptotic Notations (in Hindi )

Invalid Date

NaN

Master theorem previous year Question( in Hindi )

Invalid Date

NaN

Which of the following is ALWAYS TRUE? (In Hindi)

+ See all lessons