Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Class notes

Data Structure

Rating
-
Sold
-
Pages
7
Uploaded on
02-04-2023
Written in
2022/2023

A data structure is a way of organizing and storing data in a computer so that it can be accessed and used efficiently. In computer science, data structures are essential for solving complex problems by providing efficient algorithms and operations for storing, retrieving, and manipulating data. There are many different types of data structures, including arrays, linked lists, stacks, queues, trees, graphs, and hash tables. Each data structure has its own unique properties and operations that make it suitable for different types of problems. Arrays are a basic data structure that store a collection of elements of the same data type in contiguous memory locations. Arrays can be accessed using an index, which is a numerical value that specifies the position of an element in the array. Linked lists are another data structure that consists of a sequence of nodes, each containing a data value and a pointer to the next node in the sequence. Linked lists can be used to implement dynamic data structures that can be resized during runtime. Stacks and queues are data structures that use a Last-In-First-Out (LIFO) and First-In-First-Out (FIFO) order, respectively. Stacks allow for pushing and popping elements from one end, while queues allow for enqueuing and dequeuing elements from both ends. Trees and graphs are more complex data structures that consist of nodes and edges that connect them. Trees are a hierarchical data structure that has a single root node and branches out into subtrees, while graphs can be cyclic and have multiple paths between nodes. Hash tables are a data structure that uses a hash function to map keys to values, allowing for constant time access and insertion of elements. In summary, data structures provide a way of organizing and storing data in a computer that allows for efficient access, retrieval, and manipulation of data. There are many different types of data structures, each with its own unique properties and operations that make it suitable for different types of problems.

Show more Read less
Institution
Course

Content preview

Introduction to Data Structures & Algorithms
CodeWithHarry
This course is primarily for placement preparation and will be using C and C++ for the
algorithms and data structures. The notes for the course will be provided in PDF format for
convenience. Data structures are essential for developing efficient algorithms that arrange
data in main memory for optimal usage. It's important to note that algorithms and data
structures are two different things. C is a bare-bones programming language that requires
you to do everything yourself, but Java can also be used to implement algorithms. This
course is ideal for those looking to switch jobs or prepare for interviews, and there is a
15-hour video on C programming available on the channel with notes.
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
Data structure is the arrangement of data in main memory, and the concept of database,
data warehouse, and big data will be covered in the course. The fuel of big algorithms is
data, and keeping it properly in the hard disk is essential for efficient retrieval, updating, and
deletion. Although data warehousing is beyond the scope of this course, it's still important to
understand it. Data structures and algorithms are best learned from C and C++, which
provide a good picture of memory usage. The concepts of stack and heap are essential in
understanding how C programs work, and space and time complexity will be covered in
future videos. Overall, this course will cover many data structure concepts, such as linked
lists, arrays, binary search trees, and more.
a break for a while I understand that you are very busy for the next few days and I understand
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 `` Birthday `` 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 .
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 .

Written for

Course

Document information

Uploaded on
April 2, 2023
Number of pages
7
Written in
2022/2023
Type
Class notes
Professor(s)
Harry
Contains
All classes

Subjects

$7.49
Get access to the full document:

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Get to know the seller
Seller avatar
yogendrrathod

Get to know the seller

Seller avatar
yogendrrathod Exam Questions
Follow You need to be logged in order to follow users or courses
Sold
-
Member since
3 year
Number of followers
0
Documents
2
Last sold
-

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions