Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Nimra Aftab - S2 - A

    Uploaded by

    Anonymous
    This document contains instructions for a data structures and algorithms exam. It provides information about the course, instructor, date, time allowed, and maximum marks. It includes two questions - the first asks students to implement a method to construct an ordered linked list from two existing ordered linked lists. The second asks students to implement a method to dequeue a flight facing an emergency from a priority queue of flight information structures of a fixed size. Students are instructed to attempt all questions within the time limit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Nimra Aftab - S2 - A

    Uploaded by

    Anonymous
    20 views1 page
    This document contains instructions for a data structures and algorithms exam. It provides information about the course, instructor, date, time allowed, and maximum marks. It includes two questions - the first asks students to implement a method to construct an ordered linked list from two existing ordered linked lists. The second asks students to implement a method to dequeue a flight facing an emergency from a priority queue of flight information structures of a fixed size. Students are instructed to attempt all questions within the time limit.

    Original Title

    Nimra Aftab - S2- A(1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains instructions for a data structures and algorithms exam. It provides information about the course, instructor, date, time allowed, and maximum marks. It includes two questions - the first asks students to implement a method to construct an ordered linked list from two existing ordered linked lists. The second asks students to implement a method to dequeue a flight facing an emergency from a priority queue of flight information structures of a fixed size. Students are instructed to attempt all questions within the time limit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    20 views1 page

    Nimra Aftab - S2 - A

    Uploaded by

    Anonymous
    This document contains instructions for a data structures and algorithms exam. It provides information about the course, instructor, date, time allowed, and maximum marks. It includes two questions - the first asks students to implement a method to construct an ordered linked list from two existing ordered linked lists. The second asks students to implement a method to dequeue a flight facing an emergency from a priority queue of flight information structures of a fixed size. Students are instructed to attempt all questions within the time limit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 1

    COMSATS University Islamabad

    Lahore Campus
    Sessional II - Examination

    Course Title: Data Structure and Algorithm Course Code: CSC211 Credit Hours: 4(3,1)
    Course Instructor/s: Dr. Farrukh Zeshan Programme Name: BS Software Engineering
    Semester: 4th Section: Date: Dec. , 2020
    Time Allowed: 75 Mins Maximum Marks: 20
    Student’s Name: Reg. No. BSE- /LHR
    Important Instructions / Guidelines:
     Attempt all questions.

    Question-1: Implement the following class (10)

    struct node
    {
    int num;
    node * next;
    };

    class LinkList
    {
    private:
    node * start;
    public:
    constructAnOrderedList (node *orderedList1, node * orderedList2);
    };

    Question-2: Implement the following class (10)

    struct flightInfo
    {
    int flightId;
    int fuel;
    };

    const int size = 100;

    class PriorityQueue
    {
    private:
    flightInfo FlightQueue[size];
    int tail;
    int front;
    public:
    DeQueueFlighFacingEmergency(int FlightNumber);
    };

    You might also like