Data Structures and Algorithms

Category: Gate CSE

 

Data Structures and Algorithms

Category: Gate CSE
₹8,000.00 ₹12,000.00
Cinque Terre
Instructor
Chekuri Srikanth Varma

Gate CSE : Data Structures and Algorithms
Chapters : 69

Practice Test-1 Insertion sort and Asymptotic Notations
Feb 18, 2018 01:00 pm
Feb 20, 2018 08:30 pm
Practice Test-2 Ordering of Growth Functions and Merge Sort
Feb 22, 2019 04:00 pm
Feb 24, 2019 12:00 am
Practice Test-3 Solving Recurrence Relations,Bubble Sort, Quick Sort, Linear Time Sorting-Counting Sort and Radix Sort
Feb 26, 2019 12:00 pm
Feb 27, 2019 08:30 pm
Practice Test-4 Introduction to Algorithms - Linear Time Sorting Algorithms
Mar 01, 2019 12:00 am
Mar 02, 2019 08:15 pm
26.1
1 mins
26.2
5 mins
26.3
4 mins
26.4
2 mins
26.5
3 mins
26.6
1 mins
Practice Test-5 Single Linked List, Double Linked List ,Circular Linked List, Stack, Expression Evaluation, Prefix ,Infix, Postfix
Mar 05, 2019 03:15 pm
Mar 06, 2019 09:00 pm
33.1
4 mins
33.2
5 mins
33.3
3 mins
33.4
4 mins
33.5
4 mins
33.6
5 mins
33.7
5 mins
33.8
5 mins
33.9
3 mins
Practice Test-6 Queue,Arrays
Mar 07, 2019 06:00 pm
Mar 09, 2019 08:15 pm
42.1
6 mins
42.2
10 mins
42.3
6 mins
42.4
8 mins
42.5
5 mins
42.6
2 mins
42.7
2 mins
42.8
2 mins
42.9
4 mins
42.10
2 mins
42.11
4 mins
44.1
8 mins
44.2
4 mins
44.3
5 mins
44.4
4 mins
44.5
6 mins
44.6
5 mins
Practice Test-7 Searching, Binary Search Tree, Trees ,Heap Sort
Mar 12, 2019 11:00 am
Mar 14, 2019 08:30 pm
52.1
16 mins
58.1
2 mins
58.2
5 mins
58.3
8 mins
58.4
2 mins
58.5
2 mins
58.6
3 mins
59.1
7 mins
59.2
4 mins
59.3
4 mins
59.4
9 mins
59.5
5 mins
59.6
8 mins
59.7
1 mins
59.8
1 mins
59.9
2 mins
59.10
4 mins
59.11
6 mins
59.12
4 mins
59.13
5 mins
59.14
6 mins
59.15
3 mins
Practice Test-8 Balanced Trees : AVL Trees , Hashing
Mar 15, 2019 06:30 pm
Mar 16, 2019 08:00 pm
63.1
2 mins
63.2
3 mins
63.3
2 mins
63.4
2 mins
63.5
4 mins
63.6
7 mins
63.7
2 mins
63.8
7 mins
63.9
1 mins
63.10
2 mins
63.11
6 mins
63.12
5 mins
63.13
3 mins
63.14
15 mins
63.15
3 mins
63.16
7 mins
63.17
8 mins
63.18
9 mins
63.19
8 mins
63.20
3 mins
63.21
4 mins
63.22
6 mins
63.23
3 mins
63.24
2 mins
63.25
3 mins
Practice Test-9 Graph Search,DFS,BFS,Spanning Trees, Prim's , Kruskal, Shortest Path, DIjkstra, Bellman Ford, Floyd Warshall, Topological Sorting
Mar 19, 2019 06:45 pm
Mar 20, 2019 08:45 pm
Practice Test-10 Dynamic Programming
Mar 27, 2019 01:00 pm
Mar 27, 2019 09:00 pm
Practice Test- 11 Greedy Algorithms
Mar 29, 2019 04:21 pm
Mar 30, 2019 08:30 pm
Algorithms and Data Structure Subject Test - 1
Apr 02, 2019 09:30 am
Apr 02, 2019 12:00 pm
Algorithms and Data Structure Subject Test-2
Apr 02, 2019 05:15 pm
Apr 02, 2019 06:00 pm

Data Structures and Algorithms

Algorithm:
An algorithm for a particular task can be defined as “a finite sequence of instructions, each of which has a clear meaning and can be performed with a finite amount of effort in a finite length of time”. As such, an algorithm must be precise enough to be understood by human beings. However, in order to be executed by a computer, we will generally need a program that is written in a rigorous formal language; and since computers are quite inflexible compared to the human mind, programs usually need to contain more details than algorithms. Here we shall ignore most of those programming details and concentrate on the design of algorithms rather than programs.
Fundamental questions about algorithms
Given an algorithm to solve a particular problem, we are naturally led to ask:

  1. What is it supposed to do?
  2. Does it really do what it is supposed to do?
  3. How efficiently does it do it?

The technical terms normally used for these three aspects are:

  1. Specification.
  2. Verification.
  3. Performance analysis

Data Structure:
For many problems, the ability to formulate an efficient algorithm depends on being able to organize the data in an appropriate manner. The term data structure is used to denote a particular way of organizing data for particular types of operation. These concepts will look at numerous data structures ranging from familiar arrays and lists to more complex structures such as trees, heaps and graphs, and we will see how their choice affects the efficiency of the algorithms based upon them.

We will start by studying some key data structures, such as arrays, lists, queues, stacks and trees, and then move on to explore their use in a range of different searching and sorting algorithms. This leads on to the consideration of approaches for more efficient storage of data in hash tables. Finally, we will look at graph based representations and cover the kinds of algorithms needed to work efficiently with them. Throughout, we will investigate the computational efficiency of the algorithms we develop, and gain intuitions about the pros and cons of the various potential approaches for each task.

 

Course Features
Lectures
400+
Duration
180
Skill level
Easy
Language
English
Assessments
Yes

Cinque Terre

QUALIFICATION: Masters from IISC Bangalore PROFESSIONAL EXPIERENCE: 9+ years of Experience( Yahoo Labs, Matherix Labs Co-founder and Amazon)

 

Data Structures and Algorithms

Category: Gate CSE
₹8,000.00 ₹12,000.00
Cinque Terre
Instructor
Chekuri Srikanth Varma

6 Comment(s)

Avatar Gokul Varma  8 Votes

Sir why should we only use the ds and algorithms instead of programming languages?

Login to reply
Avatar Instructor 

Data structures and algorithms forms the core to implement any task in a efficicent manner.Programming languages are just platforms using which we implement those data structures and algorithms.

Login to reply

Avatar KOTESWARARAO  0 Votes

Optimal binary search tree in dynamic programming

Login to reply
Avatar Instructor GATE 

Avatar Abhishek Kushwaha  0 Votes

Divide and conquer paradigm is not covered.Is it not the part of syllabus?

Login to reply
Avatar Instructor GATE 

Please note that all the algorithms merge sort,Quicksort etc implements divide and conquer approach.

Login to reply

© 2019 - All rights are reserved- AAIC Technologies pvt ltd