C++ Online Exam (2hrs)

in /by

C++ Online Exam (2hrs)

The exam will be available from Monday, April 16th through Sunday, April 22nd at 11:59 PM.

(San Fransisco time, CA, U.S)

Exam OVERVIEW:

  • 50 – 60 problems.
  • Mix of T/F, multiple choice, and short programming questions.
  • Roughly a dozen T/F questions, 2 or 3 programming questions, and the rest will be multiple choice.
  • Programming questions will ask you to write a stand-alone function that interacts with one of the data structures in some way.
  • Each exam is worth 10% of your overall grade.
  • Since the exam is online, and therefore open book, there won’t be any curving of the score.
  • Time Limit: 2 hours
  • You may begin the test at any time it’s available, but you are on the clock. It must be completed in one sitting.
  • The test is online, so it’s open everything. No way you can cheat.

SCORING:

  • Each T/F question will be worth 1 point, each multiple choice will be worth 2 points, and each programming question worth 15 points.
  • Partial credit will be awarded for the programming questions.

TOPICS:

  • Binary Search Trees
  • Priority Queues
    • Sorted Array-Based List Implementation
    • Unsorted Array-Based List Implementation
    • Sorted Pointer-Based List Implementation
  • Heaps
    • Used to Implement a Priority Queue
    • Heap Sort
  • 2-3, 2-4, and Red-Black Trees
    • No programming questions for these, just T/F or MC.
  • Big-O Analysis of the Data Structures

PROGRAMMING QUESTIONS

The programming questions will attempt to test your understanding of the data structure. So expect to have to come up with an algorithm and implement it to answer the question.

You’ll be asked to write a stand-alone function or method that implements your algorithm. You won’t write an entire class, just a function that interacts with the structure.

Now, don’t expect a question that just asks you to implement one of the algorithms we studied, but if you were asked such a question, then it might look like this:

Given the following definition for a Node:

struct Node
{
    int i;
    Node* next;
};

Write a stand-alone function that accepts the head pointer
for a linked list and frees all the memory used by the
list, leaving the head pointer set to null.

Answer:

void clear(Node*& h)
{
    while(h != nullptr)
    { 
        Node* p = h;
        h = h->next;
        delete p;
    }

}

"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.


Discount Code: CIPD30



Click ORDER NOW..

order custom paper