Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

Lec – 1 roadmap of DSA | Syllabus of Data
structure | Data Structure for Beginners
Dear Students Welcome to GETS Majors, in today's video I have brought road map
for data structure interview preparation, meaning if you are preparing for interview
and what things should you do in data structure, how should you follow the pattern
...
Here in this video, I am focusing only
on the data structure, these two cannot be separated, both are interconnected but I
have just brought them here so that you guys who are athletes can understand
...
If you give me one hour a day to both of you, then it
will be 6
...
Like we do on lead code,
here without theory the theory will build your logic until your logic is built, after
that the practice which is your coding is a part of the syntax
...
After you have understood the syntax, then you have to
remember some things, you have to apply logic on it and your work will be done,
that is why I tell you to watch this video till the end because I am going to tell many
good things here
...
Whatever is
there, samosa cannot be made, similarly, interview is incomplete without data
structure algorithm, so whatever preparation you need, if you do it very well, then
you know that not only small companies but big companies are also product based
companies
...
The first topic is what array because whenever we talk
about storage, whether you take the concept of operating system or even take the
concept of machine learning AI here, whenever we store, how do we store it in 2D
or In 3D, we store the data and then apply multiple algorithms on it
...
If your story is incomplete, then the first thing you are asked to do
is array, where first of all you will get 1D array, 2D array which is most important
and then how the data is stored on the three dimension array
...
This is a building block because
it is Further, when we talk about stack and q or hash tables, how do we implement it
there too? We do these things through arrays, we can also do them through linkedlist
etc
...
They are implemented only through the
array, so without the array, your story will remain incomplete, so the first and
foremost milestone you have to cover is the one related to the array and all the first
theorems above the array are C+P
...
Hey, yours is
complete then we will move to the link list
...
It is asked that if we
talk about link list, then here we will talk about single link list and then after that,
here we will talk about double link list, above circular link list, double s, above
double circular link list, all these
...

We will save but friend, coding has to be done later
...
It is very good that how we design the link list and
then how we present it to you first
...
First of all, you have to take a paper pen and how to find the matrix etc
...
We will first start with the paper pen and then after that we
will use it through programming language
...
Stack and Queue, after that we come again LIFO based and FIFO first in
first aa base, we have the data structure which is Stack and Queue, what is most
important in the stack is the multiple applications that we have here
...
Or is it related to Finiki series or the most important
thing is that in fix to post fix, we do post fix evaluation which if we talk in real life
example, it is used a lot in the compiler and anyway you know
...
e
...
So we stored the data in hash tables using hash
functions and all
...
How do we fetch the data in
constant time? Can be used for the fastest searching till date, if what we have is
inside it, like we talk about that, now you will have to do it in further detail
separately, how the collision happens with each other, that collision
...
That is another topic ahead
but when we will cover it one by one then you will understand that without it the
story is too far
...
You can avoid it as much as
you want, if you ca n't avoid it, then the debt comes to us, then again the concept of
trees is there in all the major companies, Google's concept is like it became binary
trees, then after that it became binary search trees, it became AVL trees
...
, all these topics have to be done one by one, first threat is done
tomorrow and maximum videos are already covered, so whatever you have, it is
from somewhere else
...
Do an athlete, the main idea is to do something or the other, if you
give one hour daily to the data structure and if you give one hour daily to the
algorithm, then within five months you will become such a pro level person
...
Algorithm is done,
which if we talk about it specifically, mainly in the algorithm we have, the ones
which come under Greedy, where we have to find out the shortest path, in all of
them, there is a lot of use of graph data structure like DIJA etc
...
Heap Phi, all these topics are also
discussed somewhere
...
then in a way it
has become the topic of your algorithm because these two are not different
...
When you do parallel,
you will get a lot of fun and interesting things will be created somewhere that you
will enjoy reading daily and I will also tell you in the next video when I will tell you
about the algorithm, I will tell you there that Day One You do this in Day 2, do this
algorithmically, do this in Day 2, do this, then somewhere after that a proper
schedule will be made for you and then it will be even more fun to study
...




---