Data Structures flashcards
177 flashcard decks by 107 users · Page 1 of 5
Explore Data Structures flashcards on GoConqr, covering arrays, linked lists, graphs and sorting. University students and professional candidates can practise definitions and analysis, while school students can revise key structures and teachers can find questions. The page brings together over 160 flashcards by more than 100 users. Choose a deck and start revising.
Select topic
Flashcards
-
22 cardsF453 Data Structures - Stacks and Queues What is a static data structure?
-
11 cardsArrays
-
25 cardsChapter 8 (Arrays) This appears in an array declaration and specifies the number of elements the array can hold.
-
34 cardsAlgorithms and Data Structures - Basic Data Structures What is an algorithm? (Def)
-
66 cardsgraph theory
-
8 cardsLists and Linked Lists | Data Structures - OCR Computer Science A Level What is a List?
-
19 cardsWeek 3: Sorting, time complexity & exceptions/assertions
-
11 cardsGraphs | Data Structures - OCR Computer Science A Level What are Graphs?
-
184 cardsINF 675 - Final Exam Study Guide In AVL tree insert, suppose node w has been inserted by performing standard Binary Search Tree insertion. S...
-
107 cardsFinal Exam Review What can be said in general about sorting-by-comparison algorithms?
-
44 cardsCSE 110 Chapter 06a Review 1) Consider the following line of code: int[] somearray = new int[30]; Which one of the following options i...
-
143 cardsBYUI CS235 Final Study Flash cards to review the behemoth amount of material the crammed into one course.
-
44 cards[Almost Done] Data Structures - OCR Computer Science A Level What is an Abstract Data Structure?
-
20 cardsData Structures What is a data structure?
-
55 cardsCOSC241 Simple Loop from 0 - n
-
54 cardsDSA Lecture 3 What is a tree and what does it consist of?
-
45 cardsUnit 1 Ada Developer Academy
-
35 cards254 notes
-
42 cardsLists define a list
-
43 cardsDSA: Lecture 4
-
34 cardsM269
-
28 cardsData structures and Algorithms Little o(N) and growth
-
30 cards4.2 Fundamentals of Data Structures What is a data structure
-
25 cardsFundamentals of Data Structures FINISHED What is meant by a static data structure
-
24 cardsGraphs, Trees and Hash Tables What is a tree?
-
35 cardsDSA: Lecture 2 Which type of running time is usually focused on and why?
-
15 cardsCommon 241 Questions Give the formal definition of f(n) = O(g(n))
-
33 cardsFlash Cards -List & Dictionary
-
26 cardsCE204
-
18 cards08227 Flash Card
-
7 cardsUntitled What is graphs?
-
7 cardsGraphs flashcard What is graphs?
-
31 cardsUnit 7 Composite data type
-
34 cardsDSA: Lecture 1 What does ADT stand for?
-
20 cardsData structures 4.2.1
-
10 cardsQueues Define: 1. Abstract data type (ADT) 2. Queue
-
24 cardsProgram Analysis Theory Questions What is a problem?
-
16 cards4.2.6 Hash Table
-
23 cardsCMPUT 175 final exam review What are the best-case, worst-case, and average case running times of Bubble Sort?
-
19 cardsdata structures trees etc what is an array
More Data Structures resources
About data structures flashcards
GoConqr OriginalWhat the data structures flashcards cover
The decks range from Arrays and Stacks, Queues to Graphs and Trees. Other cards cover graph theory terms, sorting, time complexity and program analysis. The linked-list deck includes questions on operations and inserting items into a static list.
Choosing and using a deck
Start with Arrays if you want to review elements, declarations and bounds checking. For practice with questions, the stacks and queues deck asks about static and dynamic structures, as well as LIFO and FIFO. The graph deck for OCR A-level Computer Science asks about directed and undirected graphs and their representations.
Try answering each card before looking at its answer, then revisit the questions you find difficult. If you want a visual overview or a different way to check your understanding, switch to a mind map or quiz on the unit page. Pick a deck that matches the topic you are studying.
Frequently asked questions
Which flashcard deck is a good place to start?
The Arrays deck is a starting point for reviewing elements, declarations and bounds checking. For question-led revision, the stacks and queues deck covers static and dynamic structures alongside LIFO and FIFO. Both give you a focused topic to work through before moving to another deck.
Are these flashcards suitable for different levels and exams?
The page includes material for university students and professional candidates as well as school students. Exam names mentioned across the resources include GCSE Computer Science, A-level Computing and OCR A-level Computer Science. Teachers can also use the decks to find questions on structures such as lists and graphs.
Are the flashcards free to use?
Yes. Every resource listed here is free to open and study without an account. The resources were made by GoConqr users. A free account also lets you make your own flashcards, quizzes, mind maps and notes, and save your quiz scores.
Can I find flashcards on algorithms as well as structures?
Yes. The basic data structures deck includes questions about algorithms and arrays. A separate sorting deck covers bubble sort, selection sort and time complexity, while Program Analysis Theory Questions includes prompts on problems, algorithms and asymptotic analysis. These sit alongside decks focused on individual structures.