0% found this document useful (0 votes)
18 views2 pages

COMSATS University Islamabad Lahore Campus: Sessional II - Examination

The document outlines an exam for a Data Structures and Algorithms course. It provides instructions and guidelines for the exam and lists two questions - the first asks to implement a method to construct an ordered linked list from two existing ordered linked lists, and the second asks to implement a method to dequeue a flight facing an emergency from a priority queue implemented as a circular array.

Uploaded by

Anonymous
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views2 pages

COMSATS University Islamabad Lahore Campus: Sessional II - Examination

The document outlines an exam for a Data Structures and Algorithms course. It provides instructions and guidelines for the exam and lists two questions - the first asks to implement a method to construct an ordered linked list from two existing ordered linked lists, and the second asks to implement a method to dequeue a flight facing an emergency from a priority queue implemented as a circular array.

Uploaded by

Anonymous
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

COMSATS University Islamabad

Lahore Campus
Sessional II - Examination

Credit
Course Title: Data Structure and Algorithm Course Code: CSC211 4(3,1
Hours:
)
Course Programme
Dr. Farrukh Zeshan BS Software Engineering
Instructor/s: Name:
Semester: 4th Section: Date: Dec. , 2020
Time
75 Mins Maximum Marks: 20
Allowed:
BSE-
Student’s Name: Reg. No.
/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