# Coding Interview Preparation - Final graded assessment

1. **When will you be most likely be given an opportunity to show off your ability to code?**
    
    * During the screening call
        
    * <mark>During a technical interview</mark>
        
    * During the Quiz
        
2. **How many representations can be made from a byte?**
    
    * <mark>256</mark>
        
    * 128
        
    * 64
        
3. **If an application returned a result after one computation it ran in:**
    
    * O(n)
        
    * <mark>O(1)</mark>
        
    * O(log(n))
        
4. **Space complexity is more concerned with:**
    
    * Continuum
        
    * <mark>Space</mark>
        
    * Time
        
5. **Which of the following are linear structures?**
    
    * <mark>Arrays</mark>
        
    * Trees
        
    * Graphs
        
6. **True or false: Lists are objects therefore can be sorted.**
    
    * <mark>True</mark>
        
    * False
        
7. **What is in-place swapping?**
    
    * Moving values in an array if the element being added is smaller.
        
    * Using different types of data structures as a container to emulate certain characteristics.
        
    * <mark>Swapping items in an array in place of creating a new structure.</mark>
        
8. **Which of the following are actual data structures?**
    
    * C Trees
        
    * A Trees
        
    * <mark>B Trees</mark>
        
9. **Which of the following statements are true?**
    
    * <mark>A hash table increases space usage to increase speed.</mark>
        
    * A hash table decreases space usage to increase speed.
        
    * A hash table decreases speed to decrease space usage
        
10. **True or false: Dynamic programming is about using dynamic structures when coding.**
    
    * True
        
    * <mark>False</mark>
        

---

![](https://cdn.hashnode.com/res/hashnode/image/upload/v1728195163915/9e0ac128-a672-48cf-a3ad-896c8723d5cf.png align="center")