This class was created by Brainscape user David Cesarini. Visit their profile to learn more about the creator.

By:
David Cesarini

- decks
- flashcards
- learners

Data Structures Overview Terms & Concepts

Array,

Array insertion,

Array index

69
cards

Unit 1 Chapters 1,2,3 Data Structures Overview Code

Bubble sort,

Array,

Ordered array

7
cards

Unit 2 Chapter 4 Stacks and Queues Code

Priority queue,

Stack,

Reverse a string

7
cards

Unit 3 Chapter 5 Linked Lists Code

Sorted list,

Insertion sort,

Linkstack

9
cards

Unit 4 Chapter 6 Recursion Code

Triangle,

Towers,

Stacktriangle2

8
cards

Unit 5 Chapter 7 Advanced Sorting Code

Shellsort,

Quicksort3,

Quicksort2

5
cards

Unit 6 Chapter 8 Binary Trees Code

Tree

1
cards

Unit 7 Chapter 10 2-3-4 Trees Code

Tree234,

Hashdouble,

Hashchain

4
cards

Unit 8 Chapter 11 Hash Tables Code

Hashdouble,

Hashchain,

Hash

3
cards

Unit 9 Chapter 12 Heaps Code

Heap

1
cards

Unit 10 Chapter 13 Graphs Code

Dfs,

Bfs,

Path

3
cards

Unit 2 Chapter 4 Stacks and Queues Terms & Concepts

Stacks,

Stack fifo or lifo storage mechanism,

Stack terms for adding and taking...

16
cards

Unit 3 Chapter 5 Linked Lists Terms & Concepts

Each link object contains referen...,

How is linked list self referential,

In an array each item occupies a ...

24
cards

Questions Chapter 1

In many data structures you can _...,

Rearranging the contents of a dat...,

In a database a field is a specif...

12
cards

Questions Chapter 2

Inserting an item into an unorder...,

True or false when you delete an ...,

In an unordered array allowing du...

22
cards

Questions Chapter 3

Computer sorting algorithms are m...,

The two basic operations in simpl...,

True or false the bubble sort alw...

20
cards

Questions Chapter 4

Suppose you push 10 20 30 and 40 ...,

Which of the following is true a ...,

What do lifo and fifo mean

18
cards

Questions Chapter 5

Which of the following is not tru...,

Access to the links in a linked l...,

When you create a reference to a ...

25
cards

Questions Chapter 6

If the user enters 10 in the tria...,

Where are the copies of the argum...,

Assume the user enters10 in the t...

24
cards

Questions Chapter 7

The shellsort works by a partitio...,

If an array has 100 elements then...,

To transform the insertion sort i...

28
cards

Questions Chapter 8

Trees consist of ______ connected...,

In a binary tree a node has at mo...,

In a binary tree all the nodes th...

24
cards

Questions Chapter 10

A 2 3 4 tree is a multiway tree w...,

In a multiway tree the keys in a ...,

In a 2 3 4 tree all insertions ar...

27
cards

Questions Chapter 11

Using big o notation how long doe...,

A ______ ______ transforms a rang...,

Using the next available position...

22
cards

Questions Chapter 12

What does the term complete mean ...,

What does the term weakly ordered...,

In a heap a node is always remove...

17
cards

Questions Chapter 13

Graphs consist of _______ connect...,

The two main search algorithms of...,

The depth first search algorithm ...

12
cards

data structures and algorithms

- Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study David Cesarini's Data Structures and Algorithms flashcards now!

Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.

Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!

Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.

We use an adaptive study algorithm that is proven to help you learn faster and remember longer....

- 7 decks
- 108 flashcards
- 17 learners

Decks:
Sorting, Arrays, Linked List, And more!