Scribd
Upload
20 views2 pages

PPL QB Int 24-25

The document outlines a question bank for an internal PPL exam covering chapters 1 to 3. It specifies the paper pattern, allowing students to attempt any 5 out of 8 questions, each worth 4 marks, totaling 20 marks. The questions range from explaining programming concepts, memory allocation, and inheritance to specific programming tasks and definitions.

Uploaded by

yash borkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views2 pages

PPL QB Int 24-25

The document outlines a question bank for an internal PPL exam covering chapters 1 to 3. It specifies the paper pattern, allowing students to attempt any 5 out of 8 questions, each worth 4 marks, totaling 20 marks. The questions range from explaining programming concepts, memory allocation, and inheritance to specific programming tasks and definitions.

Uploaded by

yash borkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

PPL Question bank Internal I

Syllabus: chap1, chap2 , Chapter 3

Paper pattern:

Attempt any 5 out of 8 each carry 4 marks.

Total marks: 20

1. Explain two unconventional compilers (Hint: C, C++).


2. Show IEEE floating point standard with precision?
3. Explain the Programming language spectrum.
4. What are the attributes of programming languages?
5. Explain memory allocation / storage allocation (Hint: Explain 3 allocations in detail).
6. What is Stack based allocation?
Hint:
(i) sp
(ii) fp
(iii) Temporaries
(iv) Local variables
(v) Book keeping info
(vi) Return address
(vii) Arguments and list
7. Explain the distinction between decisions that are bound statically and those that are bound
dynamically.
8. What is the advantage of binding things as early and delaying or late bindings?
9. What are internal and external fragmentations?
10. Trace the output:
main()

{
F(1);

return 0;

F(int n)

{
printf (n);
if(n<=100)
F(3Xn-1);
printf(n);
}
Hint: See the Tracing below:
Fig. 2.26
11. Using all 4 types of scope rules try to find output for following code,
n : integer – – global declaration
procedure first
n := 14.
procedure second
n : integer – – local declaration
first()
n := 28.
if read integer() > 0
second()
else
first()
write integer(n)
12. Explain issues for initialization and finalization.
13. Explain inheritance and its types .Explain multiple inheritance with implementation.
14. Explain actual parameters, formal parameters and keyword parameters.
15. Differentiate between replicated and shared inheritance with proper example.
16. Explain malloc and calloc with example.
17. Write a short note on: (i) Encapsulation, (ii) Polymorphism.
18. What is dangling pointer? What is the solution to dangling pointer problem? Explain in
detail.
19. What is heap management? How it is done?
20. Explain the Discriminated versus free unions.Explain difference between structure and
union.
21. Explain character string length options in details.
22. What is array slice? Explain Design issues of arrays. Explain the different array types.
23. What are the different Primitive data Types?
24. What are the different non-Primitive data Types?
25. Define precedence, associativity, orthogonality.

You might also like