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:
Student’s Name: Muhammad Ali liaquat Reg. No. FA19- BSE- 077 /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);
};
ANSWER
public class node
{
public int data;
public node next;
}

public class linked_list

{
private node orderedList1;
private node orderedList2;
public linked_list()
{
orderedList1 = null;
orderedList2 = null;
}
 public final void add_node(int n)
{
node temp = new node();
temp.data = n;
temp.next = null;

if (orderedList1 == null)
{
orderedList1 = temp;
orderedList2 = temp;
}
else
{
orderedList2.next = temp;
orderedList12 = orderedList2.next;
}
}
}

public class GlobalMembers

{
public static void main(String[] args)
{
linked_list i = new linked_list();
i.add_node(1);
i.add_node(2);
}

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);
};
ANSWER

import java.util.Scanner;

class FlightInfo

{
 private int flightId;

private int fuel;

public FlightInfo()

public FlightInfo(int flightId, int fuel)

this.flightId = flightId;

this.fuel = fuel;

public void setFlightId(int flightId)

this.flightId = flightId;

public void setFuel(int fuel)

this.fuel = fuel;

public int getFlightID()

return flightId;

public int getFuel()

return fuel;

public class PriorityQueueTest

{
public static void main(String[] args)

Scanner input = new Scanner(System.in);

PriorityQueue que = new PriorityQueue();

boolean b =true;

while(b)

switch(input.nextInt())

case 1:

System.out.println(" Flight Info");

System.out.print("Enter Flight Id: ");

int id = input.nextInt();

System.out.print("Enter Flight Emergencey: ");

int fuel = input.nextInt();

que.setInfo(id, Emer);

break;

case 2:

System.out.println("Emergencey landing\n");

que.FindAndDeQueueFlightFacingFuelProblem();

break;

case 3:

System.out.println("Enginee failure emergencey\n");

que.viewQueue();

class priorityQueue

private FlightInfo[] flightQueue;

 private int tail;

private int front;

private FlightInfo[] deQueuedFlight;

private int topDeQ;

final int size;

public PriorityQueue()

size = 100;

flightQueue = new FlightInfo[size];

deQueuedFlight = new FlightInfo[size];

front = 0;

tail = 0;

topDeQ = 0;

public void setInfo(int id, int fuel)

flightQueue[tail] = new FlightInfo(id, fuel);

tail++;

public voidDeQueueFlighFacingEmergency(int FlightNumber)

for(int i = front; i<tail; i++)

if(flightQueue[i].getEmergencey=="Emergencey landing")

deQueuedFlight[topDeQ] = new FlightInfo();

deQueuedFlight[topDeQ].setFlightId(flightQueue[i].getFlightID());

++topDeQ;

for(int j = i; j<tail; j++)

{
 flightQueue[j] = flightQueue[j+1];

i--;

public void viewQueue()

System.out.printf("%s%n", "Flight ID", "Flight Fuel");

for(int i = front; i<tail; i++)

System.out.printf("%d%n", flightQueue[i].getFlightID(), flightQueue[i].getFuel());

public void viewDeQueue()

System.out.printf("%s%s%n", "Flight ID", "Flight Fuel");

for(int i = 0; i<topDeQ; i++)

System.out.printf("%-12d%-12d%n", deQueuedFlight[i].getFlightID(),
deQueuedFlight[i].getFuel());