Table of Contents
Introduction to Data Structures & Algorithms ....................... 1
Time Complexity and Big O Notation ....................................... 2
Asymptotic Notations: Big O, Big Omega and Big Theta
Explained....................................................................................... 3
Best Case, Worst Case and Average Case Analysis of an
Algorithm ...................................................................................... 3
How to Calculate Time Complexity of an Algorithm + Solved
Questions ...................................................................................... 4
Introduction to Data Structures & Algorithms
should be able to use it in your work or in your projects or in your courses or in your projects
that you are doing in the future or in your work that you are doing right now so if you want
to use something then you should be able to use it in your work or in your projects or in your
courses or in your future work or in your projects that you are doing right now . So data
structures and algorithms are things that help us in our work or in our projects or in our
courses or in our future projects or in our work or in our projects that we are doing right now
so if you want to use something then you should be able to use it in your work or in your
projects or in your courses or in your future work or in your projects that you are doing right
nowwater in a pot and you put the tea bag in the cup and you make the coffee Now what is
the difference between data structures and algorithms? Algorithms are specific steps that
need to be taken in order to solve a problem.I have been in the industry for a long time now
and I have seen a lot of people learning C , C++ and when they start to learn it they get very
lost & confused & they don't know what they are doing & they don't know how to use the
language properly & eventually they stop learning it & they end up becoming a beginner
again & that is not good for the industry & it is not good for the learners either so I would
say learn C , C++ & don't get lost in the language learning process
a break for a while I understand that you are very busy for the next few days and I u nderstand
that you are very busy for the next few weeks and I understand that you have a lot of
questions so I 'll just stop now and I 'll come back to you in a few days and we will start the
next video where we will talk about algorithms and data structures and then we will talk
about interviews and then finally we will talk about the final exam and you can ask me any
questions that you have in your mind so that 's all for now I 'll come back to you in a few
days and we will start the next videowhat is the data structure of chrome so now we see that
the data structure is called RAM so the data structure of a database is called RAM because
, when the program starts it will load into RAM the data structure of the database which is
called RAM . And then you will get to hear this and it is asked in the interviews, "tell me, what
is this?" So now let's understand database, data warehouse, and big data here we have
understood the data structure that when your program starts in RAM, it will load into the
random access memory.I want to keep the data in a different database so what I have to do is
I have to create a new database and I have to name it `` legacyData '' I have to create a new
table in that database and I have to add the following column in the table `` Bir thday `` I have
to add the following column in the table `` Year `` Now I have to run the program and I will
get the following result in the console `` Facebook 2020 `` Facebook 2021 `` Facebook 2009 ``
`` Facebook 2020 `` Facebook 2021 `` Facebook 2009 `` `` Facebook 2009 `` You retrieve and
read the data from hard disk drive and update it.
know these three terms because big data is what we are talking about here .memory location
where the C program stores the data that is to be processed next and the heap is a memory
location where the C program stores the data that is to be processed next but the data that is
to be processed next is not always stored in the same location as the data that is to be
processed next because the C program can keep data in different memory locations
depending on the situation and this is why it is important for you to understand the stack
and heap because you will be able to understand the C program better and be able to ask
more questions on the C program. Alright ... I 'm talking about C program that 's why I say
that you get a good picture of memory with the help of C programming therefore , data
structures and algorithms is best learned from C and C++ Now here I am dividing it into
segments so there is thing called code segment let 's say this is my code let 's say there is a
code with the name `` harry.c '' now this code will be first loaded into my main memory I told
you what is the first thing that happens ?then it will come to this line it will come to fun1 ( ) ,
it will execute fun1 ( ) . fun2 ( ) is calling inside fun1 ( ) now the variables that I had created
inside it will be created here let 's say I have created `` k '' & `` l '' let me write here : initialize
k and l and after that I 'm calling fun2 ( ) so as soon as fun2 ( ) will be called it will say to fun1
( ) that you wait for a while , I call fun2 ( ) and be back by fetching the value whatever it will
return fun1 ( ) replied that you go and get it call fun2 ( ) and get its value .
me where do I give the milk to the milkman because the pointer will store the address of the
malloced memory so the milkman will get the milk from the pointer and the pointer will stay
there until you return the function or until you delete it.it will say to fun1 ( ) that you 're
coming back and now you can start your execution again . If anyone asks you this question,
that why heap is used, it can also be done from stack. So that thing is done here with the
help of dynamic memory because when does the stack of a function end it ends when the
function is returned. I just come back with the value you just wait here. You go and get it and
then what will happen, fun function will be called.
this video we will focus on linked list & binary search tree so if you want to know more about
these then you should go ahead and watch the video and learn more about these things . If
you still think that you want to do all of these things with Python, then I am saying that when
you will go for an interview, the person in front of you will expect C, C++, or Java from you. If
you don't know C properly, then I have made a 15-hour long video of C with notes.
Time Complexity and Big O Notation
Introduction to Data Structures & Algorithms ....................... 1
Time Complexity and Big O Notation ....................................... 2
Asymptotic Notations: Big O, Big Omega and Big Theta
Explained....................................................................................... 3
Best Case, Worst Case and Average Case Analysis of an
Algorithm ...................................................................................... 3
How to Calculate Time Complexity of an Algorithm + Solved
Questions ...................................................................................... 4
Introduction to Data Structures & Algorithms
should be able to use it in your work or in your projects or in your courses or in your projects
that you are doing in the future or in your work that you are doing right now so if you want
to use something then you should be able to use it in your work or in your projects or in your
courses or in your future work or in your projects that you are doing right now . So data
structures and algorithms are things that help us in our work or in our projects or in our
courses or in our future projects or in our work or in our projects that we are doing right now
so if you want to use something then you should be able to use it in your work or in your
projects or in your courses or in your future work or in your projects that you are doing right
nowwater in a pot and you put the tea bag in the cup and you make the coffee Now what is
the difference between data structures and algorithms? Algorithms are specific steps that
need to be taken in order to solve a problem.I have been in the industry for a long time now
and I have seen a lot of people learning C , C++ and when they start to learn it they get very
lost & confused & they don't know what they are doing & they don't know how to use the
language properly & eventually they stop learning it & they end up becoming a beginner
again & that is not good for the industry & it is not good for the learners either so I would
say learn C , C++ & don't get lost in the language learning process
a break for a while I understand that you are very busy for the next few days and I u nderstand
that you are very busy for the next few weeks and I understand that you have a lot of
questions so I 'll just stop now and I 'll come back to you in a few days and we will start the
next video where we will talk about algorithms and data structures and then we will talk
about interviews and then finally we will talk about the final exam and you can ask me any
questions that you have in your mind so that 's all for now I 'll come back to you in a few
days and we will start the next videowhat is the data structure of chrome so now we see that
the data structure is called RAM so the data structure of a database is called RAM because
, when the program starts it will load into RAM the data structure of the database which is
called RAM . And then you will get to hear this and it is asked in the interviews, "tell me, what
is this?" So now let's understand database, data warehouse, and big data here we have
understood the data structure that when your program starts in RAM, it will load into the
random access memory.I want to keep the data in a different database so what I have to do is
I have to create a new database and I have to name it `` legacyData '' I have to create a new
table in that database and I have to add the following column in the table `` Bir thday `` I have
to add the following column in the table `` Year `` Now I have to run the program and I will
get the following result in the console `` Facebook 2020 `` Facebook 2021 `` Facebook 2009 ``
`` Facebook 2020 `` Facebook 2021 `` Facebook 2009 `` `` Facebook 2009 `` You retrieve and
read the data from hard disk drive and update it.
know these three terms because big data is what we are talking about here .memory location
where the C program stores the data that is to be processed next and the heap is a memory
location where the C program stores the data that is to be processed next but the data that is
to be processed next is not always stored in the same location as the data that is to be
processed next because the C program can keep data in different memory locations
depending on the situation and this is why it is important for you to understand the stack
and heap because you will be able to understand the C program better and be able to ask
more questions on the C program. Alright ... I 'm talking about C program that 's why I say
that you get a good picture of memory with the help of C programming therefore , data
structures and algorithms is best learned from C and C++ Now here I am dividing it into
segments so there is thing called code segment let 's say this is my code let 's say there is a
code with the name `` harry.c '' now this code will be first loaded into my main memory I told
you what is the first thing that happens ?then it will come to this line it will come to fun1 ( ) ,
it will execute fun1 ( ) . fun2 ( ) is calling inside fun1 ( ) now the variables that I had created
inside it will be created here let 's say I have created `` k '' & `` l '' let me write here : initialize
k and l and after that I 'm calling fun2 ( ) so as soon as fun2 ( ) will be called it will say to fun1
( ) that you wait for a while , I call fun2 ( ) and be back by fetching the value whatever it will
return fun1 ( ) replied that you go and get it call fun2 ( ) and get its value .
me where do I give the milk to the milkman because the pointer will store the address of the
malloced memory so the milkman will get the milk from the pointer and the pointer will stay
there until you return the function or until you delete it.it will say to fun1 ( ) that you 're
coming back and now you can start your execution again . If anyone asks you this question,
that why heap is used, it can also be done from stack. So that thing is done here with the
help of dynamic memory because when does the stack of a function end it ends when the
function is returned. I just come back with the value you just wait here. You go and get it and
then what will happen, fun function will be called.
this video we will focus on linked list & binary search tree so if you want to know more about
these then you should go ahead and watch the video and learn more about these things . If
you still think that you want to do all of these things with Python, then I am saying that when
you will go for an interview, the person in front of you will expect C, C++, or Java from you. If
you don't know C properly, then I have made a 15-hour long video of C with notes.
Time Complexity and Big O Notation
