Members Bookmarks Fresher Jobs Funny Pictures MCA Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

Paid Surveys


website counter



Download Model question papers & previous years question papers

Posted By: jegadesh       Member Level: Gold       Posted Date: 08 Dec 2007

2007 Anna University B.E Computer Science CS1203 – SYSTEM SOFTWARE Question paper



Course: B.E Computer Science   University: Anna University





B.E./B/Tech. DEGREE EXAMINATION, MAY/JUNE 2007
Third Semester
Computer Science and Engineering
CS1203 – SYSTEM SOFTWARE
(Common to Information Technology and B.E. (Part – Time) Second Semester
Regulation 2005)
(Regulation 2004)
Time: Three hours Maximum: 100 Marks
Answer ALL questions
PART A – (10 ´ 2 = 20 marks)
1. Define upward compatibility in systems.
2. Distinguish between direct addressing and indirect addressing.
3. Consider the following sequence
X EQU Y
Y EQU Z
Z RESW I
Is a two pass assembler can resolve such a sequence of definition? Justify your
answer.
4. What is the data structure used to organize the symbol table and operation code
table in a simple assembler? Why it is preferred?
5. What are the advantages of dynamic linking?
6. What is the function of pass 2 of a loader?
7. What is the use of DEFTAB (Definition table) NAMTAB (Name table) and
ARGTAB (Argument table) in macro processor?
8. What is the purpose of conditional compilation statement in ANSI C
preprocessor?
9. What are the tasks performed by document editing process?
10. How the mapping of view buffer to a window is done?
PART B – (5 ´ 16 = 80 marks)

11. (a) (i) Explain the SIC machine architecture. (8)
(ii) Write a sequence of instructions for SIC to set
VAL 1 = VAL 2 + INCR ­
2
VAL 3 = VAL 4 + INCR – 2
Illustrate how the same calculation could b performed on SIC/XE.
Or
(b) (i) Explain the SIC/XE machine architecture.
(ii) The variables V1, V2 and V3 are assumed as an array of 100 words
each. Write a sequence of instructions for SIC to add together the
corresponding elements of V1, V2 and store in V3.
12. (a) (i) Write the algorithm for Pass 1 assembler. (10)
(ii) Explain program relocation with example (6)
Or
(b) Explain in detail about the machine independent features of assembler.(16)
13. (a) Explain the design of relocating loader with an example.
Or
(b) Write short notes on:
(i) Linkage editor. (8)
(ii) Dynamic linking (8)
14. (a) (i) Explain with an example how macro processor allows the ;invocation of
macro with in macro. (8)
(ii) Discuss the macro processing features of ANSI C programming
language. (8)
Or
(b) Explain the various machine independent features of Macro processor in
Detail . (16)
15. (a) (i) Explain the various types of user inter faces. (8)
(ii) Discuss the nature of the user interface for an interactive debugger.(8)
Or


(b) (i) Explain the structure of a text editor. (10)
(ii) Explain the important functions of an interactive debugging system.
(6)
*****





Return to question paper search

Next Question Paper: CS1204 – OBJECT ORIENTED PROGRAMMING

Previous Question Paper: CS1203 – SYSTEM SOFTWARE

Related Question Papers:


  • EC1203-ELECTRONIC CIRCUITS -I


  • 2007 Anna University B.E Electrical and Electronics ELECTROMAGNETIC THEORY-EE1201 NOV./DEC.'07 Question paper


  • IT1008 - SOFTWARE TESTING


  • CS 1351 ARTIFICIAL INTELLIGENCE


  • Mathematics-III


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.


    Contact Us    Privacy Policy    Terms Of Use   

    SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.