Page 1 of 149

Page 2 of 149
Page 3 of 149
 Rajeev Gandhi Memorial College of Engineering & Technology
( AUTONOMOUS )
Nandyal -518501
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Class & Semester: III B.TECH I SEM SEC-A
Student List

S.No Regd.No Name

1 16091A0551 SHAIK KHAJA MANSOOR ALI

2 16091A05E7 SHAIK SUBHANI BASHA
3 16091A05H0 AKULA VENKATA SIVA CHANDRA PAVAN KUMAR
4 17091A0502 BUDDA ABRAHAM
5 17091A0503 RAAVI AKHILA
6 17091A0506 PATAN AMEER KHAN
7 17091A0507 PUTLOORU ANAND
8 17091A0508 BOGGULA ANIL KUMAR
9 17091A0509 INDUKURI ANUDEEP KUMAR REDDY
10 17091A0510 KANDUKURI ANUSHA
11 17091A0511 VALMIKI ANUSHA
12 17091A0512 MALIKIREDDY APARNA
13 17091A0513 PINJARI ASHA
14 17091A0514 BOYA ASHOK KUMAR
15 17091A0515 SHAIK ASMAPARVEEN
16 17091A0516 MUTHARASI BHARATHRAJ
17 17091A0517 THAMATAM BHARGAVREDDY
18 17091A0518 ALLE BHAVITHA
19 17091A0519 GAJULA BHEEMESH
20 17091A0520 PALLETI CHALUKYA REDDY
21 17091A0521 CHAMALA CHANDANA
22 17091A0522 PALLE CHARITHA
23 17091A0523 CHINNA SAI KRISHNA DUDEKULA
24 17091A0524 KAKARLA DHIVYABHARATHI
25 17091A0525 DHARMAVARAM DIWAKAR REDDY
26 17091A0526 MULLA FAROOQ BASHA
27 17091A0527 GUNDAMPATI BALA NAGASREE GAYATHRI
28 17091A0528 MALEPATI GAYATRI
29 17091A0529 KOPPULA GEETHA
30 17091A0530 RAYAPU GOUTHAM REDDY
31 17091A0531 MEKALA GOVARDHAN
32 17091A0532 YARAMALA GOWTHAMI
33 17091A0533 JANGITI HAREESH YADAV
34 17091A0535 CHEKKA HARI PRIYA
35 17091A0536 GANDAREDDY HARINATH REDDY
36 17091A0537 KOLAKANI HARIPRIYA
37 17091A0538 C HARISH
38 17091A0539 AOUTHU HARSHAVARDHAN REDDY
39 17091A0540 YERRABOLU HIMA SAILA REDDY
40 17091A0541 KAMMARA HIMA VARSHA
Page 4 of 149
41 17091A0542 CHIMMANAGANDLA JAGADEESH BABU
42 17091A0543 VELURU JAYAKRISHNA
43 17091A0544 T MD MUSTAFA JUNAID MEHAMOOD
44 17091A0545 BANNURU KALYANI
45 17091A0546 KAMBAGOUNI KEERTHANA
46 17091A0547 MUDDANGULA KEERTHI REDDY
47 17091A0548 SYED KHADAR BASHA
48 17091A0549 CHOKKAM KINNERA
49 17091A0550 SANGARAJU KIRAN KUMAR RAJU
50 17091A0551 JARADODDI KRANTHI KUMAR
51 17091A0552 ALUVALA VENKATA KRISHNA KIREETI
52 17091A0553 BANNURU LAKSHMI PRASANNA
53 17091A0554 MUKTHAPURAM LAKSHMI SWETHA
54 17091A0555 YEDDULA LAKSHMISAI
55 17091A0556 BEDUDURI LOKESHWARA REDDY
56 17091A0557 NAKKA MADHURA SANDHYA
57 17091A0558 BHOJANAPU MAHESH BABU
58 17091A0559 DASARI MAHESH

Page 5 of 149
 Rajeev Gandhi Memorial College of Engineering & Technology
( AUTONOMOUS )
Nandyal -518501
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Class & Semester: III B.TECH I SEM SEC-B
Student List

S.No Regd.No Name

1 15091A0501 KAMANOORU ABHINAY

2 16091A0526 UPPARA DIXIT SAGAR
3 17091A0561 BAIREDDY MAHESWARA REDDY
4 17091A0562 POREDDY MAHESWARA REDDY
5 17091A0563 DINNE MAHITHA REDDY
6 17091A0564 RAAVI MAMATHA
7 17091A0565 GUDDUGURIKE MANASA
8 17091A0566 REDDY MANASA
9 17091A0567 MANCHALA MANOHARBABU
10 17091A0568 ALLA MEGHALA
11 17091A0569 THAPPETA MITHUN MOHAN
12 17091A0570 VAGALLA MOHAN REDDY
13 17091A0571 ANNAPU REDDY MOHANA
14 17091A0572 CHINTHA MOKSHARUPINI
15 17091A0573 MURA MOUNIKA REDDY
16 17091A0574 GOLLA MOUNIKA
17 17091A0575 GADAMSETTY NAGA KARTHIKEYA
18 17091A0576 LALAM NAGA SAMPADA
19 17091A0577 MEDA NAGASIVAGANESH
20 17091A0578 THOTLA NARENDRA
21 17091A0579 ARAVA NATASHA
22 17091A0580 PONNAPATI NAVEEN
23 17091A0581 MULLA NAZEER
24 17091A0582 MAYALURI NEELIMA
25 17091A0583 KONA NIHARIKA
26 17091A0585 M NIKHIL
27 17091A0586 MODALA NIKHILA DEVI
28 17091A0587 JUPALLE VENKATA PAVAN KUMAR REDDY
29 17091A0589 KAYAPATI PAVAN KUMAR
30 17091A0590 BANDARU POOJITHA
31 17091A0591 INDLA PRAKASH DINAKAR RAO
32 17091A0592 CHILAKALA PRANEETH REDDY
33 17091A0593 ELUGOTI PRASANTH KUMAR REDDY
34 17091A0594 CHEREDDY PRASANTHA REDDY
35 17091A0595 ILLURI PRATHYUSHA
36 17091A0596 MEESARAGANDHA PRAVALLIKA
37 17091A0597 BOYA PRAVEEN
38 17091A0598 BETAMSETTY PREETHI
39 17091A0599 KUDUMULA PREETHI
40 17091A05A0 KAMATHAM PREM KUMAR
Page 6 of 149
41 17091A05A1 YEDDULA PREMCHANDU
42 17091A05A2 KANUMA PULLA REDDY
43 17091A05A3 VATTIKUNTA RADHA
44 17091A05A5 RAGIPINDI RAJA SEKHAR REDDY
45 17091A05A6 GOVINDINNE RAMESH REDDY
46 17091A05A7 VEERANNAGARI RAMESHWARA REDDY
47 17091A05A8 NARAYANA RAMYA SREE
48 17091A05A9 BHASKARA VENKATANAGA SAILALITHA RAMYASREE
49 17091A05B0 KUKKALA RANI
50 17091A05B1 BATTU RAVI TEJA
51 17091A05B3 NALLAGATLA ROHITH KUMAR
52 17091A05B4 P ROSHNARA
53 17091A05B5 SWARNA SACHIN KUMAR
54 17091A05B6 POSAM SAI CHARAN REDDY
55 17091A05B7 KAMALAPURI SAI DEEPTHI
56 17091A05B8 KOTHA SAI KIRAN
57 17091A05B9 GUTTA SAI PRAKASH
58 18095A0501 VEMURI AKHILA

Page 7 of 149
 Rajeev Gandhi Memorial College of Engineering & Technology
( AUTONOMOUS )
Nandyal -518501
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Class & Semester: III B.TECH I SEM SEC-C
Student List

S.No Regd.No Name

1 16091A0527 GOLLA GANGADHAR

2 16091A0563 MAHAMMAD RAFI
3 16091A05E1 BATTULA SREENIVASULU
4 17091A05C0 JENNE SAI PRASANTH
5 17091A05C1 NARAYANA SAI PUSHPANJALI
6 17091A05C2 POLEPALLI SAI SRAVANI
7 17091A05C3 CHEEDELLA SAI THANISHNA
8 17091A05C4 BINGUMALLA SAI VENKATESH
9 17091A05C5 BYSANI SAI VINAY KRISHNA
10 17091A05C6 BACHU SAI VYSHNAVI
11 17091A05C7 THODINGULA SAI
12 17091A05C8 UTTARADI SAICHAITANYA
13 17091A05C9 DASARI SAICHARAN
14 17091A05D0 JETTY SATISH RAJENDRA
15 17091A05D1 SHAIK SHAHEEN
16 17091A05D3 MUNTIMADUGU SHAMEEM
17 17091A05D4 B SHARAT KUMAR REDDY
18 17091A05D5 GUNDAM SHASHIDHAR REDDY
19 17091A05D6 CHINTHA SIREESHA
20 17091A05D7 UMMAREDDY SIVA KUMAR REDDY
21 17091A05D8 GUMMANURU SOWMYA
22 17091A05D9 JALAPATI VIDYA SREE PRANATHI
23 17091A05E0 AGOLU SREE SANDEEP
24 17091A05E1 RODDAM SREEDHAR REDDY
25 17091A05E2 MUDIAM SREEDHARANI
26 17091A05E3 MALIPEDDI SRI HARSHA
27 17091A05E4 MALAGIRI SRINIVASULU
28 17091A05E5 SUDHEER NALLI
29 17091A05E6 GULLAKUNTLA SUJATHA
30 17091A05E8 VADLA SUMANTH ACHARY
31 17091A05E9 GOLLA SUPRAJA
32 17091A05F0 SHARAF SUPRIYA
33 17091A05F1 B SURESH BABU
34 17091A05F2 KUMMARI SURESH KUMAR
35 17091A05F3 NAGELI SUSMASREE
36 17091A05F4 BASIREDDY SWAPNA
37 17091A05F5 BANDA SWARNA
38 17091A05F6 BHOOMIREDDY SWATHI
39 17091A05F7 MANJULA SWATHI
40 17091A05F8 MITAIGIRI TAHSEENA BANU
Page 8 of 149
41 17091A05G0 SEGU TEJASWINI
42 17091A05G1 THARIGOPULA TEJASWINI
43 17091A05G2 AMBATI THARUNIKA
44 17091A05G3 AVIRENI UDAY KIRAN
45 17091A05G5 RAMAYANAM VENKATA LAVANYA
46 17091A05G7 ORVAKANTI VENKATESH
47 17091A05G8 M VIJAYA KUMAR
48 17091A05G9 ARAVA VIJAYA KUMARI
49 17091A05H0 DADIREDDY VIJAYA LAKSHMI
50 17091A05H1 KASIBHATLA VIJAYASWATHI
51 17091A05H2 BUTTA VINITH KUMAR
52 17091A05H3 SUNCHU VINOD KUMAR
53 17091A05H4 SIDDUMOORTHY VISHNU VARDHAN REDDY
54 17091A05H5 TELAKAPALLI VISHNU VARDHAN
55 17091A05H6 KALLURI VISWA VANI
56 17091A05H7 PATCHARI VISWATEJA
57 17091A05H8 CHINNA SETTY YESHWANTH KUMAR
58 17091A05H9 KUMMARI YOGEESWAR

Page 9 of 149
Page 10 of 149
Page 11 of 149
Page 12 of 149
Page 13 of 149
Page 14 of 149
Page 15 of 149
Page 16 of 149
Page 17 of 149
Page 18 of 149
Page 19 of 149
Page 20 of 149
Page 21 of 149
Page 22 of 149
Page 23 of 149
Page 24 of 149
Page 25 of 149
Page 26 of 149
College Code: 09
R-15
Rajeev Gandhi Memorial College of Engineering & Technology
Autonomous
NANDYAL-518501
III B. Tech. I-Semester Mid-I Examinations
PRINCIPLES OF PROGRAMMING LANGUAGES (Scheme of evaluation)
(CSE)
Max. Marks: 25 Date: 24/08/2019 Time: 2 Hours

Note: 1.Answer first question compulsorily.( 2 x 5 = 10Marks )

2. Answer Any three from 2 to 5 questions (5 x 3 = 15Marks)

Q.1 a ) How can you evaluate the cost of a programming language? 2M

Ans) The total cost of a programming language is a function of many of its characteristics. First,
there is the cost of training programmers to use the language. Second, there is the cost of writing
programs in the language. Third, there is the cost of compiling programs in the language. Fourth,
the cost of executing programs written in a language is greatly influenced by that language’s
design. The fifth factor in the cost of a language is the cost of the language implementation
system. Sixth, there is the cost of poor reliability. The final consideration is the cost of
maintaining programs, which includes both corrections and modifications to add new
functionality.

Q.1 b) Define dynamic type binding.-2M

Ans) With dynamic type binding, the type of a variable is not specified by a declaration statement,
nor can it be determined by the spelling of its name. Instead, the variable is bound to a type when
it is assigned a value in an assignment statement.

Q.1 c) Why programming languages need for record types?-2M

Ans) A record is an aggregate of data elements in which the individual elements are identified by
names and accessed through offsets from the beginning of the structure. There is frequently a
need in programs to model a collection of data in which the individual elements are not of the
same type or size. For example, information about a college student might include name, student
number, grade point average, and so forth. A data type for such a collection might use a character
string for the name, an integer for the student number, a floating point for the grade point average,
and so forth. Records are designed for this kind of need.

Q.1 d) What is short circuit evaluation of expressions?-2M

Ans) A short-circuit evaluation of an expression is one in which the result is determined without
evaluating all of the operands and/or operators.

Q.1 e) What is the importance of parentheses in arithmetic expressions?-2M

Ans) Programmers can alter the precedence and associativity rules by placing parentheses in
expressions. A parenthesized part of an expression has precedence over its adjacent

Page 27 of 149
 unparenthesized parts. For example, although multiplication has precedence over addition, in the
expression

(A + B) * C

The addition will be evaluated first.

Q.2 a) Explain the formal method to describe the syntax of programming language? 3M

Ans) Backus-Naur Form:BNF is a natural notation for describing syntax. BNF uses abstractions for
syntactic structures.

<assign> → <var> = <expression>

The text on the left side of the arrow, which is aptly called the left-hand side (LHS), is the
abstraction being defined. The text to the right of the arrow is the definition of the LHS. It is
called the right-hand side (RHS) and consists of some mixture of tokens, lexemes, and
references to other abstractions. (Actually, tokens are also abstractions.) Altogether, the definition
is called a rule, or production. In the example rule just given, the abstractions <var> and
<expression> obviously must be defined for the <assign> definition to be useful.

The abstractions in a BNF description, or grammar, are often called nonterminal symbols, or
simply nonterminals, and the lexemes and tokens of the rules are called terminal symbols, or
simply terminals. A BNF description, or grammar, is a collection of rules.

Nonterminal symbols can have two or more distinct definitions, representing two or more
possible syntactic forms in the language. Multiple definitions can be written as a single rule, with
the different definitions separated by the symbol|, meaning logical OR.

The sentences of the language are generated through a sequence of applications of the rules,
beginning with a special nonterminal of the grammar called the start symbol. This sequence of
rule applications is called a derivation.

A Grammar for a Small Language

<program> → begin <stmt_list> end
<stmt_list> → <stmt> | <stmt> ; <stmt_list>
<stmt> → <var> = <expression>
<var> → A | B | C
<expression> → <var> + <var> | <var> – <var> | <var>

A derivation of a program in this language follows:

<program> => begin <stmt_list> end
=> begin <stmt> ; <stmt_list> end
=> begin <var> = <expression> ; <stmt_list> end
=> begin A = <expression> ; <stmt_list> end
=> begin A = <var> + <var> ; <stmt_list> end
=> begin A = B + <var> ; <stmt_list> end
=> begin A = B + C ; <stmt_list> end
=> begin A = B + C ; <stmt> end
=> begin A = B + C ; <var> = <expression> end
=> begin A = B + C ; B = <expression> end
=> begin A = B + C ; B = <var> end
=> begin A = B + C ; B = C end

Page 28 of 149
 Each of the strings in the derivation, including <program>, is called a sentential form.

In this derivation, the replaced nonterminal is always the leftmost nonterminal in the previous
sentential form. Derivations that use this order of replacement are called leftmost derivations.

Q.2 b) Write about language categories.- 2M

Ans) Programming languages are often categorized into four bins: imperative, functional, logic, and
object oriented. However, we do not consider languages that support object-oriented
programming to form a separate category of languages. We have described how the most popular
languages that support object-oriented programming grew out of imperative languages. Although
the object-oriented software development paradigm differs significantly from the procedure-
oriented paradigm usually used with imperative languages, the extensions to an imperative
language required to support object-oriented programming are not intensive. For example, the
expressions, assignment statements, and control statements of C and Java are nearly identical. (On
the other hand, the arrays, subprograms, and semantics of Java are very different from those of
C.) Similar statements can be made for functional languages that support object-oriented
programming.

Another kind of language, the visual language, is a subcategory of the imperative languages.
The most popular visual languages are the .NET languages. These languages (or their
implementations) include capabilities for drag-and-drop generation of code segments. Such
languages were once called fourth-generation languages, although that name has fallen out of use.
The visual languages provide a simple way to generate graphical user interfaces to programs. For
example, using Visual Studio to develop software in the .NET languages, the code to produce a
display of a form control, such as a button or text box, can be created with a single keystroke.
These capabilities are now available in all of the .NET languages.

Q.3 a) What are the different character coding systems used in programming languages?-1M

Ans) The most commonly used coding was the 8-bit code ASCII (American Standard Code for
Information Interchange), which uses the values 0 to 127 to code 128 different characters. ISO
8859-1 is another 8-bit character code, but it allows 256 different characters. Ada 95+ uses ISO
8859-1.

In 1991, the Unicode Consortium published the UCS-2 standard, a 16-bit character set. This
character code is often called Unicode.

Q.3 b) Discuss about various numeric data types used in programming languages?-4M

Ans) Numeric Types

Many early programming languages had only numeric primitive types. Numeric types still play a
central role among the collections of types supported by contemporary languages.

Integer : The most common primitive numeric data type is integer. Many computers now
support several sizes of integers. These sizes of integers, and often a few others, are supported by
some programming languages. For example, Java includes four signed integer sizes: byte, short,
int, and long.

Floating-Point : Floating-point data types model real numbers, but the representations are only
approximations for many real values. Floating-point values are represented as fractions and
exponents, a form that is borrowed from scientific notation. Older computers used a variety of

Page 29 of 149
 different representations for floating-point values. However, most newer machines use the IEEE
Floating-Point Standard 754 format. Language implementers use whatever representation is
supported by the hardware. Most languages include two floating-point types, often called float
and double. The float type is the standard size, usually being stored in four bytes of memory. The
double type is provided for situations where larger fractional parts and/or a larger range of
exponents is needed. Double-precision variables usually occupy twice as much storage as float
variables and provide at least twice the number of bits of fraction.

Complex: Some programming languages support a complex data type—for example, Fortran
and Python. Complex values are represented as ordered pairs of floating-point values.

Decimal: Most larger computers that are designed to support business systems applications
have hardware support for decimal data types. Decimal data types store a fixed number of
decimal digits, with the decimal point at a fixed position in the value. These are the primary data
types for business data processing and are therefore essential to COBOL. C# and F# also have
decimal data types.

Decimal types have the advantage of being able to precisely store decimal values, at least those
within a restricted range, which cannot be done with floating-point. Decimal types are stored very
much like character strings, using binary codes for the decimal digits. These representations are
called binary coded decimal (BCD).

Q.4 a) What are the design issues of Array types?-2M

Ans) The primary design issues specific to arrays are the following:
• What types are legal for subscripts?
• Are subscripting expressions in element references range checked?
• When are subscript ranges bound?
• When does array allocation take place?
• Are ragged or rectangular multidimensional arrays allowed, or both?
• Can arrays be initialized when they have their storage allocated?
• What kinds of slices are allowed, if any?

Q.4 b) Discuss about various assignment statements?-3M

Ans) The assignment statement is one of the central constructs in imperative languages.

Simple Assignments: Nearly all programming languages currently being used use the equal sign
for the assignment operator. All of these must use something different from an equal sign for the
equality relational operator to avoid confusion with their assignment operator. ALGOL 60
pioneered the use of := as the assignment operator, which avoids the confusion of assignment
with equality. Ada also uses this assignment operator.

Conditional Targets

Perl allows conditional targets on assignment statements. For example, consider

($flag ? $count1 : $count2) = 0;

Compound Assignment Operators

Page 30 of 149
 A compound assignment operator is a shorthand method of specifying a commonly needed
form of assignment. The form of assignment that can be abbreviated with this technique has the
destination variable also appearing as the first operand in the expression on the right side, as in

a=a+b

Compound assignment operators were introduced by ALGOL 68, were later adopted in a
slightly different form by C, and are part of the other C-based languages, as well as Perl,
JavaScript, Python, and Ruby. The syntax of these assignment operators is the catenation of the
desired binary operator to the = operator. For example,
sum += value;
is equivalent to
sum = sum + value;

Unary Assignment Operators

The C-based languages, Perl, and JavaScript include two special unary arithmetic operators
that are actually abbreviated assignments. They combine increment and decrement operations
with assignment. The operators ++ for increment, and –– for decrement, can be used either in
expressions or to form stand-alone single-operator assignment statements. They can appear either
as prefix operators, meaning that they precede the operands, or as postfix operators, meaning that
they follow the operands. In the assignment Statement

sum = ++ count;

the value of count is incremented by 1 and then assigned to sum.

Assignment as an Expression

In the C-based languages, Perl, and JavaScript, the assignment statement producesa result,
which is the same as the value assigned to the target. It can therefore be used as an expression and
as an operand in other expressions. This design treats the assignment operator much like any other
binary operator,except that it has the side effect of changing its left operand. For example, in C, it
is common to write statements such as

while ((ch = getchar()) != EOF) { ... }

Multiple Assignments

Several recent programming languages, including Perl, Ruby, and Lua, provide multiple-target,
multiple-source assignment statements. For example, in Perl one can write

($first, $second, $third) = (20, 40, 60);

Q.5 a) Discuss various selection statements in programming languages.-4M

Ans) A selection statement provides the means of choosing between two or more execution paths in
a program. Such statements are fundamental and essential parts of all programming languages.
Selection statements fall into two general categories: two-way and n-way, or multiple selection.

Two-Way Selection Statements

Although the two-way selection statements of contemporary imperative languages are quite
similar, there are some variations in their designs. The general form of a two-way selector is as
follows:
Page 31 of 149
 if control_expression
then clause
else clause

The design issues for two-way selectors can be summarized as follows:

• What is the form and type of the expression that controls the selection?
• How are the then and else clauses specified?
• How should the meaning of nested selectors be specified?

In C89, which did not have a Boolean data type, arithmetic expressions were used as control
expressions. This can also be done in Python, C99, and C++. However, in those languages either
arithmetic or Boolean expressions can be used. In other contemporary languages, only Boolean
expressions can be used for control expressions. In many contemporary languages, the then and
else clauses appear as either single statements or compound statements. One variation of this is
Perl, in which all then and else clauses must be compound statements, even if they contain single
statements. Python uses indentation to specify compound statements.

Multiple-Selection Statements

The multiple-selection statement allows the selection of one of any number of statements or
statement groups. It is, therefore, a generalization of a selector. In fact, two-way selectors can be
built with a multiple selector. The need to choose from among more than two control paths in a
program is common. Although a multiple selector can be built from two-way selectors and gotos,
the resulting structures are cumbersome, unreliable, and difficult to write and read. Therefore, the
need for a special structure is clear.

The following is a summary of the design issues:

• What is the form and type of the expression that controls the selection?
• How are the selectable segments specified?
• Is execution flow through the structure restricted to include just a single
selectable segment?
• How are the case values specified?
• How should unrepresented selector expression values be handled, if at all?

The C multiple-selector statement, switch, which is also part of C++, Java, and JavaScript, is a
relatively primitive design. Its general form is
switch (expression) {
case constant_expression1:statement1;
...
case constantn: statement_n;
[default: statementn+1]
}

where the control expression and the constant expressions are some discrete type. This includes
integer types, as well as characters and enumeration types. The selectable statements can be
statement sequences, compound statements, or blocks. The optional default segment is for
unrepresented values of the control expression. If the value of the control expression is not
represented and no default segment is present, then the statement does nothing.
Page 32 of 149
 The break statement, which is actually a restricted goto, is normally used for exiting switch
statements. The other way C#’s switch differs from that of its predecessors is that the control
expression and the case statements can be strings in C#. PHP’s switch uses the syntax of C’s
switch but allows more type flexibility.

The case values can be any of the PHP scalar types—string, integer, or double precision. As
with C, if there is no break at the end of the selected segment, execution continues into the next
segment.

Ruby has two forms of multiple-selection constructs, both of which are called case expressions
and both of which yield the value of the last expression evaluated. The only version of Ruby’s
case expressions that is described here is semantically similar to a list of nested if statements:
case
when Boolean_expression then expression
...
when Boolean_expression then expression
[else expression]
end

Q.5 b)Write briefly about unconditional branching?-1M

Ans) An unconditional branch statement transfers execution control to a specified location in the
program. The most heated debate in language design in the late 1960s was over the issue of
whether unconditional branching should be part of any high-level language, and if so, whether its
use should be restricted. The unconditional branch, or goto, is the most powerful statement for
controlling the flow of execution of a program’s statements. However, using the goto carelessly
can lead to serious problems. The goto has stunning power and great flexibility (all other control
structures can be built with goto and a selector), but it is this power that makes its use dangerous.

******

Page 33 of 149
Page 34 of 149
College Code: 09
R-15
Rajeev Gandhi Memorial College of Engineering & Technology
Autonomous
NANDYAL-518501
III B. Tech. I-Semester Mid-II Examinations
PRINCIPLES OF PROGRAMMING LANGUAGES (Scheme of evaluation)
(CSE)
Max. Marks: 25 Date: 01/11/2019 Time: 2 Hours

Note: 1.Answer first question compulsorily.( 2 x 5 = 10Marks )

2. Answer Any three from 2 to 5 questions (5 x 3 = 15Marks)

Q.1 a ) What are the characteristics of subprogram? 2M

Ans) All subprograms have the following characteristics:

• Each subprogram has a single entry point.

• The calling program unit is suspended during the execution of the called subprogram,
which implies that there is only one subprogram in execution at any given time.
• Control always returns to the caller when the subprogram execution.

Q.1 b) What is meant by referential transparency?-2M

Ans) The execution of a function always produces the same result when given the same parameters.
This feature is called referential transparency. It makes the semantics of purely functional
languages far simpler than the semantics of the imperative languages.

Q.1 c) How are instances of Java classes created? Give an example.-2M

Ans) All Java objects are explicit heap dynamic. Most are allocated with the new operator, but there
is no explicit deallocation operator.

Example:
class Simple{
private int x;
public void meth(){
//method body
}
}
class SimpleDemo{
public static void main(String[] args){
Simple obj=new Simple();
obj.meth();
}
}

Q.1 d) What do you mean by instantiation and uninstantiation?-2M

Ans) In particular, the presence of variables in propositions requires resolution to find values for
those variables that allow the matching process to succeed. This process of determining useful
values for variables is called unification. The temporary assigning of values to variables to allow
unification is called instantiation.

Page 35 of 149
 Instantiation occurs only in the resolution process. A variable that has not been assigned a
value is called uninstantiated

Q.1 e) What are formal parameters and actual parameters?-2M

Ans) The parameters in the subprogram header are called formal parameters. They are sometimes
thought of as dummy variables because they are not variables in the usual sense: In most cases,
they are bound to storage only when the subprogram is called, and that binding is often through
some other program variables.

Subprogram call statements must include the name of the subprogram and a list of parameters
to be bound to the formal parameters of the subprogram. These parameters are called actual
parameters.

Q.2 a) “Parametric polymorphism is achieved by generic subprograms” --Justify. --2M

Ans) Parametric polymorphism is provided by a subprogram that takes generic parameters that are
used in type expressions that describe the types of the parameters of the subprogram. Different
instantiations of such subprograms can be given different generic parameters, producing
subprograms that take different types of parameters. Parametric definitions of subprograms all
behave the same. Parametrically polymorphic subprograms are often called generic subprograms.

Generic functions in C++ have the descriptive name of template functions. The definition of a
template function has the general form

template <template parameters> —a function definition that may include the template
parameters A template parameter (there must be at least one) has one of the forms

class identifier

typename identifier

The class form is used for type names. The typename form is used for passing a value to the
template function. For example, it is sometimes convenient to pass an integer value for the size of
an array in the template function.

As an example of a template function, consider the following:

template <class Type>
Type max(Type first, Type second) {
return first > second ? first : second;
}

Q.2 b) What is overloaded subprogram? Give some example.- 3M

Ans) An overloaded subprogram is a subprogram that has the same name as another subprogram
in the same referencing environment. Every version of an overloaded subprogram must have a
unique protocol; that is, it must be different from the others in the number, order, or types of its
parameters, and possibly in its return type if it is a function. The meaning of a call to an
overloaded subprogram is determined by the actual parameter list.

Users are also allowed to write multiple versions of subprograms with the same name in Ada,
Java, C++, C#, and F#. Once again, in C++, Java, and C# the most common user-defined
overloaded methods are constructors. Here is a simple example that illustrates method
overloading:

//Demonstrate method overloading.

class OverloadDemo {
Page 36 of 149
 void test() {
System.out.println("No parameters");
}
// Overload test for one integer parameter.
void test(int a) {
System.out.println("a: " + a);
}
// Overload test for two integer parameters.
void test(int a, int b) {
System.out.println("a and b: " + a + " " + b);
}
// overload test for a double parameter
double test(double a) {
System.out.println("double a: " + a);
return a*a;
}
}
class Overload {
public static void main(String args[]) {
OverloadDemo ob = new OverloadDemo();
double result;
// call all versions of test()
ob.test();
ob.test(10);
ob.test(10, 20);
result = ob.test(123.25);
System.out.println("Result of ob.test(123.25): " + result);
}
}

Q.3 a) What is the usage of finally clause in Java?-2M

Ans) There are some situations in which a process must be executed regardless of whether a try
clause throws an exception and regardless of whether a thrown exception is caught in a method.
One example of such a situation is a file that must be closed. Another is if the method has some
external resource that must be freed in the method regardless of how the execution of the method
terminates. The finally clause was designed for these kinds of needs. A finally clause is placed at
the end of the list of handlers just after a complete try construct. In general, the try construct and
it’s finally clause appear as
try {
...
}
catch (. . .) {
...
}
. . . //** More handlers
finally {
...
}

Q.3 b) How exceptions are handled in Java? Explain with an example -3M

Ans) Java’s exception handling is based on that of C++, but it is designed to be more in line with the
object-oriented language paradigm. Furthermore, Java includes a collection of predefined
exceptions that are implicitly raised by the Java Virtual Machine ( JVM).

All Java exceptions are objects of classes that are descendants of the Throwable class. The Java
system includes two predefined exception classes that are subclasses of Throwable: Error and
Page 37 of 149
 Exception. The Error class and its descendants are related to errors that are thrown by the Java
run-time system, such as running out of heap memory. The exception handlers of Java have the
same form as those of C++, except that every catch must have a parameter and the class of the
parameter must be a descendant of the predefined class Throwable. Throwing an exception is
quite simple. An instance of the exception class is given as the operand of the throw statement.
For example, suppose we define an exception named MyException as
class MyException extends Exception {
public MyException() {}
public MyException(String message) {
super (message);
}
}

This exception can be thrown with

throw new MyException();

The creation of the instance of the exception for the throw could be done separately from the
throw statement, as in

MyException myExceptionObject = new MyException();

...

throw myExceptionObject;

Exceptions of class Error and RuntimeException and their descendants are called unchecked
exceptions. All other exceptions are called checked exceptions. Unchecked exceptions are never
a concern of the compiler. However, the compiler ensures that all checked exceptions a method
can throw are either listed in its throws clause or handled in the method.

There are no default exception handlers, and it is not possible to disable exceptions.

Q.4 a) Differentiate functional languages with imperative languages?-2M

Ans) Functional languages can have a very simple syntactic structure. The list structure of LISP,
which is used for both code and data, clearly illustrates this. The syntax of the imperative
languages is much more complex. This makes them more difficult to learn and to use.

The semantics of functional languages is also simpler than that of the imperative languages.

Execution efficiency is another basis for comparison. When functional programs are
interpreted, they are of course much slower than their compiled imperative counterparts. Another
source of the difference in execution efficiency between functional and imperative programs is
the fact that imperative languages were designed to run efficiently on von Neumann architecture
computers, while the design of functional languages is based on mathematical functions. This
gives the imperative languages a large advantage.

Functional languages have a potential advantage in readability. In many imperative programs,

the details of dealing with variables obscure the logic of the program.

Concurrent execution in the imperative languages is difficult to design and difficult to use. In a
pure functional language, it is much easier.

Q.4 b) Discuss about basic elements of Prolog?-3M

Page 38 of 149
Ans) As with programs in other languages, Prolog programs consist of collections of statements.
There are only a few kinds of statements in Prolog, but they can be complex. All Prolog
statement, as well as Prolog data, are constructed from terms. A Prolog term is a constant, a
variable, or a structure. A constant is either an atom or an integer. Atoms are the symbolic values
of Prolog. In particular, an atom is either a string of letters, digits, and underscores that begins
with a lowercase letter or a string of any printable ASCII characters delimited by apostrophes. A
variable is any string of letters, digits, and underscores that begins with an uppercase letter or an
underscore (_ ). Variables are not bound to types by declarations. The binding of a value, and thus
a type, to a variable is called an instantiation. Instantiation occurs only in the resolution process.
A variable that has not been assigned a value is called uninstantiated. The last kind of term is
called a structure. Structures represent the atomic propositions of predicate calculus.

Our discussion of Prolog statements begins with those statements used to construct the
hypotheses, or database of assumed information. Prolog has two basic statement forms; these
correspond to the headless and headed Horn clauses of predicate calculus. The simplest form of
headless Horn clause in Prolog is a single structure, which is interpreted as an unconditional
assertion, or fact. The following examples illustrate the kinds of facts one can have in a Prolog
program. Notice that every Prolog statement is terminated by a period.
female(shelley).
male(bill).

The other basic form of Prolog statement for constructing the database corresponds to a headed
Horn clause. This form can be related to a known theorem in mathematics from which a
conclusion can be drawn if the set of given conditions is satisfied. The right side is the antecedent,
or if part, and the left side is the consequent, or then part. If the antecedent of a Prolog statement
is true, then the consequent of the statement must also be true.

Conjunctions contain multiple terms that are separated by logical AND operations. In Prolog,
the AND operation is implied. The general form of the Prolog headed Horn clause statement is

consequence :- antecedent_expression.

So far, we have described the Prolog statements for logical propositions, which are used to
describe both known facts and rules that describe logical relationships among facts. These
statements are the basis for the theorem-proving model. The theorem is in the form of a
proposition that we want the system to either prove or disprove. In Prolog, these propositions are
called goals, or queries. The syntactic form of Prolog goal statements is identical to that of
headless Horn clauses.

Queries are called goals. When a goal is a compound proposition, each of the facts (structures)
is called a subgoal. To prove that a goal is true, the inferencing process must find a chain of
inference rules and/or facts in the database that connect the goal to one or more facts in the
database. Because the process of proving a subgoal is done through a proposition matching
process, it is sometimes called matching. In some cases, proving a subgoal is called satisfying
that subgoal.

There are two opposite approaches to attempting to match a given goal to a fact in the
database. The system can begin with the facts and rules of the database and attempt to find a
sequence of matches that lead to the goal. This approach is called bottom-up resolution, or
forward chaining. The alternative is to begin with the goal and attempt to find a sequence of
matching propositions that lead to some set of original facts in the database. This approach is
called top-down resolution, or backward chaining.

Prolog supports integer variables and integer arithmetic. Originally, the arithmetic operators
were functors. Prolog does not have assignment statements in the same sense as imperative

Page 39 of 149
 languages. They are simply not needed in most of the programming for which Prolog was
designed.

Prolog has a built-in structure named trace that displays the instantiations of values to variables
at each step during the attempt to satisfy a given goal. trace is used to understand and debug
Prolog programs. The tracing model describes Prolog execution in terms of four events: (1) call,
which occurs at the beginning of an attempt to satisfy a goal, (2) exit, which occurs when a goal
has been satisfied, (3) redo, which occurs when backtrack causes an attempt to resatisfy a goal,
and (4) fail, which occurs when a goal fails.

Lists are sequences of any number of elements, where the elements can be atoms, atomic
propositions, or any other terms, including other lists. Prolog uses the syntax of ML and Haskell
to specify lists. The list elements are separated by commas, and the entire list is delimited by
square brackets, as in

[apple, prune, grape, kumquat]

Q.5 a) Explain two conditions that satisfies abstract data types.-2M

Ans) An abstract data type is a data type that satisfies the following conditions:

• The representation of objects of the type is hidden from the program units that use the
type, so the only direct operations possible on those objects are those provided in the
type’s definition.
• The declarations of the type and the protocols of the operations on objects of the type,
which provide the type’s interface, are contained in a single syntactic unit. The type’s
interface does not depend on the representation of the objects or the implementation of the
operations. Also, other program units are allowed to create variables of the defined type.

Q.5 b) Write short notes on LISP.-3M

Ans) Many functional programming languages have been developed. The oldest and most widely
used is LISP which was developed by John McCarthy at MIT in 1959.

There were only two categories of data objects in the original LISP: atoms and lists. List
elements are pairs, where the first part is the data of the element, which is a pointer to either an
atom or a nested list. The second part of a pair can be a pointer to an atom, a pointer to another
element, or the empty list. Elements are linked together in lists with the second parts. Atoms and
lists are not types in the sense that imperative languages have types. In fact, the original LISP was
a typeless language. Atoms are either symbols, in the form of identifiers, or numeric literals.

Lists are specified in LISP by delimiting their elements with parentheses.

The elements of simple lists are restricted to atoms, as in

(A B C D)

Nested list structures are also specified by parentheses. For example, the list

(A (B C) D (E (F G)))

is a list of four elements. The first is the atom A; the second is the sublist (B C); the third is the
atom D; the fourth is the sublist (E (F G)), which has as its second element the sublist (F G).
Internally, a list is usually stored as linked list structure in which each node has two pointers, one

Page 40 of 149
to reference the data of the node and the other to form the linked list. A list is referenced by a
pointer to its first element.

Another feature of early LISP systems that was apparently accidental was the use of dynamic
scoping. Functions were evaluated in the environments of their callers.

******

Page 41 of 149
Page 42 of 149
Page 43 of 149
Page 44 of 149
Page 45 of 149
Page 46 of 149
Page 47 of 149
Page 48 of 149
Page 49 of 149
Page 50 of 149
Page 51 of 149
Page 52 of 149
Page 53 of 149
Page 54 of 149
Page 55 of 149
Page 56 of 149
Page 57 of 149
Page 58 of 149
Page 59 of 149
Page 60 of 149
Page 61 of 149
Page 62 of 149
Page 63 of 149
Page 64 of 149
Page 65 of 149
Page 66 of 149
Page 67 of 149
Page 68 of 149
Page 69 of 149
Page 70 of 149
Page 71 of 149
Page 72 of 149
Page 73 of 149
Page 74 of 149
Page 75 of 149
Page 76 of 149
Page 77 of 149
Page 78 of 149
Page 79 of 149
Page 80 of 149
Page 81 of 149
 CO- PO Attainment Process
Academic Year 2019-20
Regulations R15
Year III Sem I
Batch 17
Branch CSE
Subject(Code) PPL (A0524155)
Name of the Faculty Mr. K.Janardhan

External Question Paper Marks --> Cos

Q.No. CO 1 CO 2 CO 3 CO 4 CO 5 CO 6 Total
1 a) 2 2
b) 2 2
c) 2 2
d) 2 2
e) 2 2
f) 2 2
g) 2 2
2 a) 4 4
b) 4 4
c) 6 6
3 a) 4 4
b) 10 10
c) 0
4 a) 8 8
b) 6 6
c) 0
5 a) 6 6
b) 8 8
c) 0
6 a) 10 10
b) 4 4
c) 0
7 a) 10 10
b) 4 4
c) 0

Total 16 16 16 18 16 16 98
Mid I Marks --> Cos

Q.No. CO 1 CO 2 CO 3 CO 4 CO 5 CO 6 Total
1 a) 2 2
b) 2 2
c) 2 2

Page 82 of 149
 d) 2 2
e) 2 2
2 a) 3 3
b) 2 2
3 a) 1 1
b) 4 4
4 a) 2 2
b) 3 3
5 a) 4 4
b) 1 1

Total 7 11 12 0 0 0 30

Mid II Marks --> Cos

Q.No. CO 1 CO 2 CO 3 CO 4 CO 5 CO 6 Total
1 a) 2 2
b) 2 2
c) 2 2
d) 2 2
e) 2 2
2 a) 2 2
b) 3 3
3 a) 2 2
b) 3 3
4 a) 2 2
b) 3 3
5 a) 2 2
b) 3 3

Total 0 0 0 9 9 12 30

Total 7 11 12 9 9 12 60

Assignment 1 Marks --> Cos

CO 1 CO2 CO3 CO4 CO5 CO6 Total

1.66 1.66 1.66 0 0 0 5

Total 1.66 1.66 1.66 0 0 0 5

Assignment 2 Marks --> Cos

CO1 CO2 CO3 CO4 CO5 CO6 Total

0 0 0 1.66 1.66 1.66 5

Total 0 0 0 1.66 1.66 1.66 5

Page 83 of 149
 Total 1.66 1.66 1.66 1.66 1.66 1.66 10

R15 Regulation Weightage of Marks

Final exam Internal tests Ass/Quiz

70 25 5
0.7 0.25 0.05

Weightage marks for each CO

CO 1 CO 2 CO 3 CO 4 CO 5 CO 6 Total
EM 16 16 16 18 16 16 98
IM 7 11 12 9 9 12 60
AM 1.66 1.66 1.66 1.66 1.66 1.66 10

% Weightage of each CO
CO 1 CO 2 CO 3 CO 4 CO 5 CO 6 Total
EM (%) 16.32653 16.32653 16.3265306 18.36735 16.32653 16.32653 100
IM (%) 11.66667 18.33333 20 15 15 20 100
AM (%) 16.6 16.6 16.6 16.6 16.6 16.6 100
Avg 15.17524 16.8419 17.2585714 17.43714 16.00857 17.25857 100

Final Total
Internal Assignment External
S.No Reg.No. Internal Final
marks marks Marks
marks Marks
1 15091A0501 8.75 5 14 35 21
2 16091A0526 9.75 5 15 36 21
3 16091A0551 7.75 5 13 40 27
4 16091A0563 8.75 5 14 45 31
5 16091A05E1 14.25 5 20 45 25
6 16091A05H0 10 5 15 35 20
7 17091A0502 13.25 5 19 49 30
8 17091A0503 21.75 5 27 64 37
9 17091A0506 11 5 16 48 32
10 17091A0507 12.5 5 18 47 29
11 17091A0508 5 5 10 26 16
12 17091A0509 5.25 5 11 31 20
13 17091A0510 15.25 5 21 51 30
14 17091A0511 18.25 5 24 58 34
15 17091A0512 20.5 5 26 62 36
16 17091A0513 21.75 5 27 79 52
17 17091A0514 14.75 5 20 53 33
18 17091A0515 21.5 5 27 67 40
19 17091A0516 22 5 27 69 42
20 17091A0517 13 5 18 48 30
21 17091A0518 19 5 24 76 52
22 17091A0519 17.75 5 23 64 41
23 17091A0520 15.75 5 21 68 47
24 17091A0521 13.5 5 19 55 36
Page 84 of 149
25 17091A0522 10.5 5 16 42 26
26 17091A0523 10 5 15 44 29
27 17091A0524 18.5 5 24 66 42
28 17091A0525 20 5 25 65 40
29 17091A0526 11 5 16 43 27
30 17091A0527 22.75 5 28 73 45
31 17091A0528 16.5 5 22 64 42
32 17091A0529 15.75 5 21 56 35
33 17091A0530 10.75 5 16 45 29
34 17091A0531 11.75 5 17 46 29
35 17091A0532 11.25 5 17 45 28
36 17091A0533 19.75 5 25 71 46
37 17091A0535 9 5 14 46 32
38 17091A0536 10.5 5 16 42 26
39 17091A0538 11 5 16 46 30
40 17091A0539 10.5 5 16 43 27
41 17091A0540 12.75 5 18 50 32
42 17091A0541 15 5 20 55 35
43 17091A0542 21.5 5 27 65 38
44 17091A0543 9.75 5 15 49 34
45 17091A0544 12.25 5 18 55 37
46 17091A0545 14.25 5 20 50 30
47 17091A0546 8.25 5 14 35 21
48 17091A0547 23 5 28 74 46
49 17091A0548 17.25 5 23 60 37
50 17091A0549 21 5 26 73 47
51 17091A0550 10.25 5 16 47 31
52 17091A0551 3.75 5 9 29 20
53 17091A0552 17.5 5 23 61 38
54 17091A0553 14.75 5 20 53 33
55 17091A0554 21 5 26 72 46
56 17091A0555 23.75 5 29 82 53
57 17091A0556 10.5 5 16 47 31
58 17091A0557 12.5 5 18 61 43
59 17091A0558 19 5 24 61 37
60 17091A0559 12.75 5 18 53 35
61 17091A0561 11.25 3.5 15 23 8
62 17091A0562 14.5 5 20 62 42
63 17091A0563 13.75 5 19 50 31
64 17091A0564 12.25 5 18 50 32
65 17091A0565 15.75 5 21 61 40
66 17091A0566 21.5 5 27 67 40
67 17091A0567 19.5 5 25 56 31
68 17091A0568 20.25 5 26 72 46
69 17091A0569 11.5 5 17 46 29
70 17091A0570 23.5 5 29 82 53
71 17091A0571 19.25 5 25 61 36
72 17091A0572 16.5 5 22 54 32
73 17091A0573 18 5 23 60 37
74 17091A0574 14.75 5 20 57 37
75 17091A0575 22.25 5 28 70 42
76 17091A0576 21 5 26 64 38
Page 85 of 149
77 17091A0577 13 5 18 48 30
78 17091A0578 11.25 5 17 26 9
79 17091A0579 17.25 5 23 62 39
80 17091A0580 8.25 5 14 43 29
81 17091A0581 13 5 18 47 29
82 17091A0582 18.25 5 24 61 37
83 17091A0583 18.5 5 24 67 43
84 17091A0585 9.75 5 15 48 33
85 17091A0586 23.25 5 29 85 56
86 17091A0587 10.5 5 16 45 29
87 17091A0589 12.5 5 18 54 36
88 17091A0590 21.5 5 27 66 39
89 17091A0591 10 5 15 51 36
90 17091A0592 10.5 5 16 49 33
91 17091A0593 4.75 5 10 40 30
92 17091A0594 10.75 5 16 45 29
93 17091A0595 13.75 5 19 49 30
94 17091A0596 18.5 5 24 56 32
95 17091A0597 11.5 5 17 45 28
96 17091A0598 13 5 18 54 36
97 17091A0599 13 5 18 50 32
98 17091A05A0 0.75 5 6 18 12
99 17091A05A1 9.75 5 15 46 31
100 17091A05A2 12 5 17 49 32
101 17091A05A3 19.75 5 25 65 40
102 17091A05A5 19.75 5 25 72 47
103 17091A05A6 15.75 5 21 60 39
104 17091A05A7 20.5 5 26 72 46
105 17091A05A8 17.75 5 23 64 41
106 17091A05A9 21 5 26 72 46
107 17091A05B0 13.5 5 19 56 37
108 17091A05B1 10 5 15 42 27
109 17091A05B3 13 5 18 50 32
110 17091A05B4 15.25 5 21 57 36
111 17091A05B5 9 5 14 46 32
112 17091A05B6 7.5 5 13 43 30
113 17091A05B7 22.25 5 28 72 44
114 17091A05B8 18.25 5 24 67 43
115 17091A05B9 14.5 5 20 51 31
116 17091A05C0 6.5 5 12 44 32
117 17091A05C1 19.5 5 25 63 38
118 17091A05C2 20.25 5 26 64 38
119 17091A05C3 18.75 5 24 65 41
120 17091A05C4 21.25 5 27 69 42
121 17091A05C5 11.25 5 17 52 35
122 17091A05C6 16 5 21 57 36
123 17091A05C8 20.75 5 26 66 40
124 17091A05C9 11.25 5 17 62 45
125 17091A05D0 17.75 5 23 58 35
126 17091A05D1 9 5 14 45 31
127 17091A05D3 14.25 5 20 52 32
128 17091A05D4 7.75 5 13 29 16
Page 86 of 149
129 17091A05D5 4.25 5 10 40 30
130 17091A05D6 21 5 26 76 50
131 17091A05D7 16.5 5 22 63 41
132 17091A05D8 12.75 5 18 51 33
133 17091A05D9 19.25 5 25 62 37
134 17091A05E0 2 5 7 41 34
135 17091A05E1 19.5 5 25 65 40
136 17091A05E2 7.5 5 13 43 30
137 17091A05E3 22.25 5 28 70 42
138 17091A05E4 15.5 5 21 60 39
139 17091A05E5 12 5 17 57 40
140 17091A05E6 10 5 15 47 32
141 17091A05E8 10.75 5 16 43 27
142 17091A05E9 14.5 5 20 57 37
143 17091A05F0 7.25 5 13 29 16
144 17091A05F1 14 5 19 58 39
145 17091A05F2 15 5 20 57 37
146 17091A05F3 18 5 23 52 29
147 17091A05F4 17.75 5 23 57 34
148 17091A05F5 13 5 18 45 27
149 17091A05F6 19.75 5 25 64 39
150 17091A05F7 18 5 23 67 44
151 17091A05F8 9.75 5 15 32 17
152 17091A05G0 20.5 5 26 70 44
153 17091A05G1 15 5 20 58 38
154 17091A05G2 19.25 5 25 59 34
155 17091A05G3 15.25 5 21 63 42
156 17091A05G5 17.75 5 23 67 44
157 17091A05G7 14.75 5 20 57 37
158 17091A05G8 21 5 26 76 50
159 17091A05G9 10.25 5 16 50 34
160 17091A05H0 20.75 5 26 64 38
161 17091A05H1 13.75 5 19 54 35
162 17091A05H2 20 5 25 72 47
163 17091A05H3 17.5 5 23 63 40
164 17091A05H4 9.75 5 15 43 28
165 17091A05H5 21.5 5 27 76 49
166 17091A05H6 17 5 22 61 39
167 17091A05H8 6.5 5 12 34 22
168 17091A05H9 9 5 14 40 26
169 18095A0501 10.75 5 16 47 31

% of % of % of
N CO 1 N CO 2 N CO 3 N CO 4 N CO 5 N CO 6
IM AM EM

35 100 30 34.7896 34.81042 34.815 34.40726 34.80055 34.814999

39 100 30 35.5584 35.89898 35.97384 35.26749 35.73755 35.973843
31 100 38.5714 40.476 39.53826 39.33213 39.8671 39.98273 39.332127
35 100 44.2857 45.5483 44.50441 44.27495 44.94072 44.99917 44.274954
57 100 35.7143 43.3214 44.67507 44.97263 43.35192 44.03349 44.972625
40 100 28.5714 34.6747 35.20172 35.31756 34.4292 34.95194 35.317559
Page 87 of 149
53 100 42.8571 47.932 48.43351 48.54376 47.75842 48.1958 48.543758
87 100 52.8571 61.9978 64.47202 65.0159 62.44382 63.29932 65.015905
44 100 45.7143 48.3539 47.92306 47.82835 47.92959 48.12728 47.828349
50 100 41.4286 46.2795 46.6477 46.72863 46.0599 46.47319 46.728629
20 100 22.8571 26.5273 25.88135 25.73935 25.91466 26.1875 25.739355
21 100 28.5714 31.0229 30.03108 29.81305 30.3431 30.5012 29.813048
61 100 42.8571 49.4696 50.61062 50.86145 49.47889 50.0698 50.861447
73 100 48.5714 56.0794 57.75388 58.12196 56.27297 56.96024 58.121962
82 100 51.4286 59.961 62.14193 62.62135 60.31518 61.10821 62.621353
87 100 74.2857 78.1358 79.01301 79.20584 78.24401 78.59724 79.205837
59 100 47.1429 52.3128 52.97454 53.12001 52.20881 52.66088 53.120011
86 100 57.1429 65.0332 67.10808 67.56418 65.3888 66.12465 67.56418
88 100 60 67.5693 69.59116 70.03559 67.92561 68.63288 70.035593
52 100 42.8571 47.7398 48.16137 48.25405 47.54336 47.96155 48.254047
76 100 74.2857 76.0216 76.01948 76.01901 75.87837 76.0205 76.019015
71 100 58.5714 63.2261 63.9954 64.16451 63.21628 63.63077 64.164509
63 100 67.1429 68.1437 67.63469 67.52279 67.81589 67.87595 67.522793
54 100 51.4286 54.5794 54.52205 54.50944 54.29356 54.54922 54.509442
42 100 37.1429 41.5143 41.56239 41.57295 41.1794 41.53961 41.572954
40 100 41.4286 44.3575 43.92631 43.83152 43.90932 44.1307 43.831518
74 100 60 64.8786 65.78121 65.97964 64.9148 65.35338 65.979637
80 100 57.1429 63.88 65.47525 65.82591 64.09845 64.71916 65.825913
44 100 38.5714 42.9746 43.07607 43.09837 42.66286 43.02797 43.098372
91 100 64.2857 71.3735 73.31577 73.74271 71.73082 72.39521 73.742713
66 100 60 63.341 63.60411 63.66195 63.19433 63.47939 63.661949
63 100 50 55.2333 56.00189 56.17085 55.17573 55.6376 56.170847
43 100 41.4286 44.9341 44.74273 44.70065 44.55449 44.83344 44.700652
47 100 41.4286 45.7029 45.83128 45.8595 45.41473 45.77044 45.859496
45 100 40 44.2427 44.3176 44.33408 43.93126 44.28208 44.334078
79 100 65.7143 70.143 71.01951 71.21217 70.20347 70.60408 71.212175
36 100 45.7143 46.8163 45.74595 45.51066 46.20912 46.25328 45.51066
42 100 37.1429 41.5143 41.56239 41.57295 41.1794 41.53961 41.572954
44 100 42.8571 46.2022 45.98426 45.93636 45.8229 46.08756 45.936358
42 100 38.5714 42.5902 42.53179 42.51895 42.23274 42.55947 42.518949
51 100 45.7143 49.6993 49.82803 49.85633 49.435 49.76703 49.856327
60 100 50 54.6567 55.18548 55.30171 54.53056 54.93486 55.301713
86 100 54.2857 62.8815 65.16928 65.67219 63.28211 64.08493 65.672189
39 100 48.5714 49.5447 48.50117 48.27178 48.96099 48.99575 48.271785
49 100 52.8571 54.6943 54.13075 54.00688 54.27161 54.39784 54.006882
57 100 42.8571 48.7008 49.52207 49.7026 48.61865 49.1328 49.702603
33 100 30 34.4052 34.26614 34.23558 33.97714 34.33205 34.235577
92 100 65.7143 72.6416 74.55731 74.97842 72.99923 73.64932 74.978419
69 100 52.8571 58.5382 59.57352 59.8011 58.57277 59.08283 59.801104
84 100 67.1429 72.1799 73.3496 73.60673 72.33211 72.79519 73.606726
41 100 44.2857 46.7015 46.13725 46.01322 46.23107 46.40467 46.01322
15 100 28.5714 29.8698 28.39825 28.07478 29.05275 29.0957 28.074781
70 100 54.2857 59.8063 60.81506 61.03681 59.84118 60.33694 61.036811
59 100 47.1429 52.3128 52.97454 53.12001 52.20881 52.66088 53.120011
84 100 65.7143 71.104 72.3802 72.66073 71.27876 71.77532 72.660731
95 100 75.7143 80.7493 82.15952 82.46952 81.01782 81.4911 82.469521
42 100 44.2857 46.8937 46.40939 46.30293 46.44613 46.63892 46.302931
50 100 61.4286 61.3417 60.21929 59.97257 60.80675 60.75126 59.972566
Page 88 of 149
76 100 52.8571 59.8836 61.4785 61.82908 60.07818 60.72257 61.829082
51 100 50 52.9269 52.73623 52.69431 52.59504 52.82661 52.694313
45 70 11.4286 21.0845 23.45116 23.97141 21.43635 22.32943 23.971407
58 100 60 61.8034 61.427 61.34426 61.47387 61.60539 61.34426
55 100 44.2857 49.3922 49.94719 50.06918 49.24188 49.68416 50.069176
49 100 45.7143 49.3149 49.28376 49.2769 49.00488 49.29853 49.276905
63 100 57.1429 60.6126 60.84889 60.90082 60.44246 60.73691 60.900824
86 100 57.1429 65.0332 67.10808 67.56418 65.3888 66.12465 67.56418
78 100 44.2857 53.8128 56.20638 56.73253 54.18822 55.0719 56.732532
81 100 65.7143 70.5274 71.56378 71.7916 70.63359 71.07258 71.791597
46 100 41.4286 45.5107 45.55914 45.56978 45.19967 45.53619 45.569785
94 100 75.7143 80.5571 81.88738 82.17981 80.80277 81.25685 82.17981
77 100 51.4286 59 60.78123 61.1728 59.23989 59.93696 61.172798
66 100 45.7143 52.5823 53.91011 54.20199 52.66087 53.28077 54.201994
72 100 52.8571 59.1148 60.38994 60.67024 59.21795 59.78557 60.670238
59 100 52.8571 56.6162 56.85214 56.90399 56.42219 56.74033 56.903993
89 100 60 67.7615 69.86329 70.3253 68.14067 68.86712 70.325304
84 100 54.2857 62.4971 64.625 65.09277 62.85199 63.61643 65.092767
52 100 42.8571 47.7398 48.16137 48.25405 47.54336 47.96155 48.254047
45 100 12.8571 23.8012 25.89902 26.36016 23.91769 24.90471 26.360164
69 100 55.7143 60.69 61.51232 61.6931 60.67947 61.12255 61.693095
33 100 41.4286 43.0121 42.02134 41.80354 42.40391 42.49095 41.80354
52 100 41.4286 46.6639 47.19197 47.30805 46.49002 46.94169 47.308052
73 100 52.8571 59.307 60.66208 60.95995 59.43301 60.01982 60.959949
74 100 61.4286 65.9544 66.75061 66.92563 65.96814 66.37324 66.925633
39 100 47.1429 48.4688 47.53177 47.32579 47.90764 47.97589 47.325789
93 100 80 83.5925 84.52344 84.72809 83.74775 84.08219 84.728085
42 100 41.4286 44.7419 44.47059 44.41094 44.33943 44.59919 44.41094
50 100 51.4286 53.8106 53.43349 53.3506 53.43332 53.61222 53.350598
86 100 55.7143 63.9574 66.13868 66.61818 64.33546 65.10479 66.618184
40 100 51.4286 51.8886 50.7121 50.45349 51.28274 51.26973 50.453487
42 100 47.1429 49.0454 48.34818 48.19492 48.55282 48.67864 48.194922
19 100 42.8571 41.3972 39.1808 38.69358 40.44644 40.23132 38.69358
43 100 41.4286 44.9341 44.74273 44.70065 44.55449 44.83344 44.700652
55 100 42.8571 48.3164 48.97779 49.12318 48.18854 48.6643 49.12318
74 100 45.7143 54.1199 56.08722 56.51968 54.38133 55.15476 56.519683
46 100 40 44.4349 44.58974 44.62379 44.14632 44.51633 44.623789
52 100 51.4286 54.195 53.97777 53.93002 53.86344 54.08072 53.93002
52 100 45.7143 49.8915 50.10017 50.14604 49.65006 50.00127 50.146038
3 100 17.1429 18.9564 17.37739 17.03028 18.04528 18.12581 17.030284
39 100 44.2857 46.3171 45.59297 45.4338 45.80095 45.93617 45.433798
48 100 45.7143 49.1227 49.01162 48.98719 48.78982 49.06428 48.987194
79 100 57.1429 63.6878 65.20311 65.5362 63.88339 64.48491 65.536202
79 100 67.1429 71.2189 71.9889 72.15817 71.25682 71.62394 72.15817
63 100 55.7143 59.5368 59.87949 59.95483 59.38912 59.71705 59.954829
82 100 65.7143 70.7196 71.83592 72.08131 70.84865 71.30683 72.081308
71 100 58.5714 63.2261 63.9954 64.16451 63.21628 63.63077 64.164509
84 100 65.7143 71.104 72.3802 72.66073 71.27876 71.77532 72.660731
54 100 52.8571 55.6552 55.49145 55.45544 55.3469 55.56908 55.455438
40 100 38.5714 42.2058 41.98751 41.93953 41.80263 42.09097 41.939527
52 100 45.7143 49.8915 50.10017 50.14604 49.65006 50.00127 50.146038
61 100 51.4286 55.9248 56.42702 56.53742 55.79896 56.18897 56.53742
Page 89 of 149
36 100 45.7143 46.8163 45.74595 45.51066 46.20912 46.25328 45.51066
30 100 42.8571 43.5114 42.17432 41.8804 42.81208 42.80806 41.880403
89 100 62.8571 69.9133 71.80209 72.2173 70.24736 70.90685 72.217295
73 100 61.4286 65.7622 66.47848 66.63592 65.75308 66.13899 66.635922
58 100 44.2857 49.9688 50.7636 50.93831 49.88706 50.38691 50.938309
26 100 45.7143 44.8943 43.02457 42.61355 44.05854 43.91079 42.613549
78 100 54.2857 61.3439 62.99217 63.3545 61.56164 62.21093 63.3545
81 100 54.2857 61.9205 63.80859 64.22363 62.20682 62.91368 64.223633
75 100 58.5714 63.9949 65.08395 65.32335 64.07651 64.56777 65.323353
85 100 60 66.9928 68.77474 69.16646 67.28044 67.93013 69.16646
45 100 50 51.7737 51.1034 50.95605 51.30469 51.42111 50.956047
64 100 51.4286 56.5014 57.24343 57.40655 56.44414 56.89172 57.406553
83 100 57.1429 64.4566 66.29166 66.69505 64.74363 65.4219 66.695047
45 100 64.2857 62.5324 60.79739 60.416 61.83815 61.61973 60.416002
71 100 50 56.7709 58.179 58.48854 56.8962 57.5116 58.488536
36 100 44.2857 45.7405 44.77655 44.56466 45.15578 45.23342 44.564665
57 100 45.7143 50.8525 51.46086 51.59459 50.72535 51.17252 51.594594
31 100 22.8571 28.6415 28.87487 28.92618 28.2803 28.76425 28.926177
17 100 42.8571 41.0128 38.63652 38.11416 40.01633 39.76282 38.114158
84 100 71.4286 75.4075 76.2578 76.44471 75.49215 75.85477 76.444712
66 100 58.5714 62.2651 62.63471 62.71595 62.14098 62.45952 62.715953
51 100 47.1429 50.7752 50.79743 50.80232 50.48834 50.78689 50.802322
77 100 52.8571 60.0758 61.75063 62.11879 60.29324 60.95682 62.118793
8 100 48.5714 43.5865 40.06487 39.29074 42.29419 41.73402 39.29074
78 100 57.1429 63.4956 64.93097 65.24649 63.66834 64.25066 65.246491
30 100 42.8571 43.5114 42.17432 41.8804 42.81208 42.80806 41.880403
89 100 60 67.7615 69.86329 70.3253 68.14067 68.86712 70.325304
62 100 55.7143 59.3446 59.60735 59.66512 59.17406 59.4828 59.665118
48 100 57.1429 57.7297 56.76681 56.55516 57.21659 57.22317 56.555157
40 100 45.7143 47.5851 46.83451 46.6695 47.06936 47.19028 46.669505
43 100 38.5714 42.7824 42.80393 42.80866 42.4478 42.79372 42.808661
58 100 52.8571 56.424 56.58 56.61428 56.20713 56.50608 56.614282
29 100 22.8571 28.2571 28.33059 28.34675 27.85018 28.29575 28.346755
56 100 55.7143 58.1914 57.97452 57.92685 57.88371 58.07731 57.926851
60 100 52.8571 56.8084 57.12428 57.1937 56.63725 56.97458 57.193704
72 100 41.4286 50.5079 52.63475 53.10227 50.79118 51.62668 53.102274
71 100 48.5714 55.695 57.2096 57.54254 55.84285 56.49174 57.54254
52 100 38.5714 44.5122 45.25317 45.41606 44.38332 44.90197 45.416061
79 100 55.7143 62.612 64.23371 64.59021 62.83005 63.46504 64.590207
72 100 62.8571 66.6459 67.17574 67.29221 66.59137 66.92461 67.292206
39 100 24.2857 31.2549 32.02138 32.18986 31.05411 31.6581 32.189861
82 100 62.8571 68.5679 69.89712 70.18932 68.74195 69.2671 70.189317
60 100 54.2857 57.8843 58.09368 58.1397 57.6906 57.99444 58.1397
77 100 48.5714 56.8482 58.84244 59.28081 57.1332 57.89724 59.280807
61 100 60 62.38 62.24341 62.21339 62.11904 62.30814 62.213393
71 100 62.8571 66.4537 66.9036 67.0025 66.37631 66.69036 67.002495
59 100 52.8571 56.6162 56.85214 56.90399 56.42219 56.74033 56.903993
84 100 71.4286 75.4075 76.2578 76.44471 75.49215 75.85477 76.444712
41 100 48.5714 49.9291 49.04544 48.85121 49.39111 49.46425 48.851207
83 100 54.2857 62.3049 64.35287 64.80306 62.63693 63.38218 64.803056
55 100 50 53.6957 53.82479 53.85316 53.45527 53.76361 53.853158
80 100 67.1429 71.4111 72.26104 72.44788 71.47188 71.85819 72.447882
Page 90 of 149
 70 100 57.1429 61.958 62.75386 62.9288 61.94787 62.37666 62.928802
39 100 40 43.0895 42.68477 42.59581 42.64091 42.87658 42.595812
86 100 70 74.716 75.83267 76.07814 74.86892 75.30341 76.078139
68 100 55.7143 60.4978 61.24018 61.40338 60.46441 60.8883 61.403384
26 100 31.4286 34.1357 33.33057 33.15359 33.52508 33.71217 33.153594
36 100 37.1429 40.3611 39.92956 39.83469 39.88905 40.13411 39.834687
43 100 44.2857 47.0859 46.68152 46.59264 46.66119 46.87317 46.592643

III Year Threshold

55

CO 1 CO 2 CO 3 CO 4 CO 5 CO 6
No. No. No. No. No. No.
of of of of of of
Weig Weig Weig Weig Weig Weig
stud stud stud stud stud stud
htage htage htage htage htage htage
ents ents ents ents ents ents
Points Points Points Points Points Points
Attai Attai Attai Attai Attai Attai
ned ned ned ned ned ned
>= 55% 82 3 85 3 85 3 82 3 84 3 85 3
40% to 55% 73 2 66 2 65 2 71 2 69 2 65 2
<40% 14 1 18 1 19 1 16 1 16 1 19 1
Total No. of
169 169 169 169 169 169
students
Atainment
2.40 2.40 2.39 2.39 2.40 2.39
value
% of
48.52 50.30 50.30 48.52 49.70 50.30
Attainment
Attained or
NO YES YES NO NO YES
not

CO
Attainm PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO
ent 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
Value
CO
2.40 2 1 2 2 1 1 1 1
1
CO
2.40 2 1 1 1 2 2
2
CO
2.39 1 1 2 2 1
3
CO
2.39 2 1 1 1 1 2 2
4
CO
2.40 2 1 2 1 1 1 1 1 2 1
5
CO
2.39 2 1 1 1 1 1 1 1
6

PPL 2.4 2.4 2.4 2.4 2.4 2.3 2.4

- - - - 2.39 2.40 2.40 2.40
(A0524155) 0 0 0 0 0 9 0

Page 91 of 149
Page 92 of 149
Page 93 of 149
Page 94 of 149
Page 95 of 149
Page 96 of 149
Page 97 of 149
Page 98 of 149
Page 99 of 149
Page 100 of 149
Page 101 of 149
Page 102 of 149
Page 103 of 149
Page 104 of 149
Page 105 of 149
Page 106 of 149
Page 107 of 149
Page 108 of 149
Page 109 of 149
Page 110 of 149
Page 111 of 149
Page 112 of 149
Page 113 of 149
Page 114 of 149
Page 115 of 149
Page 116 of 149
Page 117 of 149
Page 118 of 149
Page 119 of 149
Page 120 of 149
Page 121 of 149
Page 122 of 149
Page 123 of 149
Page 124 of 149
Page 125 of 149
Page 126 of 149
Page 127 of 149
Page 128 of 149
Page 129 of 149
Page 130 of 149
Page 131 of 149
Page 132 of 149
Page 133 of 149
Page 134 of 149
Page 135 of 149
Page 136 of 149
Page 137 of 149
Page 138 of 149
Page 139 of 149
Page 140 of 149
Page 141 of 149
Page 142 of 149
Page 143 of 149
Page 144 of 149
Page 145 of 149
Page 146 of 149
Page 147 of 149
Page 148 of 149
Page 149 of 149