IndiaStudyCenter.comWant to join in a course? Need suggestions?
Visit CollegeZones.com
Colleges & Universities | Distance Education | Admission Notifications | Entrance Exams | Course Syllabus | Question Papers
Home / Test Papers / IGNOU / CS02 Introduction to Software
CS02 Introduction to Software June 1998
Ask a question
Print this page
IGNOU CS-02

CS02 Syllabus

CS02 Test Papers

CS02 Assignments

IGNOU MCA

About IGNOU MCA Course

IGNOU MCA Syllabus

IGNOU MCA Assignments

IGNOU MCA Test Papers

IGNOU - BCA

About IGNOU - BCA Course

IGNOU - BCA Syllabus

IGNOU - BCA Assignments

IGNOU - BCA Test Papers

IGNOU Programs

IGNOU

Courses, Admissions & Eligibility

Admission to BA International Hospitality Administration - 2008-09 Session

Admission Procedure & Schedule

Colleges, Faculties & Departments

Who's Who at the University

Re-Admission Procedure

Study Centres in India

Partner Institutions outside India

Syllabus

IGNOU Test Papers (by Course)

IGNOU Test Papers (by Paper code)

Assignments

IGNOU Exam Timetables

Notifications, Circulars & Announcements 2008

Events, Seminars & Workshops

Examination Results

IGNOU Improvement tests

Test Papers / Previous Question Papers of IGNOU CS02 Introduction to Software June 1998

PGDCA / MCA (I Yr) / BCA
Term-End Examination

June, 1998

CS02 : Introduction to Software

Time: 2 hours
Maximum Marks: 60

Note : Question number 1 is cornpulsory. Attempt any three questions from the rest.

1(a) Write a program to generate a prime number.
(b) Give memory partitions of 100 k, 500 k, 200 k, 300 k and 600 k (in order), How would each of First-fit, Best –fit algorithm place process of Ć212 K. 417 k, 112 k and 426 k (in order)? Which algorithm makes the most efficient used of memory?
(c) Consider a logic address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames.
(i) How many bits are there in logical address?
(ii) How many bits are there in the physical address?
(d) Write context free grammar for switch statement in C-language.
(e) Suppose that the head of a moving disk with 200 tracks, numbered 0 to 199 is currently serving a request at track 143 and just finished a request at a track 125. The queue of request is kept in FIFO order : 86, 142, 91, 177, 94, 150, 12, 175 and 130.
What is the total number of head movement needed to satisfy these requests for FCFS scheduling?

2. (a) Discuss the following scheduling with its merits and demerits:
(i) Round Robin
(ii) Shortest job first
(b) Explain the use of Process Control Block (PCB) and discuss its contents.

3. (a) Contrast and explain coalescing and compaction.
(b) What is fragmentation? How does it occur? Discuss memory management schemes with respect to fragmentation.

4. (a) What are typical phases in software development life cycle and its associated development tools?
(b) Comment on software crisis. How can object oriented programming paradigm help solve this crisis ?

5. (a) What is the basic philosophy of X-windows? How is it different from the rest of GUIs?
(b) Discuss the support for object orientation in MS windows and Macintosh.

6. (a) Which type of operating system is the most suitable for the following applications
Sending of e-mail
Scientific calculation at remote machine
(b) Discuss the important features of the following operating systems :
Client/server operating system
Distributed operating system

Most popular pages

Business Schools - Engineering Colleges - Medical & Nursing Admissions - BEd in Distance mode - Journalism & Media Studies - Forensic Science

Search this site

Enter a detailed keyword. Ex: Question Papers of IGNOU MCA Ist Semester