Code Questions
  • Home
  • Post
  • Category
Search
Code Questions
Dark ModeBlack Mode
Font
Shadow
Filter
Radius
Theme Color
Announcement
FIT1008/2085 question bank.
Code Questions
    • Site
    Code Questions
    74 Articles
    4 Categories
    20 Tags
    Categories
    A1 24A2 48A3 1Uncategorized 1
    Tags
    A1 24A2 48A3 1Binary Tree 1Bubble Sorting 5Dictionary ADT 1Hash Tables 12Insertion Sorting 7Iteration 10Iterators and Generators 10Linear Probing 8Linked ADTs 10Merge Sorting 2Quick Sorting 2Recursion 11Selection Sorting 7Separate Chaining 7Solved 25Sorting 27Unsolve 47

    Recent Posts

    • What is a binary tree? Explain the concept of nodes; including parent and child nodes. Given a binary tree containing N nodes, what is the maximum height such a tree can have?
    • Describe the stable and unstable versions of QuickSort and MergeSort.
    • Briefly describe MergeSort algorithm giving details about
    • Briefly describe QuickSort algorithm giving details about
    • Define the concept of recursion in computer science and explain how it is used in sorting algorithms. Give details about

    Recent Comments

    1. admin on What is a binary tree? Explain the concept of nodes; including parent and child nodes. Given a binary tree containing N nodes, what is the maximum height such a tree can have?
    2. admin on Describe the stable and unstable versions of QuickSort and MergeSort.
    3. admin on Define the concept of an iterator and explain how it works. Then, describe a scenario where and how iterators are helpful. Finally, explain what needs to be done to make an iterator class in Python.
    4. Anonymous on Describe how each of the below operations work for a Hash Table which uses separate chaining to handle collisions and give examples. What is the best-case and worst-case complexity of one of the below operations? Explain the reason for the best and worst case. No explanation no marks.
    5. C3EZ on Briefly describe QuickSort algorithm giving details about
    Give an example of a good/bad hash function targeting string-typed keys. Explain what it is good/bad.
    2024-8-31 8:03
    |
    18
    |
    0
    |
    A2

    7 Words
    |
    Few seconds
    Leave your answer below as a comment
    A2Hash TablesUnsolve
    Briefly describe a Hash Function by elaborating on the below points
    2024-8-31 8:03
    |
    20
    |
    0
    |
    A2

    29 Words
    |
    Few seconds
    What is its purpose? Properties of a Hash Function How to define a Hash Function Give an example of a Hash Function. Leave your answer below as a comment
    A2Hash TablesUnsolve
    Briefly describe Dictionary ADT giving details about
    2024-8-31 8:03
    |
    24
    |
    2
    |
    A2

    28 Words
    |
    Few seconds
    Main property of a Dictionary ADT Key operations of the Dictionary ADT Name a few applications where dictionaries are of use.     Leave your answer below as a comment
    A2Dictionary ADTUnsolve
    What is the time complexity of the push(), pop(), peek(), and __len__() operations in a linked stack? How do they compare to the time complexity of the same operations in an array-based stack?
    2024-8-31 7:54
    |
    17
    |
    0
    |
    A2

    7 Words
    |
    Few seconds
    Leave your answer below as a comment
    A2Linked ADTsUnsolve
    How can you use a stack to check if a string of parentheses is balanced? Can you provide an example of a balanced and an unbalanced string?
    2024-8-31 7:54
    |
    17
    |
    0
    |
    A2

    7 Words
    |
    Few seconds
    Leave your answer below as a comment
    A2Linked ADTsUnsolve
    What is the difference between a stack and a queue? Can you provide an example of a scenario where a stack would be more appropriate than a queue and vice versa?
    2024-8-31 7:54
    |
    17
    |
    0
    |
    A2

    7 Words
    |
    Few seconds
    Leave your answer below as a comment
    A2Linked ADTsUnsolve
    Summarise the main advantages and disadvantages of linked ADTs vs their array-based counterparts.
    2024-8-31 7:54
    |
    17
    |
    0
    |
    A2

    7 Words
    |
    Few seconds
    Leave your answer below as a comment
    A2Linked ADTsUnsolve
    Give a summary of what Abstract Data Types are, and explain what their main advantages and disadvantages are. Exemplify your explanation.
    2024-8-31 7:54
    |
    17
    |
    0
    |
    A2

    7 Words
    |
    Few seconds
    Leave your answer below as a comment
    A2Linked ADTsUnsolve
    What is the complexity of a given operation on a given Linked ADT? Examples: push/pop operation on a linked stack, append/serve operation on a linked queue, etc.
    2024-8-31 7:54
    |
    17
    |
    0
    |
    A2

    7 Words
    |
    Few seconds
    Leave your answer below as a comment
    A2Linked ADTsUnsolve
    Given a simple arithmetic expression provided to you by your instructor, show how a stack-based calculator computes its result. Show all the states of the stack until it computes the final result. The expression should be given in the postfix notation stored as a list.
    2024-8-31 7:53
    |
    19
    |
    0
    |
    A2

    13 Words
    |
    Few seconds
    Example expression: [1, 2, +, 3, 4, +, -]. Leave your answer below as a comment
    A2Linked ADTsUnsolve
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 2
    • 3
    • 4
    • 5
    • 6
    Theme Argon