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

Class notes Discrete Structures and Algorithms

Rating
-
Sold
-
Pages
4
Uploaded on
26-04-2023
Written in
2022/2023

Data structures are the ways in which data is organized, stored and accessed in a computer program, while algorithms are the procedures or steps used to solve a particular problem. Data structures and algorithms are both important parts of computer science and are used in many different areas of software development, including artificial intelligence, machine learning, and data analysis. Choosing the right data structure and algorithm is essential for efficient and effective problem-solving. For example, using a binary search algorithm with a sorted list of data can be much faster than a linear search algorithm with an unsorted list of data. Common data structures include arrays, linked lists, stacks, queues, trees, and graphs. Each data structure has its own strengths and weaknesses, and the choice of which one to use will depend on the specific problem being solved. Similarly, there are many different algorithms that can be used to solve a given problem, and choosing the right one is essential for efficient and effective problem-solving. Common algorithms include sorting algorithms, search algorithms, and graph algorithms, among others. Each algorithm has its own time and space complexity, which determines how efficient it is in terms of time and memory usage. Understanding data structures and algorithms is essential for software developers, as it enables them to write more efficient and effective code, and solve complex problems more easily. It is also an important part of computer science education and is typically taught in introductory programming courses.

Show more Read less
Institution
Course

Content preview

Discrete Structure
Notes
1.1 Arrays in Data Structure | Declaration,
Initialization, Memory representation
data is to be represented in memory or you can see the memory representation of an array.
you will see what the need of ferry is what does any types of ferry how areas can be
declared how arrays can be. be. declared and how data can be stored in memory. you will
see how the state must be stored first this decimal number 5 has to. be converted into
binary it’s binary number sorry that is in 32 bits. faerie explains what is need of faerie and
how to deal with it. faerie: we must process large amount of return that is why the concept
of array came now you will modify this declaration such that under one variable name we
can store roll numbers of all 60 students that is what array now how you can do this.
declaration of arrays language specific i am considering the syntax in c language in python
maybe it’s different in pascal in you can say that foreign language the declaration syntax
would be a little bit different, so it is language specific fine now this is what the array
declaration is.
The data is stored in consecutive locations or continuous locations one after another. The
index starts from zero but can also start from one. The data is stored in binary form and the
address of the data is calculated in hexadecimal form.
At runtime, you can initialize the array using loops, maybe for loop while you do loop and
some predefined function standard functions that is scanner. In next video, I'm going to
discuss it how the data is to be taken from the user how the data is to be stored in the array.
In next video, we are going to discuss how the data is to be inserted how the arrays are to
be traversed different types of operations on 1d array first with their time taken. After that,
we will discuss what is 2d array as well as how 2d arrays are to be accessed from the air
fine.

1.2 Array Operations - Traversal, Insertion |
Explanation with C Program | DSA Course
Operations on Arrays in Data Structure
In this blog post, we will be discussing the various operations that can be performed on 1D
arrays in data structures. We have already covered the fundamentals of arrays, including
why they are needed, how to declare them, and their memory representation in a previous
post. Today, we will focus on how to traverse an array, how to insert data into an array, and
the three types of insertion (at the beginning, at the end, or at a specific position). The most

Written for

Institution
Course

Document information

Uploaded on
April 26, 2023
Number of pages
4
Written in
2022/2023
Type
Class notes
Professor(s)
Aliyah
Contains
All classes

Subjects

$8.99
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
irajshahid

Get to know the seller

Seller avatar
irajshahid University of Karachi
Follow You need to be logged in order to follow users or courses
Sold
-
Member since
3 year
Number of followers
0
Documents
1
Last sold
-

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Recently viewed by you

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