PAF KARACHI INSTITUE OF ECONOMICS AND TECHNOLGY

Electrical Engineering Department

College of Engineering

Algorithms and Data Structures

Final Lab Exam

Student ID: _____________________
Class ID: _______________________
Student name: ___________________

Lab Exam
PLO2 – Problem Analysis C4 – Analysis
PLO’s PLO5 – Modern tool usage Bloom’s C3 - Apply
PLO4 – Investigation Taxonomy P3 – Guided Response
PLO8 – Ethics P2 – Set
Excellent Average Poor Marks
CLO’s Aspects of Assessments
(75-100%) (50-75%) (<50%) Obtained

Recall: Recall the associated Complete understanding of

concepts form theory regarding
CLO1 various digital logics and
05%
signal
Conditioning Circuits.
Application Experiment with
CLO4 different data structures,
15% implement those structures
using algorithms
Experimental Validation Select a
suitable data structure for
CLO5 solving practical engineering
10% problems to validate the
working of different data
structures
Understand concepts of data Student lacks clear
the concepts of data
structures/ participates less understanding of concepts
structures /actively
in class / read Algorithms of data structures/ Unable
participate during
but unable to interpret to read and interpret
lecture/read & interpret
accurately. algorithms completely.
Algorithms correctly.
Student efficiently Student implement code Student implement code
implement code from from algorithms with minor from algorithms only with
algorithms. errors. help from the teacher.
Correctly select the Incorrect selection of
Correctly select the technique
technique and data structure technique and data
and data structure to perform
to perform particular task structure to perform
particular task and validate
but code has some minor particular task and code is
the working of code
errors also not correct

Total Marks: 30

Question: 1 Following is the structure of NODE for Singly Linked List.

1) Insert following data in given order 10, 20, 30, 40, and 50 by calling InsertAtBeginning function. (i.e. 10
is inserted first, then 20, then 30 and so on)
2) Then call BubbleSort function to arrange NODEs in ascending order w.r.t DATA.
3) Finally, print the list using Display function.
1
You need to implement above 3 function (InsertAtBeginning, BubbleSort, and Display) to complete the task.

Write working code below and attach snapshot of output as well.

2
Question: 2 Write C code only for Insertion in Circular Queue.