CSCE 314 Past Quiz Questions with Complete Solutions
0 view 0 purchase
Module
CSCE 314 Past
Institution
CSCE 314 Past
CSCE 314 Past Quiz Questions with
Complete Solutions
What is a linked list in computer science?
A data structure where each element, or node, contains a value and a reference to the next
node in the sequence.
What is the difference between a singly linked list and a doubly linked list?
...
CSCE 314 Past Quiz Questions with
Complete Solutions
What is a linked list in computer science?
✔✔ A data structure where each element, or node, contains a value and a reference to the next
node in the sequence.
What is the difference between a singly linked list and a doubly linked list?
✔✔ A singly linked list has nodes with a single reference to the next node, while a doubly linked
list has nodes with references to both the next and previous nodes.
What is the time complexity of accessing an element in an array?
✔✔ O(1), meaning it takes constant time to access an element by its index.
What is the time complexity of inserting an element at the beginning of a linked list?
✔✔ O(1), since you can insert the new node by adjusting the head reference.
How do you perform a breadth-first search (BFS) in a graph?
1
,✔✔ By using a queue to explore all nodes at the present depth level before moving on to nodes
at the next depth level.
How do you perform a depth-first search (DFS) in a graph?
✔✔ By using a stack (or recursion) to explore as far as possible along each branch before
backtracking.
What is a priority queue?
✔✔ A data structure where each element has a priority, and elements are dequeued based on
their priority rather than their order in the queue.
What is a graph's adjacency matrix?
✔✔ A square matrix used to represent a graph, where the element at row i and column j indicates
whether there is an edge between vertex i and vertex j.
What is the purpose of Dijkstra's algorithm?
✔✔ To find the shortest path from a source vertex to all other vertices in a weighted graph.
What is a dynamic programming approach?
2
, ✔✔ A method for solving complex problems by breaking them down into simpler subproblems
and storing the results to avoid redundant computations.
What is a stack in computer science?
✔✔ A data structure that follows the Last In, First Out (LIFO) principle.
What is a queue in computer science?
✔✔ A data structure that follows the First In, First Out (FIFO) principle.
How do you perform a push operation in a stack?
✔✔ By adding an element to the top of the stack.
What is the primary difference between a stack and a queue?
✔✔ A stack uses LIFO ordering, while a queue uses FIFO ordering.
What is a binary tree?
✔✔ A tree data structure where each node has at most two children.
3
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 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 ExcellentScores. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for £8.15. You're not tied to anything after your purchase.
