First Semester
MIT - 101
MIT - 103
MIT - 104
MIT - 105
MIT - 106
MIT - 107
MIT - 108
Second Semester
MIT - 201
MIT - 202
MIT - 203
MIT - 204
MIT - 205
MIT - 206
MIT - 207
MIT - 208
Third Semester
MIT - 301
MIT - 302
MIT - 303
MIT - 304
MIT - 305
MIT - 306
MIT - 307
MIT - 308
Fourth Semester
|
Time: 3hrs Max. Marks: 75 Attempt any five questions. All questions carry equal marks
- Question
- Explain the various application Domains.
- Expalin the various programming methodologies.
- Explain the following: -
- Orthogonality.
- Generality.
- Reliability.
- Question
- Explain the ambiguity in BNF Grammer.
- What is the difference between Syntax and Semantics?
- Prove that the following program is correct: -
{n = 0}
count = n;
sum = 0;
while count <> 0 do
sum = sum + count;
count = count - 1;
end
{sum = 1 + 2 + ... + n}
- Question
- Explain the various iterative statements available in different programming languages.
- Explain the general data types available in various Programming Language.
- What is the meaning of recursion? How is it implemented?
- Question
- What is binding and Binading time?
- What is storage binding? Explain the advantages and Disadvantages of storage binding.
- What is the concept of function overloading.
- Question
- Explain the various parameter passing mechanisms available. Give pros & cons.
- Explain the pointer data type. What is the problems related to pointers? Give solution also.
- Question
Write down short notes on: -
- Parsing Techniques.
- Type compatibility.
- Attributes of a variable.
- User Defined Ordinal Types.
- Slices & Associative Array.
- Question
- Explain the concept of abstraction.
- What are static and dynamic ancestors of subprogram?
- What is the meaning of referencing environment for a statement?
- Question
- What are the basic features of Object Oriented Programming?
- Explain the following (Any two):
- Deadlock.
- Coroutines VS Conventional Subprogram
- Functional Programming.
- Basic Elements of Prolog.
|