100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Summary Data Structures - CS 301 $60.99   Add to cart

Summary

Summary Data Structures - CS 301

 9 views  0 purchase
  • Course
  • Institution
  • Book

Data Structure is a systematic way to organize data in order to use it efficiently. Following terms are the foundation terms of a data structure.  Interface − Each data structure has an interface. Interface represents the set of operations that a data structure supports. An interface only...

[Show more]

Preview 4 out of 264  pages

  • Yes
  • May 7, 2023
  • 264
  • 2022/2023
  • Summary
avatar-seller
, Data Structures & Algorithms




About the Tutorial
Data Structures are the programmatic way of storing data so that data can be used
efficiently. Almost every enterprise application uses various types of data structures in one
or the other way.

This tutorial will give you a great understanding on Data Structures needed to understand
the complexity of enterprise level applications and need of algorithms, and data structures.




Audience
This tutorial is designed for Computer Science graduates as well as Software Professionals
who are willing to learn data structures and algorithm programming in simple and easy
steps.

After completing this tutorial you will be at intermediate level of expertise from where you
can take yourself to higher level of expertise.




Prerequisites
Before proceeding with this tutorial, you should have a basic understanding of C
programming language, text editor, and execution of programs, etc.




Copyright and Disclaimer
© Copyright 2016 by Tutorials Point (I) Pvt. Ltd.

All the content and graphics published in this e-book are the property of Tutorials Point (I)
Pvt. Ltd. The user of this e-book is prohibited to reuse, retain, copy, distribute or republish
any contents or a part of contents of this e-book in any manner without written consent
of the publisher.

We strive to update the contents of our website and tutorials as timely and as precisely as
possible, however, the contents may contain inaccuracies or errors. Tutorials Point (I) Pvt.
Ltd. provides no guarantee regarding the accuracy, timeliness or completeness of our
website or its contents including this tutorial. If you discover any errors on our website or
in this tutorial, please notify us at contact@tutorialspoint.com




i

, Data Structures & Algorithms




Compile & Execute Online
For most of the examples given in this tutorial you will find Try it option, so just make use
of this option to execute your programs on the spot and enjoy your learning.

Try the following example using the Try it option available at the top right corner of the
following sample code box −

#include <stdio.h>


int main(){
/* My first program in C */
printf("Hello, World! \n");


return 0;
}




ii

, Data Structures & Algorithms




Table of Contents
About the Tutorial ............................................................................................................................................ i
Audience ........................................................................................................................................................... i
Prerequisites ..................................................................................................................................................... i
Copyright and Disclaimer ................................................................................................................................. i
Compile & Execute Online ............................................................................................................................... ii
Table of Contents ........................................................................................................................................... iii


BASICS......................................................................................................................................... 1

1. Overview .................................................................................................................................................. 2
Characteristics of a Data Structure .................................................................................................................. 2
Need for Data Structure .................................................................................................................................. 2
Execution Time Cases ...................................................................................................................................... 3
Basic Terminology ........................................................................................................................................... 3

2. Environment Setup ................................................................................................................................... 4
Try it Option Online ......................................................................................................................................... 4
Local Environment Setup ................................................................................................................................. 4
Installation on UNIX/Linux ............................................................................................................................... 5
Installation on Mac OS..................................................................................................................................... 5
Installation on Windows .................................................................................................................................. 6


ALGORITHM ................................................................................................................................ 7

3. Algorithms ─ Basics ................................................................................................................................... 8
Characteristics of an Algorithm ....................................................................................................................... 8
How to Write an Algorithm? ........................................................................................................................... 9
Algorithm Analysis ......................................................................................................................................... 10
Algorithm Complexity .................................................................................................................................... 11
Space Complexity .......................................................................................................................................... 11
Time Complexity ............................................................................................................................................ 11

4. Asymptotic Analysis ................................................................................................................................ 12
Asymptotic Notations .................................................................................................................................... 12
Common Asymptotic Notations .................................................................................................................... 15

5. Greedy Algorithms .................................................................................................................................. 16
Counting Coins............................................................................................................................................... 16

6. Divide & Conquer .................................................................................................................................... 18
Divide/Break .................................................................................................................................................. 18
Conquer/Solve ............................................................................................................................................... 18
Merge/Combine ............................................................................................................................................ 19

7. Dynamic Programming............................................................................................................................ 20




iii

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller janewafula. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $60.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

75323 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$60.99
  • (0)
  Add to cart