Principle of Programming Language

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

MODEL QUESTION PAPER-1

SECTION-A
I. Answer any TEN questions
1. Define Programming language. Mention any two characteristic of Programming language.
 A programming language is a formal language comprising a set of instructions that produce various
kinds of output. Programming languages are used in computer programming to implement
algorithms.
 Here are two key characteristics of programming languages:
1. Syntax: The rules that define the structure and form of code written in the language.
2. Semantics: The meaning behind the syntactic elements and the instructions they represent in the
language.

2. What is an attribute Grammar? Give an example.

 Attribute grammars define semantics by specifying that certain semantic attributes (values) will be
associated with certain nodes in the syntax tree and providing equations that specify how the values
of these attributes are to be computed
Example: Arithmetic expression grammar with attributes to compute expression values.

3. Define an algorithm and flowchart

 Algorithm: Is a step by step procedure to solve the particular problem with finite number of steps
Flowchart: it are used for visualizing the overall structure and flow of an algorithm

4. What are Scripting Languages? Name two common Scripting Languages

 A scripting language is a programming language that executes tasks within a special runtime
environment by an interpreter instead of a compiler.
 “Python & JavaScript” are the two common Scripting Languages.

5. Differentiate between First-class and Higher order functions.

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

6. Define Polymorphism in OOP. Mention two types of polymorphism.

 Polymorphism means “Many forms” The process of representing one forms in multiple forms is
known as polymorphism.
 Types of Polymorphism : -
 Compile-time Polymorphism (Static Polymorphism)
 Runtime Polymorphism (Dynamic Polymorphism)

7. Mention the rules to define a variable/Identifier.

 Variable Name: Choose a descriptive name for the variable that reflects its purpose. Variable names
should be meaningful and easily understandable to anyone reading the code
Follow Naming Conventions: Use the appropriate naming style for your programming language
Data Type: Specify the data type of the variable, which indicates the kind of data it can hold.
Common data types include integers, floats, strings, and Booleans.

8. Difference between tuple and list.

 Tuple: - tuple is a composite data type that stores multiple values of different types in a single unit,
typically enclosed in parentheses
List:- A list is a data structure that stores a collection of elements, allowing dynamic insertion,
deletion, and modification.

9. Define short-circuit evaluation. Give an example.

 Short-circuit evaluation is a technique used to evaluate Boolean expressions. It involves evaluating
the operands of a Boolean operator in a specific order, stopping as soon as the result of the
expression can be determined.
Ex:- the logical AND operator (&&) in many programming languages. If the first operand is false, the
entire expression will be false

10. What is an operator overloading?

 Operator overloading is a feature in programming languages that allows developers to redefine the
behavior of operators (such as +, -, *, /) for user-defined data types, such as classes or structures.
This enables the use of operators with custom data types, making the code more intuitive and easier
to read

11. Define ADT. Give an example..

 Abstract data type (ADT) is a set of data and the set of operations that can be performed on the
data. Built-in ADT
Example: Stack ADT with operations like Push, Pop, Top, and isEmpty.

12. Define local and global variables.

 Local Variable: A variable declared within a function or block, accessible only within that scope.
Global Variable: A variable declared outside all functions or blocks, accessible from any part of the
program.

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

SECTION-B
II. Answer any FIVE questions.
13. Explain the techniques of semantics in computer programming language.
 Techniques of Semantics in Programming Languages:
1. Operational Semantics: Defines the meaning of a program by describing how it executes on a
machine.
2. Denotation Semantics: Defines the meaning of a program by mapping it to mathematical objects
(denotations) that represent its behavior.
3. Axiomatic Semantics: Defines the meaning of a program by specifying axioms and inference rules
that describe its behavior.
These techniques help formalize the meaning of programming languages, enabling better
design, implementation, and verification of programs.

14. What are the different criteria’s to evaluate the languages.

 Readability: How easy it is for developers to read and understand the code. This includes the
language's syntax, use of keywords, and clarity of structure.
Maintainability: How well the code can be maintained and updated over time. This includes the ease
of refactoring, debugging, and extending the codebase.
Performance: The efficiency of the language in terms of execution speed, memory usage, and
overall resource consumption.
Portability: The ability of the language to be used on different platforms and operating systems
without requiring significant modifications.
Expressiveness: The capability of the language to express complex ideas and algorithms concisely
and clearly.
Tool Support: Availability and quality of development tools, such as IDEs, debuggers, and compilers,
that enhance productivity.

15. Explain polymorphism in detail.

 Polymorphism is the ability of an object or a method to take on multiple forms, depending on the
context in which it is used.
 Types of Polymorphism:
1. Method Overloading: Multiple methods with the same name but different parameters.
2. Method Overriding: A subclass provides a different implementation of a method already defined in its
superclass.
3. Operator Overloading: Redefining operators for user-defined data types.
4. Function Polymorphism: Functions with the same name but different parameters or return types.
 Benefits of Polymorphism:
1. Increased flexibility: Objects can adapt to different situations.
2. Easier maintenance: Changes can be made at one place.
3. Improved code reusability: Methods can be used with different types of data.

Example:
class Shape {
void draw() {

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

[Link]("Drawing a shape");
}
}
class Circle extends Shape {
@Override
void draw() {
[Link]("Drawing a circle");
}
}
class Rectangle extends Shape {
@Override
void draw() {
[Link]("Drawing a rectangle");
}
}
public class Main {
public static void main(String[] args) {
Shape shape = new Circle();
[Link](); // Output: Drawing a circle
shape = new Rectangle();
[Link](); // Output: Drawing a rectangle
}
}

16. Explain the key concepts of Logic programming

 Logic programming is a programming paradigm based on formal logic, where programs are
expressed as sets of logical statements, and computation is performed through logical inference.
Here are the key concepts of logic programming:

Facts: Basic assertions about relationships or properties within a domain. They are considered to be
always true. For example, in Prolog, a fact might be written as:
“parent(alice, bob)”

Rules: Conditional statements that define relationships between facts. A rule consists of a head and
a body, where the head is true if the body is true. For example:
“grandparent(X, Z) :- parent(X, Y), parent(Y, Z)”
This rule states that X is a grandparent of Z if X is a parent of Y and Y is a parent of Z.

Queries: Questions asked to the logic program to retrieve information or check for truth. The system
attempts to satisfy the query by using the facts and rules provided.
for example:
“grandparent (alice, charlie)”

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

Unification: A process of matching terms (variables, constants, structures) to determine if they can
be made identical. Unification is a key mechanism for resolving queries by finding appropriate
substitutions that make different terms equal.
Backtracking: A search strategy used to explore alternative solutions to a query. If a certain path
fails, the system backtracks to previous points to try different possibilities until a solution is found or
all options are exhausted.

17. Explain type checking and type equivalence in detail

 Type Checking
Type checking is the process of verifying and enforcing the constraints of types to ensure that
operations are performed on compatible data types. It can be done at two different stages:

 Static Type Checking:

Performed at compile time, before the program runs.
Errors are detected early, which helps in catching mistakes before execution.
Common in statically-typed languages like C++, Java, and Haskell.
Example:
int a = 5;
a = "Hello"; // Compile-time error: incompatible types.

 Dynamic Type Checking:

Performed at runtime, while the program is running.
Offers greater flexibility but can result in runtime errors.
Common in dynamically-typed languages like Python, JavaScript, and Ruby.
Example:
a=5
a = "Hello" # No error at assignment, but potential runtime issues.
Type Equivalence
Type equivalence determines when two types are considered the same. There are two main kinds:

 Name Equivalence:
Two types are equivalent if they have the same name.
Simple and intuitive but can be overly restrictive.
Example:
typedef int Age;
typedef int Height;
Age a = 10;
Height h = 15;
// Age and Height are not equivalent, despite both being int.

 Structural Equivalence:
Two types are equivalent if they have the same structure or composition.

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

More flexible and allows for greater code reuse.

Example:
struct Point {
int x, y;
};
struct Coordinate {
int x, y;
};
// Point and Coordinate are structurally equivalent.

18. Explain type conversions in detail

 Type mixing in expressions occurs when operands of different data types are used in an expression.
Ex:- int to float

Implicit Type Conversion: Automatic conversion of one data type to another.

Ex:- int x = 5; double y = x;
Explicit Type Conversion: Manual conversion of one data type to another using casting
Ex: - int x = 5; double y = (double) x;
Type Promotion: Automatic conversion of a smaller data type to a larger data type.
Ex: int x = 5; long y = x;

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

19. Design Flowchart to find maximum of three numbers.

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

SECTION-C
III. Answer any FIVE questions.
20. Explain the general problem of describing syntax and formal methods of describing syntax in
programming languages with examples.
 General problem of describing syntax:
A sentence is a string of characters over some alphabet
 A language is a set of sentences
 A lexeme is the lowest level syntactic unit of a language (e.g., *, sum, begin)
 A token is a category of lexemes (e.g., identifier)
 Languages Recognizers – A recognition device reads input strings of the language and decides
whether the input strings belong to the language
Example: syntax analysis part of a compiler
 Languages Generators – A device that generates sentences of a language – One can determine if the
syntax of a particular sentence is correct by comparing it to the structure of the generator
Formal methods of describing syntax:
Formal language genearation mechanism,usually called grammers are commonly used to
describe the syntax of programming
 Backus-Naur Form and Context-Free Grammars – Most widely known method for describing
programming language syntax
 Extended BNF – Improves readability and writability of BNF
 Grammars and Recognizers Backus-Naur Form and Context-Free Grammars
 Context-Free Grammars
 Developed by Noam Chomsky in the mid-1950s
 Language generators, meant to describe the syntax of natural
 Define a class of languages called context-free languages Backus-Naur

21. Provide a detailed explanation of algorithm development, including flowcharts and pseudocode
 Is a step by step procedure to solve the particular problem with finite number of steps
Example:
Write an algorithm toass two numbers

 Start
 Step-1: Get number1
 Step-2 : get number 2
 Step-3: Sum <-……number1 + number2
 Step-4: Display/Print sum
 Stop
 Flow Charts & Pseudocode:
Flowcharts are used for visualizing the overall structure and flow of an algorithm, pseudocode
is used for planning and developing algorithms, and code is the actual implementation of an
algorithm in a programming language. Flowcharts are easy to understand and communicate,
but they are not executable.

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

22. What are the design issues of OOP Languages?

 Designing object-oriented programming (OOP) languages involves addressing various issues to
ensure they are efficient, flexible, and maintainable. Here are some key design issues commonly
associated with OOP languages:

 Complexity:
OOP languages can be complex due to features like inheritance, polymorphism, and dynamic
binding.
Ensuring that these features are implemented correctly and intuitively can be challenging.
 Inheritance:
Managing multiple inheritances (where a class can inherit from more than one class) can lead to
complications, such as the diamond problem.
Deciding how to handle method resolution and inheritance hierarchies is a critical design issue.
 Encapsulation:
Balancing encapsulation with the need for flexibility and extensibility can be difficult.
Ensuring that data and methods are adequately protected while allowing necessary access is
essential.
 Performance:
OOP languages may introduce overhead due to features like dynamic method dispatch, object
creation, and garbage collection.
Optimizing performance while maintaining OOP principles can be a design challenge.

 Memory Management:
Automatic memory management (garbage collection) vs. manual memory management.
Ensuring efficient memory usage and preventing issues like memory leaks.

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

23. Explain the following

i. Components of GUI
 Components of GUI (Graphical User Interface):
1. Windows: The main container for GUI components.
2. Menus: Drop-down lists of options, such as File, Edit, and Help.
3. Buttons: Clickable components that perform actions.
4. Labels: Text or image components that display information.
5. Text Fields: Input fields for users to enter text.

ii. Steps for Designing a UI.

 Steps for Designing a UI (User Interface):
1. Define the Purpose: Identify the UI's goal, target audience, and functional requirements.
2. Research and Analysis: Gather data on user behavior, preferences, and pain points through
surveys, interviews, and usability testing.
3. Develop Personas: Create fictional user profiles to guide design decisions and ensure user-
centered design.
4. Create Wireframes: Low-fidelity sketches of the UI layout, navigation, and key elements.
5. Design the Visual Interface: Develop the UI's visual design, including typography, color scheme,
and imagery.

24. Define Operator. Explain the types of operators.

 In the Principles of Programming Language (PPL), an operator is a symbol or keyword that performs
a specific operation on one or more operands
A) Arithmetic Operators
These operators are used to perform basic math operations:
 Addition (+): Adds two numbers.
Ex :-result = 5 + 3 # Output: 8
 Subtraction (-): Subtracts one number from another.
Ex :-result = 10 - 4 # Output: 6
 Multiplication (*): Multiplies two numbers.
Ex :-result = 6 * 7 # Output: 42
 Division (/): Divides one number by another.
Ex :-result = 20 / 4 # Output: 5.0

B) Assignment Operators
These operators are used to assign values to variables:
Assignment (=): Assigns a value to a variable.
Ex :- a = 5 # a is now 5
Add and Assign (+=): Adds a value to a variable and assigns the result
Ex :-a += 3 # Equivalent to: a = a + 3, now a is 8

C) Comparison Operators
These operators are used to compare two values:
 Equal to (==): Checks if two values are the same.
Ex :-result = (5 == 5) # Output: True

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

 Not Equal to (!=): Checks if two values are different.

Ex :-result = (5 != 3) # Output: True
Ex :- result = (5 > 3) and (8 > 6) # Output: True
OR (or): True if at least one condition is true.
Ex :-result = (5 > 3) or (2 > 6) # Output: True

D) Bitwise Operators
These operators work on the bits of a number:
AND (&): Performs bitwise AND.
Ex :-result = 5 & 3 # Output: 1 (0101 & 0011 = 0001) OR (|):
Performs bitwise OR.
python
Ex :-result = 5 | 3 # Output: 7 (0101 | 0011 = 0111)

E) Unary Operators
A unary operator is an operator that operates on a single operand
F) Ternary Operators
A ternary operator, also known as the conditional operator, is a shorthand way of performing a
simple if-else conditional operation in a single line of code
. Ex :- int age = 18; char* result = (age >= 18)

25. Explain the Control structure in detail.

 Control structures determine the flow of a program's execution, allowing it to make decisions,
repeat tasks, and skip over code.
 Types of Control Structures:
1. Sequential: Code executes one statement after another.
2. Conditional (Selection): Code executes different blocks based on conditions.
a. If-Then: Execute code if a condition is true.
b. If-Then-Else: Execute different code blocks based on a condition.
c. Switch (or Case): Execute different code blocks based on the value of a variable.
3. Repetitive (Iteration): Code executes repeatedly while a condition is true.
a. While: Execute code while a condition is true.
b. For: Execute code for a specified number of iterations.
c. Do-While: Execute code once, then repeat while a condition is true.
4. Jump: Transfer control to another part of the program.
a. Break: Exit a loop or switch statement.
b. Continue: Skip to the next iteration of a loop.
c. Return: Exit a function and return to the calling code.
d. Goto: Transfer control to a labeled statement (generally discouraged).

26. Explain the different ways of passing arguments/parameters to a Module.

 Modules, also known as functions or procedures, can receive data through arguments or
parameters. Here are different ways to pass arguments:

1. Positional Arguments
Pass arguments in the order they are defined in the module.
Example: module_name(arg1, arg2, arg3)

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur
 Principle of Programming Language

2. Keyword Arguments
Pass arguments using their keyword names.
Example: module_name(arg1=value1, arg2=value2)

3. Default Arguments
Assign default values to arguments in the module definition.
Example: def module_name(arg1=value1, arg2=value2)

4. Variable-Length Arguments
Pass a variable number of arguments using *args or **kwargs.
Example: def module_name(*args, **kwargs)

5. Passing Arguments by Reference

Pass arguments by reference, allowing the module to modify the original value.
Example: def module_name(arg1) (note: Python passes immutable objects by value, but
mutable objects by reference)

6. Passing Arguments using a Dictionary

Pass arguments as a dictionary using **kwargs.
Example: module_name(**{'arg1': value1, 'arg2': value2})

7. Passing Arguments using a List

Pass arguments as a list using *args.
Example: module_name(*[value1, value2, value3])

Naveen Kumar H N MCA, BEd, KSET,NET Faculty Dept of BCA GFGCE Tumkur