Course Name : Principles of Programming language


--ooOoo-- RRCode No: RR310505 SET-1 B.Tech III-I Semester Examinations, December – 2011



Download 0.67 Mb.
Page4/5
Date28.01.2017
Size0.67 Mb.
#9067
1   2   3   4   5

--ooOoo-- RRCode No: RR310505 SET-1

B.Tech III-I Semester Examinations, December – 2011

PRINCIPLES OF PROGRAMMING LANGUAGES

(COMPUTER SCIENCE AND ENGINEERING)

Time: 3 hours Max. Marks: 80

Answer any five questions

All questions carry equal marks

---

1.a) Describe narrowing and widening conversion.

b) Explain the concept of late binding and early binding. [8+8]

2. Discuss different types of assignment statements. With lucid examples explain mixed mode assignment. [16]

3.a) Discuss the design issues of sub programs.

b) Write about overloaded subprograms.

c) What are coroutines? [16]

4.a) Discuss the Object oriented programming features supported in small talk.

b) What is meant by subprogram level concurrency? Explain. [8+8]

5. What is an exception? Explain exception propagation and handling in C++. [16]

6.a) Write about functions in ML and Haskell.

b) Discuss the data types supported in Python. [8+8]

7. A programming language can be compiled or interpreted. Give relative advantages and disadvantages of compilation and interpretation. Give examples of compiled and interpreted languages. [16]

8. How do you describe the meaning of program using operational semantics? Explain with suitable examples and compare it with denotational semantics. [16]



--ooOoo-- RRCode No: RR310505 SET-2

B.Tech III-I Semester Examinations, December – 2011

PRINCIPLES OF PROGRAMMING LANGUAGES

(COMPUTER SCIENCE AND ENGINEERING)

Time: 3 hours Max. Marks: 80

Answer any five questions

All questions carry equal marks

---

1.a) Discuss the design issues of sub programs.

b) Write about overloaded subprograms.

c) What are coroutines? [16]

2.a) Discuss the Object oriented programming features supported in small talk.

b) What is meant by subprogram level concurrency? Explain. [8+8]

3. What is an exception? Explain exception propagation and handling in C++. [16]

4.a) Write about functions in ML and Haskell.

b) Discuss the data types supported in Python. [8+8]

5. A programming language can be compiled or interpreted. Give relative advantages and disadvantages of compilation and interpretation. Give examples of compiled and interpreted languages. [16]

6. How do you describe the meaning of program using operational semantics? Explain with suitable examples and compare it with denotational semantics. [16]

7.a) Describe narrowing and widening conversion.

b) Explain the concept of late binding and early binding. [8+8]

8. Discuss different types of assignment statements. With lucid examples explain mixed mode assignment. [16]



--

B.Tech III-I Semester Examinations, December – 2011

PRINCIPLES OF PROGRAMMING LANGUAGES

(COMPUTER SCIENCE AND ENGINEERING)

Time: 3 hours Max. Marks: 80

Answer any five questions

All questions carry equal marks

---

1. What is an exception? Explain exception propagation and handling in C++. [16]

2.a) Write about functions in ML and Haskell.

b) Discuss the data types supported in Python. [8+8]

3. A programming language can be compiled or interpreted. Give relative advantages and disadvantages of compilation and interpretation. Give examples of compiled and interpreted languages. [16]

4. How do you describe the meaning of program using operational semantics? Explain with suitable examples and compare it with denotational semantics. [16]

5.a) Describe narrowing and widening conversion.

b) Explain the concept of late binding and early binding. [8+8]

6. Discuss different types of assignment statements. With lucid examples explain mixed mode assignment. [16]

7.a) Discuss the design issues of sub programs.

b) Write about overloaded subprograms.

c) What are coroutines? [16]

8.a) Discuss the Object oriented programming features supported in small talk.

b) What is meant by subprogram level concurrency? Explain. [8+8]



Tutorial Sheet


Unit-I

Date:__Quick_Test_Topics__Date'>Topics Revised

Date:

Quick Test Topics

Date:

Case Study Discussed

Date:



Unit-II

Topics Revised

Date:

Quick Test Topics

Date:

Case Study Discussed

Date:




Unit-III

Topics Revised

Date:

Quick Test Topics

Date:

Case Study Discussed

Date:




Unit-IV

Topics Revised

Date:

Quick Test Topics

Date:

Case Study Discussed

Date:




Unit-V

Topics Revised

Date:

Quick Test Topics

Date:

Case Study Discussed

Date:

TOPICS BEYOND SYLLABUS



Unit – 1

1.




2.




3.




4.




Unit – 2

1.




2.




3.




4.




Unit – 3

1.




2.




3.




4.





Unit – 4

1.




2.




3.




4.




Unit – 5

1.




2.




3.




4.




5.







ASSESMENT OF LEARNING OBJECTIVES AND OUT COMES: DIRECT
Blooms Taxonomy:

LEVEL 1

REMEMBERING

Exhibit memory of previously learned material by recalling facts, terms, basic concepts, and answers

LEVEL 2

UNDERSTANDING

Demonstrate understanding of facts and ideas by organizing, comparing, translating, interpreting, giving descriptions, and stating main ideas.

LEVEL 3

APPLYING

Solve problems to new situations by applying acquired knowledge, facts, techniques and rules in a different way

LEVEL 4

ANALYZING

Examine and break information into parts by identifying motives or causes. Make inferences and find evidence to support generalizations.

LEVEL 5

EVALUATING

Present and defend opinions by making judgments about information, validity of ideas, or quality of work based on a set of criteria.

LEVEL 6

CREATING

Compile information together in a different way by combining elements in a new pattern or proposing alternative solutions.



Marks'>S.No.

Hall Ticket

Number

I-Internal

Marks

Assignment

Marks

Remarks &

Blooms Taxonomy Assessment

II-Internal

Marks

Assignment

Marks

Remarks &

Blooms Taxonomy Assessment

Avg.

Marks

1

























2

























3

























4

























5

























6

























7

























8

























9

























10

























11

























12

























13

























14

























15

























16

























17

























18

























19

























20

























21

























22

























23

























24

























25

























26

























27

























28

























29

























30

























31

























32

























33

























34

























35

























36

























37

























38

























39

























40

























41

























42

























43

























44

























45

























46

























47

























48

























49

























50

























51

























52

























53

























54

























55

























56

























57

























58

























59

























60




























Download 0.67 Mb.

Share with your friends:
1   2   3   4   5




The database is protected by copyright ©ininet.org 2024
send message

    Main page