Decks in this Class (25):

Data Structures Overview Terms Concepts
Data Structures Overview Terms & Concepts
Sample Cards:array,array insertion,array index69 CardsPreview Flashcards 
Unit 1 Chapters 1 2 3 Data Structures Ov
Unit 1 Chapters 1,2,3 Data Structures Overview Code
Sample Cards:bubble sort,array,ordered array7 CardsPreview Flashcards 
Unit 2 Chapter 4 Stacks And Queues Code
Unit 2 Chapter 4 Stacks and Queues Code
Sample Cards:priority queue,stack,reverse a string7 CardsPreview Flashcards 
Unit 3 Chapter 5 Linked Lists Code
Unit 3 Chapter 5 Linked Lists Code
Sample Cards:sorted list,insertion sort,linkstack9 CardsPreview Flashcards 
Unit 4 Chapter 6 Recursion Code
Unit 4 Chapter 6 Recursion Code
Sample Cards:triangle,towers,stacktriangle28 CardsPreview Flashcards 
Unit 5 Chapter 7 Advanced Sorting Code
Unit 5 Chapter 7 Advanced Sorting Code
Sample Cards:shellsort,quicksort3,quicksort25 CardsPreview Flashcards 
Unit 6 Chapter 8 Binary Trees Code
Unit 6 Chapter 8 Binary Trees Code
Sample Cards:tree1 CardsPreview Flashcards 
Unit 7 Chapter 10 2 3 4 Trees Code
Unit 7 Chapter 10 234 Trees Code
Sample Cards:tree234,hashdouble,hashchain4 CardsPreview Flashcards 
Unit 8 Chapter 11 Hash Tables Code
Unit 8 Chapter 11 Hash Tables Code
Sample Cards:hashdouble,hashchain,hash3 CardsPreview Flashcards 
Unit 9 Chapter 12 Heaps Code
Unit 9 Chapter 12 Heaps Code
Sample Cards:heap1 CardsPreview Flashcards 
Unit 10 Chapter 13 Graphs Code
Unit 10 Chapter 13 Graphs Code
Sample Cards:dfs,bfs,path3 CardsPreview Flashcards 
Unit 2 Chapter 4 Stacks And Queues Terms
Unit 2 Chapter 4 Stacks and Queues Terms & Concepts
Sample Cards:stacks,stack fifo or lifo storage mechanism,stack terms for adding and taking away i16 CardsPreview Flashcards 
Unit 3 Chapter 5 Linked Lists Terms Conc
Unit 3 Chapter 5 Linked Lists Terms & Concepts
Sample Cards:each link object contains references to,how is linked list self referential,in an array each item occupies a particu24 CardsPreview Flashcards 
Questions Chapter 1
Questions Chapter 1
Sample Cards:in many data structures you can _______,rearranging the contents of a data struc,in a database a field is a specific data12 CardsPreview Flashcards 
Questions Chapter 2
Questions Chapter 2
Sample Cards:inserting an item into an unordered arra,true or false when you delete an item fr,in an unordered array allowing duplicate22 CardsPreview Flashcards 
Questions Chapter 3
Questions Chapter 3
Sample Cards:computer sorting algorithms are more lim,the two basic operations in simple sorti,true or false the bubble sort always end20 CardsPreview Flashcards 
Questions Chapter 4
Questions Chapter 4
Sample Cards:suppose you push 10 20 30 and 40 onto th,which of the following is true a the pop,what do lifo and fifo mean18 CardsPreview Flashcards 
Questions Chapter 5
Questions Chapter 5
Sample Cards:which of the following is not true a ref,access to the links in a linked list is,when you create a reference to a link in25 CardsPreview Flashcards 
Questions Chapter 6
Questions Chapter 6
Sample Cards:if the user enters 10 in the trianglejav,where are the copies of the argument in,assume the user enters10 in the triangle24 CardsPreview Flashcards 
Questions Chapter 7
Questions Chapter 7
Sample Cards:the shellsort works by a partitioning th,if an array has 100 elements then knuth,to transform the insertion sort into the28 CardsPreview Flashcards 
Questions Chapter 8
Questions Chapter 8
Sample Cards:trees consist of ______ connected by ___,in a binary tree a node has at most ____,in a binary tree all the nodes that are24 CardsPreview Flashcards 
Questions Chapter 10
Questions Chapter 10
Sample Cards:a 2 3 4 tree is a multiway tree with up,in a multiway tree the keys in a node ar,in a 2 3 4 tree all insertions are made27 CardsPreview Flashcards 
Questions Chapter 11
Questions Chapter 11
Sample Cards:using big o notation how long does it ta,a ______ ______ transforms a range of ke,using the next available position after22 CardsPreview Flashcards 
Questions Chapter 12
Questions Chapter 12
Sample Cards:what does the term complete mean when ap,what does the term weakly ordered mean w,in a heap a node is always removed from17 CardsPreview Flashcards 
Questions Chapter 13
Questions Chapter 13
Sample Cards:graphs consist of _______ connected by _,the two main search algorithms of a grap,the depth first search algorithm can be12 CardsPreview Flashcards
Current Learners (895)
 —— — 1187 cards viewed
 David S 981 cards viewed
 Licheng Xiao See full stats
 Alvin Mann See full stats
 Sere nium See full stats
 Jovica Spasic See full stats
 Robert Flynn See full stats
 oz g See full stats
 Meeeraa Khalifa See full stats
 Pradeep Poluri See full stats
Popular Related Classes Brainscape Certified  ( See All )
Data Structures and Algorithms
10 Decks 
120 Cards 
2 Learners
Decks: Lecture 1, Lecture 2 Fundamentals Of Algorithms And, 3 Data Structures Arrays Lists Stacks Qu, And more!
2. Data structures and algo patterns
6 Decks 
332 Cards 
24 Learners
Decks: Data Structure And Algorithm Patterns, Hard And Probably Unimportant Questions, Common And Useful Probs, And more!
Computational thinking, algorithms an...
24 Decks 
338 Cards 
2 Learners
Decks: Computational Thinking, Writing Algorithms Flow Diagrams And Pse, Searching And Sorting Algorithms, And more!