Vardhaman College of Engineering: (Autonomous)

VARDHAMAN COLLEGE OF ENGINEERING
(Autonomous)
Shamshabad, Hyderabad - 501 218
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic year 2012-2013
COURSE ASSESSMENT FORM
Course code: ACS11T02
Course Name: Data Structures through C
Instructor: M.L.Prashanthi
Semester: II
Section: B
First time course taught by this instructor
Course taught previously
The purpose of this form is to document the achievement of program outcomes in the courses
that you instruct. Answers to the questions below should cite supporting evidence from your own
observations, student performance on assignments, midterm and examinations, student self
assessment forms, and other feedback.
Course prerequisite(s):
Mathematical background and Logical Thinking
C programming
Were the students adequately prepared by prerequisite courses?
Yes
No
Were changes implemented since the last time this course was taught? Yes
No
If yes what changes were made since the last time this course was taught?
Did these changes improve the course?
Changes made since last time
Assignments were given innovatively

Remedial Classes and bridge courses were
conducted for slow learners and better
understanding to all
Effect of change
Students were improved by solving

assignment questions
A significant increase in student
performance has been observed in final
exam
Are changes called for the next time this course is taught? Yes
No
If yes what changes should be made the next time this course is taught?
Changes recommended for next time
Applications of mathematics in engineering

and
Strong basics of all programming concepts
More Programs on graphs and trees should
be included
Purpose of changes
Make student understand the subject

better
Make students work better on data
structures
Most useful comments from students
Very informative course content. Provided an opportunity to face competitive examinations and
engineering practices
Achievement of objectives/Demonstration of outcomes
Did the students demonstrate achievement of the learning objectives/expected outcomes
specific to this course? In the table provided, cite evidence using student response on the
student self assessment questions and evidence from your direct assessment of student
work.
Mapping between Program Outcomes Course Outcomes Instruments of
Assessment
Program Outcomes
(a) An ability to apply
knowledge of computing,
mathematical
foundations, algorithmic
principles, and computer
science and engineering
theory in the modeling
and design of computer
based systems to realworld problems.
(b) An ability to design
and conduct experiments,
as well as to analyze and
interpret data.
(c) An ability to design,
implement, and evaluate
a computer-based
system, process,
component, or program to
meet desired needs,
within realistic constraints
such as economic,
environmental, social,
political, health and
safety, manufacturability,
and sustainability.
(e) An ability to analyze a
problem, and identify,
formulate and use the
appropriate computing
and engineering
requirements for
obtaining its solution.
(i) Recognition of the
need for, and an ability to
engage in continuing
professional development
Student
selfassessme
nt
Course outcomes
4.65
Compare iterative and

recursive solutions for
elementary problems.
I Mid Term 2, 3,
I Assignment
4,5
4.53
Understand the usage

of various data
structures
I Mid Term 4, 6
I Assignment 5,
6
4.41
Able to understand
how to choose the best
algorithm or data
structure for a
particular task.
4.37
Able to design and

apply appropriate data
structures for solving
computing problems.
I Mid Term 3, 5
I Assignment 3,4
Able to think critically

and solve problems
independently
I Mid Term 3, 4, 5
I Assignment 2,
4
4.38
Instruments of
direct
assessment by
instructor
I Mid Term 2,3, 6

I Assignment 4,
5
Outcom
e
average
3.76
3.64
3.08
3.76
2.92
and life-long learning.

(k) An ability to use
current techniques, skills,
and tools necessary for
computing and
engineering practice.
(m) An ability to
recognize the
importance of
professional
development by
pursuing postgraduate
studies or face
competitive
examinations that offer
challenging and
rewarding careers in
computing.
4.35
Analyze various
algorithms and its time
and space complexity
I Mid Term 3, 6
I Assignment 2,
5
4.37
Familiar with various

searching and sorting
techniques.
I Mid Term 4, 6
I Assignment 2,
5
3.83
3.8
FILL OUT ONE TABLE FOR EACH OUTCOME ASSESSED IN THE COURSE. CUT AND
PASTE OUTCOME DESCRIPTIONS INTO EACH TABLE FROM THE OUTCOMES LIST
BELOW.
Excellent
4.5 - 5
Very Good
3.5 - < 4.5
Scale Thresholds
Good
2.5 - < 3.5
7. Suggested process improvements
Average
1.5 - < 2.5
Assignment, Bridge
courses, Workshops,
seminars on latest topics
Outcome:
(b) ) An ability to design and conduct
experiments, as well as to analyze and interpret
data.
Evaluation
Poor
< 1.5
Comments
2. Average of Assignment marks
Black Board, Chalk,

PPTs, Video Lectures
4.6
Excellent
3. Average of midterm marks
4.0
Very Good
4. Percentage of students achieving outcome
80%
Very Good
5. Achievement of outcome
6. Suggested improvements on achieving
outcome
Achieved / Not Achieved

Conducting more
experiments on pointers
Assignment, Bridge
courses, Workshops,
Achieved
1. Instruments chosen
Outcome:
(e) An ability to analyze a problem, and identify,
formulate and use the appropriate computing
and engineering requirements for obtaining its
solution.
Evaluation
Comments
Black Board, Chalk,

4.6
Excellent
4.0
Very Good
80%
Very Good
outcome

Conducting more
experiments on pointers
Assignment, Bridge
courses, Workshops,
Achieved
Outcome:
(c) An ability to design, implement, and evaluate
Outcome:
Evaluation
a computer-based system, process, component,
(k)
An ability to
current
techniques,
or program
to use
meet
desired
needs,skills,
within
Evaluation
and
tools necessary
realistic
constraintsfor computing
such asandeconomic,
engineering
practice.
environmental,
social, political, health and
1.
Instruments
chosen and sustainability.
Black Board, Chalk,
safety,
manufacturability,
PPTs,
Video Lectures
Black Board,
Chalk,
5
2. Average of midterm
Assignment
marks
4.2
3.
marks
3.75
3.
of midterm
marks
4. Average
Percentage
of students
achieving outcome
4.
5. Percentage
Achievementofofstudents
outcomeachieving outcome
5.
of outcome on achieving
6. Achievement
Suggested improvements
outcome
outcome
Outcome:
(i) Recognition of the need for, and an ability to
engage
in continuing professional development
Outcome:
and
life-long
(m) An abilitylearning.
to recognize the importance of
professional
development
1. Instruments chosen by pursuing
postgraduate studies or face competitive
2. Average ofthat
Assignment
marks and
examinations
offer challenging
rewarding
careers
in
computing.
2. Achievement
Average of Assignment
5.
of outcomemarks
4.
Percentage of students achieving outcome
outcome
7.
improvements
6. Suggested
Suggested process
improvements
on achieving
outcome
Comments
Comments
Excellent
Very Good
4.0
80%
80%
Very Good
Very Good
Achieved
Achieved
Not Achieved
Seminars,/ Conducting
more
experiments
on
Seminars,
Conducting
trees
more experiments on
Assignment,
Bridge
sortings
courses,
Workshops,
Assignment,
Bridge
seminars
on latest topics
courses, Workshops,
Achieved
-
Evaluation
Evaluation
Black Board, Chalk,
5
4.25
Black Board, Chalk,
75% Video Lectures
PPTs,
4.6
Seminars, Conducting
4.0
more experiments on
80%
linked list
Achieved
/ Not
Achieved
Assignment,
Bridge
courses,
Workshops,
Conducting
more
seminars
on on
latest
topics
experiments
pointers
Assignment, Bridge
courses, Workshops,
Comments
Comments
Excellent
Very Good
Very Good
Excellent
Achieved
Very Good
Very Good
Achieved
--
STUDENT SAMPLES:
Program
Outcomes
Instrumen
t of Direct
a
I
II
Mid
Questions
Student
Samples
(5=excelle
nt to
1=poor)
b
II
2
1
5
3
Assi
gn
4 3
5 3
2
4
1
3
AV
G
II
Mid
c
II
3.0
3
4
6
1
Assi
gn
4 2
4 5
2.5
5
5
4
3
3.0
3.8
3
3
3
3
3.8
2.5
5
5
3
5
AV
G
AVG
AVG
Mid
Mid
1.0
3
2
1.0
2.5
4.0
2
2
2.5
4.0
3.5
5
3
4.0
5
1
5
5
II
II
Mid
Assig
n
3
2
5
3
2
3
2.0
2.0
2
3
2
3
4
3
2.0
3.8
3.0
4.5
5.0
4.3
1
1
5
5
4
5
3.8
3.5
4.8
3.3
3
4
3
5
5
5
4.5
AV
G
II
Mid
AV
G
II
Assig
n
II
Mid
2.7 3
6
2
3 4
3.0 2
2
5
5
5
3.7 1
4.3 3
2
2
1
5
4
3
2.7 3
3.3 2
1.5 5
5.0
2.5 2
4
2
4.0
2.0
5
4
5
4
3
2
3
4
3.0 3
3.0 5
5
4
5
5
3
3
3.0
2.0
2.5 5
3
5
3.5
4.8
4
2
4.0
2.0
4
3
4
3
4
2
2
3
3.0 4
2.5 2
4
3
5
5
5
5
4.3
5.0
2.5 5
3.5
4
1
3.8
1
5
3
5
4.0
2.3
5
1
3
3
5
5
4
2
m
I
AV
G
II
Assig
n
2
2
4
2
5
5
3.2
5
3.2
5
3
3
3.7
5
2
3.2
5
3
3
3
2
2
2
2
5
5
3.2
5
4.7
5
3.2
5
4
4.2
5
4.2
5
4.5
3.7
5
5
2.7
5
4.5
3.5
5
3
5
4
5
4
5
1
5
3
3
4
4
3
4
3
5
1
3.7
5
4
2.7
5
4.2
5
3.5
4.3
2.0
3.0 5
4.5 2
4.3
4.3
5.0
2.0 4
4 5
2
5
3
4
5
4
5
5
3.8
4.5
1
1
2
3
5
5
4
2
3.0
2.8
4
2
4.0
2.0
1
4
1
4
1
3
5
4
3.0 3
3.5 4
1
4
5
5
5
5
3.5 1
4.5 1
1
4
1
4
5
4
5
4
4
4
5
5
3
5
4.3
4.5
3
4
5
5
4
4
4
1
4.0
3.5
5
4
5.0
4.0
5
3
5
3
4
4
4.0 4
4.0 4
5
3
4
4
3
5
4 3
4 4
5
3
5
3
5
5
4.3
3.3
2.0
2.0 4
4.2
5
4.2
5
2
3.2
5
4.5
3.7
5
5
2.0
4.3
2.0
2.0 1
3
1
2
4
2
4
5
5
5
5
5
3
3
5
5
5
3
5
4
3
4
2
4
5
5
3.7
3.0
3.0
4.0
3.7
3.7
4.5
5.0
5.0
5.0
1
1
5
1
2
4
5
5
5
5
4
3
5
5
2
5
3.3
3.0
4.0
3.0
2.7
4.0
4.0
4.0
5.0
3.0
2.0
1.0
5.0
4.0
4.0
4.0
5.0
3
3
5
3.0
3.0
5.0
5
5
4
4
4
5
2
5
5
2
4
5
4
2
3
4
5
5
5
4
4
4
5
2
5
5
2
4
5
4
2
3
4
5
3
3
4
4
4
1
2
3
3
3.0
3.0
4.0
4.0
4.0
1.0
2.0
3.0
3.0
5
5
4
4
4
5
2
5
5
2
4
5
4
2
3
4
5
5
5
4
4
4
5
2
5
5
2
4
5
4
2
3
4
5
5
5
4
4
4
5
2
5
5
2
4
5
4
2
3
4
5
5
5
4
4
4
5
2
5
5
2
4
5
4
2
3
4
5
5
2
3
4
3
3
3
5
1
2
1
5
4
4
4
5
5
3
3
5
5
5
3.7
5
3.3
3
5
4
3.5
4.5
4.5
5
2
5
5
2
4
5
4
2
3
4
5
1
5
5
Outcome
average
3.76
1.0
5.0
5.0
3.64
4
2
2
4
4
5
4
4
2
5
4
4
3.08
4
2
2
4
4
5
4
4
2
5
4
4
3.76
4
2
2
4
4
5
4
4
2
5
4
4
2.92
4
2
2
4
4
5
4
4
2
5
4
4
3.83
4
2
2
4
4
5
4
4
2
5
4
4
4
2
2
4
4
5
4
4
2
5
4
4
4
2
2
4
4
5
4
4
2
5
4
4
3.8
DISTRIBUTION OF SCORING (TEXT)

Program
Outcomes
a
b
c
e
i
k
m
Distribution of Scoring
Poor
(1.0-1.5)
0
2
2
2
2
0
0
Fair
(1.5-2.5)
0
3
10
4
5
7
1
Good
(2.5-3.5)
7
13
3
4
8
14
9
Very good
(3.5-4.5)
17
15
4
9
15
7
12
Excellent
(4.5-5.0)
4
2
3
12
6
0
8
DISTRIBUTION OF SCORING (GRAPHIC)
END EXAM RESULT ANALYSIS:
Total
Students
Percentage
Enrolle
d
Appeare
d
Pass
ed
Fail
First Class
with
Distinction
First
Class
Second
Class
60
57
45
12
22
16
10
100%
100%
80%
20%
36.66%
26.66%
16.66%
DISTRIBUTION OF MARKS:
Marks
91 100
No. of
Students
Obtaine
d
81 - 90
71 - 80
61 - 70
51 - 60
41 - 50
< 40
Total
57
10
11
RESULT ANALYSIS:
CORRESPONDING TO SCALING
4.2
ASSESSMENT
GOOD
13
10
12
MID-I QUESTION PAPER
Question Paper Code : ACS11T02
(AUTONOMOUS)
Four Year B. Tech II Semester I Midterm Examinations April - 2013
(Regulations: VCE-R11)
DATA STRUCTURES THROUGH C

Time: 2 hours
Max Marks: 20
Answer All Questions from Part - A
Answer any three Questions from Part - B
All parts of the question must be answered in one place only
PART - A
1.
a).
b).
c).
d).
e).
(5 X 1 = 5 marks)
Explain the meaning of worst case analysis and best case analysis with an example.
Write a recursive algorithm that calculates and returns the length of a list
Discuss the importance of sorting in computer applications
Define recursion and State the rules for designing the recursive algorithms
Write down any four applications of queues
PART - B
(3 X 5 = 15 marks)
2.
3.
Explain the following:

(i) Complexity of an Algorithm.
(ii) The space-time trade off algorithm
a)
b)
The binary search is a good algorithm to implement using recursion. Rewrite the
binary
search function using recursion.
Write a program that creates an array of 100 random integers in the range 1 to 200
and
then, using the sequential search, searches the array 100 times using randomly
generated targets in the same range.
4.
Using the selection sorting into a subprogram SELECTION_SORT (A, N) which sorts
the
array A with N elements. Test the program using:
D, U, T, C, A, E, R, I, S, E, K, W, M,V
5.
Sort the following data using heap sort and show all the intermediate steps
88, 12, 91, 23, 10, 36, 45, 55, 15, 39, 81
6.
Using stack, write an algorithm to determine whether the infix expression has
balanced parenthesis or not
MAPPING OF MID - I QUESTIONS TO PROGRAMME OUTCOMES:

Question
Number
Program me Outcomes
a
1
2
3
MID-II QUESTION PAPER
(AUTONOMOUS)
Four Year B. Tech II Semester II Midterm Examinations June- 2013

Time: 2 hours
Max Marks: 20
Answer All Questions from Part - A
Answer any three Questions from Part - B
PART - A
1.
a).
b).
c).
d).
e).
(5 X 1 = 5 marks)
Define Priority Queue and write the Minimum number of queues needed to
implement priority queue.
How are linked lists stored in the memory?
Mention the significance of circular linked list
In Breadth First Search of Graph, which of the data structure is used? Why?
What are the maximum and minimum heights of a tree with 28 nodes
PART - B
(3 X 5 = 15 marks)
2.
3.
4.
It is required to split a queue into two queues so that all the elements in odd positions
are in one queue and those in even positions are in another queue. Write an
algorithm SPLITQ to accomplish this. Assume that the queue is maintained in an
array
a)
Write an algorithm to count number of nodes in the circular linked list.
b)
An important application of a linked is to represent polynomials and their

manipulations. Write an algorithm for polynomial addition.
Give the adjacency matrix and adjacency list of the following graphs
5.
Trace the algorithm to convert the infix expression into a postfix expression for the
following
expression (Show steps)
Q = [(A + B)/(C + D) - (E / F)]+ (G + H)/ I
6.
Construct the binary tree for the following sequence of nodes in preorder and
inorder respectively.
Preorder : G, B, Q, A, C, K, F, P, D, E, R, H
Inorder: Q, B, K, C, F, A, G, P, E, D, H, R
MAPPING OF MID - II QUESTIONS TO PROGRAMME OUTCOMES:

Question
Number
Program me Outcomes
a
1
2
ASSIGNMENT -I QUESTION PAPER

(AUTONOMOUS)
Code No: ACS11T02
ASSIGNMENT - I
B.TECH II Semester CSE - A & B

Date of Issue: 13 March, 2013
Max. Marks: 05
*********************************************************************************
UNIT - I
1.
State the various methods to estimate the efficiency of an algorithm.
2.
Write a program that creates an array of 100 random integers in the range 1 to
200 and
then, using the sequential search, searches the array 100 times using randomly
generated targets in the same range.
UNIT II
3
not.
Both the selection and bubble sorts exchange elements, the insertion sort does
Explain how the insertion sort rearranges the data without exchanges.
4
and a
Sort 3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5 using quick sort with median-of-three partitioning

cutoff of 3
UNIT III
5.
Design a method for keeping two stacks of integers within a single array
A[SPACESIZE] so
that neither stack overflows until all of the memory is used and an entire stack is
never
shifted to a different location within the array. The growth of these two stacks in
one
array will be in opposite direction. Declare structure and write C functions:
PUSH1, POP1, PUSH2 and POP2
MAPPING OF ASSIGNMENT - I QUESTIONS TO PROGRAMME OUTCOMES:

Question
Number
Programme Outcomes
a
1
2
3
ASSIGNMENT -II QUESTION PAPER

(AUTONOMOUS)
Code No: ACS11T02
ASSIGNMENT - 2
B.TECH II Semester CSE - A & B

Date of Issue: 26 May 2013
*********************************************************************************
Max. Marks: 05
UNIT I
1
.
Consider the following arithmetic expression in postfix notation:

752+*415-/i. Obtain the value of it.
ii. Find the equivalent prefix form of the above.
iii. Obtain the value of the expression from its prefix notation.
2
.
Write an algorithm to insert an item X just after the i th element in the Circular
Queue.
UNIT II
Let POLY1 and POLY2 be two polynomials sorted as header circular linked list in
memory.
Using the COEF, EXP, NEXT, write an algorithm and a C program that calculates
the sum
SUMPOLY of POLY1 and POLY2
4
.
Write a C program that will remove a specified node from a given doubly linked list
and
insert it at the end of the list.
UNIT III
5
.
Write a C function to compute the maximum number of nodes in any level of a

binary
tree. The maximum number of nodes in any level of binary tree is also called the
width of
the tree.
MAPPING OF ASSIGNMENT - II QUESTIONS TO PROGRAMME OUTCOMES:

Question
Number
Programme Outcomes
a
1
2
3
4
5
END EXAM QUESTION PAPER
Hall Ticket
No
(AUTONOMOUS)
Four Year B. Tech II Semester Regular Examinations July- 2013

(Common to Computer Science and Engineering & Information Technology,
Electronics and Communication Engineering, Electrical and Electronics
Engineering)
Time: 3 hours
Max Marks: 75
Answer ONE question from each Unit
All Questions Carry Equal Marks
1.
2.
3.
4.
5.
6.
Unit - 1
a) State the various methodologies for analyzing the algorithms
b) Code a recursive algorithm in C to compute the product of two positive
integers m and n using only addition
a) Code in C, for performing find all elements (k) in a tree and show that its
run time O(log n +s), where n is the number of elements in the tree and s
is the number of items returned in the search.
b) Write a function in C, that tests whether given two arrays of same size
contain same data. The function should return true if all the data is same,
false even if one element is different.
Unit 2
Write the procedure and sort the following sequence using
i. Selection Sort
ii. Radix Sort
Sequence: S Y E U Q T S A O D N I E B V C.
Explain in detail about Merge Sort and derive the best and worst case
complexities. Apply
the merge sort to the following sequence:
44 66 -88 77 55 -33 22 99 0 11 88 33 -99 -22 -77
7M
8M
8M
7M
15M
15M
Unit 3
a) Consider the following arithmetic expressions,
8M
i. A+B-C+D
ii. A%B*C/D
Construct a linked-list version of stack and convert the expressions into
postfix
b) Write a single function that initializes pushes and pops values from a fixed 7M
size stack
a) Consider the code:
int vals[5] = {10, 20, 30, 40, 50};
int *ptr;
ptr = vals;
Write a function to simulate operations of queue on the ptr.
7M
b) Consider the code:

char *pStr = (char*) malloc(512);
Write a function to make use of the above code and initialize the
compartments of a queue.
7.
Unit 4
Convert the following message into the nodes of the linked-list and sort
the elements.
8M
15M
Memory errors can be broadly classified into Heap Memory Errors and
Stack Memory Errors...
8.
9.
10
.
a) Perform arithmetic operation on two binary numbers of 8-bits percolating

the addition of carry from right to left bits. Use linked-list to store the bits of
the two binary numbers and calculate the sum
b) Write a program to construct the circular-doubly-linked-list of nnn nodes
with names of people and pick a name randomly asking the position of
any person, where the input integer is mandatorily of 3 digits, if the input
over boards get an appropriate integer in the cycle corresponding to the
position in the list
Unit - 5
a) What are the properties of binary tree? With an example, how do you
represent the binary tree using an array?.
b) Construct a binary tree for the post order and in order sequences of a
binary tree given.
Pre order : H, D, B, A, C, F, E, G, L, J, I, K, N, M, O
Post order : A, C, B, E, G, F, D, I, K, J, M, O, N, L, H
Write a C program to implement BFS traversal for given graph. Consider
the following cyclic digraph. Assume the adjacency list is in sorted order:
for example, when iterating through the edges pointing from 0, consider
the edge 01 before 06 or 07.
Compute the topological order by running the DFS-based algorithm and

listing the vertices in reverse post order.
MAPPING OF END EXAM QUESTION TO PROGRAMME OUTCOMES:
8M
7M
8M
7M
15M
Question
Number
Programme Outcomes
a
2
3
10
Recommendations for course improvement:

_________________________________________________________________________________
_________________________________________________________________________________
_________________________________________________________________________________
_________________________________________________________________________________
DATE:
SIGNATURE OF THE FACULTY
SIGNATURE OF THE HOD

Vardhaman College of Engineering: (Autonomous)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Vardhaman College of Engineering: (Autonomous)

Uploaded by

Copyright:

Available Formats

VARDHAMAN COLLEGE OF ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

First time course taught by this instructor

Course taught previously

Were the students adequately prepared by prerequisite courses?

Assignments were given innovatively

Students were improved by solving

Applications of mathematics in engineering

Make student understand the subject

Most useful comments from students

Compare iterative and

Understand the usage

Able to design and

Able to think critically

I Mid Term 2,3, 6

and life-long learning.

Familiar with various

7. Suggested process improvements

2. Average of Assignment marks

Black Board, Chalk,

3. Average of midterm marks

4. Percentage of students achieving outcome

Achieved / Not Achieved

7. Suggested process improvements

2. Average of Assignment marks

Black Board, Chalk,

3. Average of midterm marks

4. Percentage of students achieving outcome

Achieved / Not Achieved

7. Suggested process improvements

DISTRIBUTION OF SCORING (TEXT)

DISTRIBUTION OF SCORING (GRAPHIC)

END EXAM RESULT ANALYSIS:

MID-I QUESTION PAPER

Question Paper Code : ACS11T02