DSA Flashcards Exam UPDATED ACTUAL QUESTIONS AND CORRECT ANSWERS

DSA Flashcards Exam UPDATED
ACTUAL QUESTIONS AND CORRECT
ANSWERS
What are the 4 simple rules to determine Big O of a function? - CORRECT ANSWER 1 - Find
the worst case<br>2 - Remove the constants<br>3 - Use different terms for multiple inputs
(arguments of the function)<br>4 - Drop non dominants (keep only the worst case)



List the common Big O complexities from worst to best<br>(there are 7) - CORRECT
ANSWER O(n!)<br>O(2^n)<br>O(n^2)<br>O(n log n)<br>O(n)<br>O(log n)<br>O(1)



What are the 3 pillars of programming? - CORRECT ANSWER Readability<br>Memory
(Space)<br>Speed (Time)



What are 4 things that can affect space complexity? - CORRECT ANSWER Variables<br>Data
Structures<br>Function Calls<br>Allocations



Space complexity is not concerned with the size of the input per se but the... - CORRECT
ANSWER ...memory that is being allocated for each operation.



What are the 2 pillars of Data Structures? - CORRECT ANSWER How to build one<br>How
to use one



What are the 6 operations you can do within a data structure? - CORRECT
ANSWER Insertion<br>Deletion<br>Traversal<br>Searching<br>Sorting<br>Accessing



What is an algorithm? - CORRECT ANSWER Steps to complete a desired action in computers.
Technically all functions are algorithms.



Big O Complexity Chart: Flip Card - CORRECT ANSWER



What is factorial time complexity? Would you recommend using it using this scale
[Excellent,Good,Fair,Bad,Horrible]? - CORRECT ANSWER O(n!) - Horrible