
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

PG Exam 2018 : Computer Science

55 pages, 62 questions, 0 questions with responses, 0 total responses,

Vaibhav Gangurde
KTHM College, Nashik

+Fave Message

Profile Timeline Uploads

Home > u166329 >

Formatting page ...

Total No. of Questions :8] P1801 SEAT No. : [Total No. of Pages :3 [5233] - 1001 M.Sc. COMPUTER SCIENCE CS-101: Principles of Programming Languages (2013 Pattern) (Semester - I) Time : 3 Hours] Instructions to the candidates: 1) Figures to the right indicate full marks. 2) Neat diagram must be drawn whenever necessary. 3) Attempt any five questions. 4) All questions carry equal marks. 5) Assume suitable data, if necessary. Q1) Attempt ALL of the following: [Max. Marks :50 [4+4+2=10] a) Object lifetimes correspond to one of three principal storage allocation mechanisms. List all three mechansisms and explain any one in detail. b) What is short-circuit Boolean evaluation? Why is it useful? c) Name any two languages in each of the following categories: von-neumann and logical. Q2) Attempt ALL of the following: [4+4+2=10] a) Define and explain with example, free union, and discriminated union. b) Define i) fixed stack-dynamic array ii) stack-dynamic array iii) fixed heap-dynamic array iv) heap-dynamic array What are the advantages of each? c) What is the difference between compiler and pre-processor? [5233] - 1001 1 P.T.O.

Related ResPapers
PG Exam 2013 : Computer Science
by ak47147

PG Exam 2018 : Computer Science
by u166329

CIL MT system/IT
by kuldeep58

Exam PG 2020 : Computer Science : Computer Networks
by ajilasuparna

Formatting page ...

u166329 chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: