GATE CS Applied Course

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

Practice Test-1 Insertion sort and Asymptotic Notations
NA
Practice Test-2 Ordering of Growth Functions and Merge Sort
NA

Practice Test-3 Solving Recurrence Relations,Bubble Sort, Quick Sort, Linear Time Sorting-Counting Sort and Radix Sort
NA

46.1
6 mins
46.2
10 mins
46.3
6 mins
46.4
8 mins
46.5
5 mins
46.6
2 mins
46.7
2 mins
46.8
2 mins
46.9
4 mins
46.10
2 mins
46.11
4 mins
48.1
8 mins
48.2
4 mins
48.3
5 mins
48.4
4 mins
48.5
6 mins
48.6
5 mins
Practice Test-7 Searching, Binary Search Tree, Trees ,Heap Sort
NA

57.1
16 mins
63.1
2 mins
63.2
5 mins
63.3
8 mins
63.4
2 mins
63.5
2 mins
63.6
3 mins
64.1
7 mins
64.2
4 mins
64.3
4 mins
64.4
9 mins
64.5
5 mins
64.6
8 mins
64.7
1 mins
64.8
1 mins
64.9
2 mins
64.10
4 mins
64.11
6 mins
64.12
4 mins
64.13
5 mins
64.14
6 mins
64.15
3 mins
Practice Test-8 Balanced Trees : AVL Trees , Hashing
NA

70.1
2 mins
70.2
3 mins
70.3
2 mins
70.4
2 mins
70.5
4 mins
70.6
7 mins
70.7
2 mins
70.8
7 mins
70.9
1 mins
70.10
2 mins
70.11
6 mins
70.12
5 mins
70.13
3 mins
70.14
15 mins
70.15
3 mins
70.16
7 mins
70.17
8 mins
70.18
9 mins
70.19
8 mins
70.20
3 mins
70.21
4 mins
70.22
6 mins
70.23
3 mins
70.24
2 mins
70.25
3 mins
Practice Test-9 Graph Search,DFS,BFS,Spanning Trees, Prim's , Kruskal, Shortest Path, DIjkstra, Bellman Ford, Floyd Warshall, Topological Sorting
NA

77.1
3 mins
77.2
3 mins
77.3
4 mins
77.4
1 mins
77.5
11 mins
77.6
3 mins
77.7
5 mins
77.8
6 mins
77.9
4 mins
77.10
10 mins
77.11
13 mins
77.12
7 mins
77.13
7 mins
77.14
7 mins
77.15
10 mins
77.16
1 mins
77.17
5 mins
77.18
6 mins
77.19
3 mins
78.1
2 mins
78.2
4 mins
78.3
7 mins
78.4
5 mins
78.5
14 mins
78.6
4 mins
78.7
9 mins
78.8
7 mins
78.9
3 mins
78.10
18 mins
78.11
11 mins
78.12
8 mins
78.13
1 mins
79.1
9 mins
79.2
3 mins
79.3
5 mins
79.4
4 mins
79.5
6 mins
79.6
11 mins
79.7
4 mins
79.8
12 mins
79.9
6 mins
79.10
5 mins
79.11
1 mins
79.12
5 mins
80.1
4 mins
80.2
5 mins
80.3
6 mins
80.4
11 mins
80.5
8 mins
80.6
9 mins
80.7
4 mins
80.8
8 mins
80.9
6 mins
81.1
2 mins
81.2
5 mins
81.3
3 mins
81.4
15 mins
81.5
10 mins
81.6
2 mins
82.1
3 mins
82.2
4 mins
82.3
5 mins
82.4
4 mins
82.5
7 mins
82.6
5 mins
82.7
6 mins
82.8
7 mins
83.1
7 mins
83.2
3 mins
83.3
3 mins
83.4
5 mins
83.5
10 mins
83.6
3 mins
83.7
5 mins
83.8
1 mins
84.1
8 mins
84.2
7 mins
84.3
6 mins
84.4
4 mins
84.5
6 mins
84.6
5 mins
84.7
5 mins
85.1
4 mins
85.2
5 mins
85.3
6 mins
85.4
6 mins
85.5
7 mins
86.1
4 mins
86.2
2 mins
86.3
4 mins
86.4
4 mins
86.5
5 mins
86.6
5 mins
86.7
9 mins
86.8
7 mins
87.1
2 mins
87.2
4 mins
87.3
6 mins
87.4
3 mins
87.5
7 mins
87.6
6 mins
87.7
12 mins
87.8
8 mins
87.9
19 mins
87.10
8 mins
88.1
5 mins
88.2
9 mins
88.3
9 mins
88.4
4 mins
88.5
6 mins
88.6
12 mins
88.7
7 mins
89.1
6 mins
89.2
5 mins
89.3
2 mins
90.1
8 mins
90.2
6 mins
90.3
4 mins
90.4
6 mins
90.5
8 mins
90.6
13 mins
90.7
6 mins
90.8
13 mins
90.9
18 mins
91.1
6 mins
91.2
15 mins
91.3
1 mins
91.4
7 mins
91.5
18 mins
91.6
1 mins
91.7
14 mins
91.8
12 mins
92.1
4 mins
92.2
2 mins
92.3
5 mins
92.4
7 mins
92.5
5 mins
92.6
6 mins
92.7
5 mins
93.1
6 mins
93.2
8 mins
93.3
5 mins
93.4
16 mins
94.1
5 mins
94.2
4 mins
94.3
5 mins
94.4
12 mins
94.5
10 mins
94.6
4 mins
95.1
3 mins
95.2
6 mins
95.3
13 mins
95.4
12 mins
95.5
8 mins
95.6
5 mins

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
517 Lecture
Duration
98+ Hours
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

34 Comment(s)
Loading...

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