Exam (elaborations)
C949 Data Structures and Algorithms I Questions and Answers 2024
- Course
- Institution
C949 Data Structures and Algorithms I
[Show more]
Content preview
C949 Data Structures and Algorithms ITask decomposition - answer means to reduce a complex task into simpler basic steps,
making the whole task easier to solve.
interactive interpreter - answer is a program that allows the user to execute one line of
code at a time.
A statement - answeris a program instruction. A program mostly consists of a series of
statements, each statement usually appears on its own line.
Expressions - answerare code that return a value when evaluated; for example, the
code wage * hours * weeks is an expression that computes a number. * is the symbol
for multiplication. The names wage, hours, weeks, and salary are variables, which are
named references to values stored by the interpreter.
Record - answerA record is the data structure that stores subitems, often called fields,
with a name associated with each subitem.
Array - answerAn array is a data structure that stores an ordered list of items, where
each item is directly accessible by a positional index.
-may only store homogeneous data elements
Linked list - answerA linked list is a data structure that stores an ordered list of items in
nodes, where each node stores data and has a pointer to the next node.
Binary tree - answerA binary tree is a data structure in which each node stores data and
has up to two children, known as a left child and a right child.
Hash table - answerA hash table is a data structure that stores unordered items by
mapping (or hashing) each item to a location in an array.
Heap - answerA max-heap is a tree that maintains the simple property that a node's key
is greater than or equal to the node's childrens' keys. A min-heap is a tree that
maintains the simple property that a node's key is less than or equal to the node's
childrens' keys.
Graph - answerA graph is a data structure for representing connections among items,
and consists of vertices connected by edges. A vertex represents an item in a graph. An
edge represents a connection between two vertices in a graph.
, List - answerA list is an ADT for holding ordered data, where the order is based on how
the program insert or removes items. A list may contain duplicate items.
Set - answerA set is an ADT for a collection of distinct items, so duplicate items are not
allowed.
Priority queue - answerA priority queue is an ADT where each item has a priority. Items
with higher priority are closer to the front of the queue than items with lower priority, so
the item's priority determines the item's position in the queue. Both duplicate items and
items with the same priority are allowed.
Bag - answerA bag is an ADT for storing items in which the order does not matter and
duplicate items are allowed.
Stack - answerA stack is an ADT in which items are only inserted on or removed from
the top of a stack.
Queue - answerA queue is an ADT in which items are inserted at the end of the queue
and removed from the front of the queue.
Deque - answerA deque (pronounced "deck" and short for double-ended queue) is an
ADT in which items can be inserted and removed at both the front and back.
Dictionary (Map) - answerA dictionary is an ADT that associates (or maps) keys with
values.
Push(queue, x) - answerInserts x at end of the queue
Pop(queue) - answerReturns and removes item at front of queue
Peek(queue) - answerReturns but does not remove item at the front of the queue
IsEmpty(queue) - answerReturns true if queue has no items
GetLength(queue) - answerReturns the number of items in the queue
list - answeris mutable, and is thus able to grow and shrink without the program having
to replace the entire list with an updated copy.
A constant time operation - answeris an operation that, for a given processor, always
operates in the same amount of time, regardless of input values.
Algorithm efficiency - answeris typically measured by the algorithm's computational
complexity.
The benefits of buying summaries with Stuvia:
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
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
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 Dreamer252. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $13.49. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
73773 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now