P. 1
BC0051-System Software Model Question Paper

BC0051-System Software Model Question Paper

|Views: 162|Likes:
Published by Divyaksh Vashishth
BC0051-System Software Model Question Paper
BC0051-System Software Model Question Paper

More info:

Published by: Divyaksh Vashishth on Apr 16, 2013
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





Model Question Paper

Subject Code: BC0051 Subject Name: System Software Credits: 4 Part A (One mark questions)
1. ________ is a program that converts one programming to another programming in other language. A) Language builder B) Language translator C) Language processor D) Language Activity

Marks: 140


will govern the formation of valid statements in the source language.

A) Lexical rules: B) Syntax rules: C) Semantic rules D) Source rules

3._________is the gap between the semantics of programs written in different programming languages A) Specification gap B) Implementation gap C) Execution gap D) Design gap

4. Which of the following step does not belong to interpretation cycle. A) Fetch the statement. B) Translate the statement

C) Analyze the statement and determine its meaning, D) Execute the meaning of the statement. 5. is a program which accepts assembly language program as input and produces its equivalent machine language program as output. A) Data base B) Assembler C) Assembly D) Directives

6. How many kinds of statements are there in assembly program? A) 4 B) 1 C) 2 D) 3

7. An assembly language statement has the following format A) <Opcode> <operand spec>[,<operand spec>..] [Label] B) <operand spec>[,<operand spec>..] [Label] C) [Label] D) [Label] <Opcode>

<operand spec>[,<operand spec>..] <Opcode> <Opcode> <operand spec>[,<operand spec>..]

8. Which of the following is a not a assembly Program statement A. imperative B. Declaration C. assembler Directive D) Data structure

YACC. B) A compiled program is not human readable.9. . A) Linux B) Unix C) Windows D) DOS 11. C) Assembly language is independent of architecture. A) Interpreter B) Assembler C) Analyzer D) Compiler 10. is a __________ system tool program for generating C or C++ code for a parser. D) Compiled programs can only run on computers that have the same architecture as the Computer on which they were compiled. Choose the WRONG statement A) Fortran is a high level language B) Machine language program is a sequence of 1s and 0s C) Programming in Machine language is simpler than high Level language D) High level programming language makes the programming task simple 12. abbreviated from "Yet Another Compiler Compiler". while a compiler produces a program Written in assembly language. Choose the WRONG statement A) An interpreter produces a result from a program. which is a low level language. is a translator which translates the program written in a high level language object language.

During __________ the macro statement is replaced by sequence of assembly statements. 14.__________ is the Lowest-level of Preprocessors A) Lexical Preprocessors B) Analytical Preprocessors C) Semantic Preprocessors D) None of the above 16. A) Interpreter B) Macro C) Source code D) Compiler is a unit of specification for program generation through expansion. is used to combine multiple functions into a single executable module A) Static linking B) Library . A) Expansion B) Macro expansion C) Parameter passing D) Execution 15.13. Which of the following is NOT a intelx86 register A) SI B) DI C) BP D) DP 17.

Which of the following is not a vital step in execution of a program A) Translation B) Linking C) Relocation D) Compiling 21. A) Static linking B) Library C) Relocating D) Loading 19.________ brings the object program into the memory for execution. _______ is a collection of subprograms used to develop software. A) Static linking B) Library C) Relocating D) Loading 20. _______is a computer program that transfers data from offline memory into internal Storage A) Debugger B) Assembler C) Loader D) Compiler .C) Relocating D) Loading 18.

A) Absolute Loader B) Boot strap Loader C) Program Loader D) Retargetable loader 23. The object code or executable code is generated by ________. A) Assembler B) Compiler C) Assembler or compiler D) Assembler and compiler 25. A) stack B) automatic C) dynamic D) static . A) local B) Permanent C) Physical D) Object 24. Loader can replace virtual addresses with _______ addresses. memory is allotted to a variable before the execution of a program begins. _________is a very small program (usually residing in ROM) which reads a fixed location on a disk and passes control over to it.22. In ________ memory allocation.

A) Stack B) Data structure C) Pointer D) Organization .26. A) dynamic B) automatic C) stack D) static 27.________ are established and destroyed during the execution of a program. A) Static B) Stack C) Dynamic D) Automatic 29. Reference counting is a form of ________ memory management where each object has a count of the number of references to it. In dynamic memory allocation. Call-by-value parameter variable belongs to ___________ type of memory allocation. A) Memory bin B) Stack C) Global variable D) Local variable 28. Symbol table is a __________ which is used by compiler to keep track of scope and binding information about names.

Fixed entry elementary symbol table organization contains symbol and ________. Which of the following statement(s) are true? 1. Convenient data structure for symbol tables is a hash table. D) None of the above . 32. C) It is the process of identifying error and also to recover from them. A) 1 only B) 2 only C) Both 1 and 2 D) None of the above. A) Length B) Symbol C) Associated information D) Tree 33.The actions required for the maintenance of a symbol table are: search. enter and ______ A) Store B) Return C) Delete D) List 31.30. What is error handling? A) It is the process of identifying errors in the program B) it is the process of recovering from errors. Symbol table is a compile time data structure 2.

Memory. Dynamic errors can be detected in all languages A) 1 only B) 2 only C) Both 1 and 2 D) None of them 36. Which of the following is a true statement with respect to Dynamic error? 1. D. Which of the following is a true statement with respect to Semantic errors? 1. B) Controls and coordinates the use of the hardware. The error messages should be tasteful and understandable by the user . I/O devices). 35. C) Define the ways in which the system resources are used to solve the computing problems D) All the above . Dynamic error are detected at run time 2. C.34. Which of the following is a Function/s of operating system? A) Provides basic computing resourses (CPU. B. Semantic errors can be detected both at compile time and run time 2. Declaration and scope are common examples for semantic errors A) 1 only B) 2 only C) Both 1 and 2 D) None of them 37. The messages should pinpoint the errors in terms of the original source program. The messages should be specific and should localize the problem The messages should be redundant. Which of the following is NOT a property of good error diagnostics? A.

D. target program (TP). D) Analysis program. Which of the following is NOT a member of UNIX family? A. D) None of the above Part B (Two mark questions) 41. Linux Solaris Irix MacOS 39. B) An operating system that is capable of allowing multiple software processes to run at Same time C) An operating allows multiple users to use same computer at the same time or different Time. Analysis program C) Source program (SP). called ______ A) Source program (SP). Syntax program. . Which of the following Statement is TRUE with respect to Multi threading? A) An operating system that allow different parts of a software program to run Concurrently. B) Syntax program. C. Which of the following is a NOT a Function/s of operating system? A) OS Contains interrupt service routines B) OS deals with Process Management C) OS helps in exchanging information between Processes D) OS alone is responsible for compiling and executing C Program 40.38. called _______ into an equivalent program in the machine or assembly language of the computer system. B. target program (TP). Program translation model bridges the execution gap by translating a program written in a PL.

Lexical analysis Syntax analysis intermediate code generation identifier code optimization logical builder . 2. Program Execution Activities B) Program Generation Activities._______ and ________are the two tasks performed by assembler. Which of the following statement is NOT a purpose of pass-1 for assembler? A) B) C) D) Determine length of machine instructions Generate Instructions Remember values of symbols until pass 2 Process some pseudo-operation 45. Which of the following statement is NOT a phase in compilation? 1. Program Execution Activities 43. Generate object C) Process pseudo-operations. symbolic Optimization 46. Loop Optimization B) Quick Optimization. symbolic Optimization D) Quick Optimization. Process pseudo-operations B) Define symbols._______ and ________are the two types of optimization A) Local Optimization. Two fundamental language processing activities are _______and______ A) Program Processor Activities. Loop Optimization C) Local Optimization. 5. Program Source Activities C) Program Processor Activities. Program Source Activities D) Program Generation Activities. 3. Generate instructions 44. 6. A) Generate instructions.42. Define symbols D) Generate object. 4.

code generation A) 1. A static library is a collection of object files which contain library routines and data. 2. A shared library is a shared object file that contains functions and data. State true or false 1.5 D) 2. If macros are calling themselves.2 B) 4. 3. 2. 4. 5. 6. 2-T . A) 1-F.6 C) 4. 2-F C) 1-T. they are called as _______ A) nested macro calls B) recursive macro calls C) nesting D) macro expansion 48.2 B) 3.7. Which of the following statement does NOT holds good for Macros? 1.6 C) 3.7 Macros simplify coding Macros reduce the amount of repetitive coding Macros reduce errors caused by repetitive coding Macros can have only two parameters Macros cannot be used in C++ programming language Macros make an assembly program more readable.5 D) 2. A) 1.7 47. 2-T B) 1-T. 49.

Loader D) Libraries. compile time B) compile time. 1. the loader can also replace virtual addresses with physical addresses. In computer science. 2. Two types of Dynamic memory allocation are ________ and _________ A) Process control allocation. State true or false. runtime C) compile time. compile time 51.2-F B) 1-T. In addition to copying a program into main memory. A) Memory.2-T C) 1-F. executing time D) executing time.2-F 53. relocation is the process of replacing symbolic references or names of _______ with actual usable addresses in ________ before running a program. A) runtime. Stack allocation . memory 52.D) 1-F. libraries. In dynamic linking the subroutines of a library are loaded into an application program at _____ rather than being linked in at ______ and remain as separate files on disk. 2-F 50. B) Loader. A binary object file is either an executable file that runs on a particular machine or a file containing object code that needs to be linked A) 1-T.2-F D) 1-F. memory C) Memory.

Pointer to Pointer table entry B) Automatic Length representation.2-T C) 1-T.2-F .B) Automatic allocation. Dynamic memory allocation is implemented using stacks and heaps 2.2-T B) 1-F. Compilers use a searching technique called as hashing. 2-T C) 1-T.2-F B) 1-F. program controlled allocation D) Stack allocation. State True or False 1.2-F 55. Pointer to Pointer table entry D) Fixed Length representation. State TRUE or FALSE 1. Hash tables are good in situations where you have enormous amounts of data 2.2-T D) 1-F.2-F D) 1-F. process controlled allocation C) Automatic allocation. In Liner array of record there are two ways to represent names in the symbol table they are __________and_________ A) Automatic Length representation. Memory allocation is the procedure used to perform memory binding. program controlled allocation 54. where a variant called as “Close hashing” is considered. A) 1-T. pointer to symbol table entry 56. A) 1-T. pointer to symbol table entry C) Fixed Length representation.

RTOS is an operating System that guarantees a certain capability within a specified time Constraint 2. 2-T C) 1-T. 2-T B) 1-F. 2. Dynamic errors can be detected only at run time. 2-F 58. 2-F . 2-F D) 1-F.57. 2-T B) 1-F. If the algorithms does not meet the design or incorrect results in error A) 1-T. State TRUE or FALSE 1. 2-T B) 1-F. 2-F 59. The design specifications for the program may be inconsistent or faulty: is a source of error 2. State TRUE or FALSE 1. A compiler can insert errors as it translates the source program into an object program A) 1-T. 2-T C) 1-T. 2-F D) 1-F. Windows 3. 2-F D) 1-F.1 is a example for RTOS A) 1-T. 2-T C) 1-T. State TRUE or FALSE 1.

2-T C) 1-T. State True or False 1. Language Processing = Analysis of Source Program + Synthesis of Target Program. Dynamic errors can be detected only at run time.60. Syntax analysis of declaration statements differs from the Lexical analysis of imperative statements. . c-iv. 2-F Part C (Four mark questions) 61. b-iii. Production is of the form A:: = ß d) Type – 3 Grammars ----A) a-iv. 2-T. Semantic analysis processes the string of tokens built by lexical analysis to determine the statement class. 2-T B) 1-F. State TRUE or FALSE 1. A) 1-T. 4. 2-T. 3-F. c-iii. d-i B) a-ii. 4-F C) 1-F. 3-T. d-ii 62. 4-T . 3-T. c-ii .d-iv D) a-i. 3-F. A compiler can insert errors as it translates the source program into an object program A) 1-T. Match the following a) Type – 0 Grammars b) Type – 1 Grammars c) Type – 2 Grammars ----------i. 2-T. b-i. 4-F D) 1-T. 2-T. Lexical analysis identifies the lexical units in a source statement 3. c-iv. 2-F D) 1-F. Productions of the form ::=ß iii. 2. Productions of the form A::= tB | t \ iv. b-ii. Production has the form Aß::= II.. d-iii C) a-iii. 2. b-i. 4-F B) 1-F.

based upon pioneering research Into Reduced Instruction Set Computing (RISC) at the University of California at Berkeley. b) Assembly language c) Assembler directives d) MASM A) a-iv. fast. 3-T. 2-T. 3. Match the following a) Mnemonic operation codes i. 4-T C) 1-F. Match the following a) Lexical analysis b) Syntax analysis i. d-iii C) a-iii.Carving source program into sequence tokens ii. d-ii 64. b-i. 3-F. 4-T B) 1-F. SPARC stands for Sun Microsystems Processor Architecture 2. b-i. 2-T. b-ii. c-ii . State True or False 1. Its features found in assembly languages for the variety of computer architectures. 3-T. d-i B) a-ii. 4-T D) 1-F. c-iv.d-iv D) a-iii. 3-T. c-i. c-iii. SPARC is a modern. Checks the tokens for patterns permitted .63. instruct the assembler to perform certain actions ii. 4-F 65. 2-F. SPARC was invented in the labs of Sun Microsystems Inc. Low level language. pipelined architecture. 4. Microsoft Macro Assembler iii. 2-T. SPARC is not an open set of technical specifications that any person or company can License and use to develop microprocessors. A) 1-T. b-iv. eliminates the need to memorize numeric operation codes iv.

b-i. A) 1. b-ii. b-iv.d-iv D) a-iii.3. This verification consists primarily of Three types of checks. The JVM verifies all byte code before it is executed.3 B) 1.6 . PICK the statements which belong to this check 1. c-ii . c-iii. b-ii.5 C) 2. 6. Branches are always to valid locations Check the execution of . 2. Improve the target program by a factor of two in overall speed 66. Check for common programmer errors that often lead to data corruption. 4. c-iii. d-iv C) a-iii. d-ii iii.2.jar files Data is always initialized and references are always type-safe Check syntax analyzer to stream of simple instructions Access to "private" or "package" data and methods is rigidly controlled.class or . c-i. 3.C) Code generation D) Code optimization A) a-iv. Converts intermediate code into machine instructions iv. d-i B) a-i.6 D) 4.4.5. 5.

making it similar to a dedicated accumulator register. 3= Macro expander B) 1=compiler. 3= go to Macro call D) 1=assembler. 3= Macro expander C) 1=compiler. b. CX ii. 2=Get next line. All major calculations take place in EAX. BX i. Match the Following a. 3= go to Macro call 68. This register is most useful for storing data related to the accumulator's current calculation. 2=find macro. The Flow chart represents: Design for simple macro assembler Choose the correct statements for the flow chart A) 1=assembler. 2=Get next line. 2=find macro. .67.

c-ii. it is completely free for extra storage space. 2. 2=translator.c-ii.b-ii.d-iv 69. Like the variable i in high-level languages. 3= Loader 70.c. Bootstrapping refers to a process where a simple system activates another more Complicated system that serves the same purpose. 3= Loader B) 1=Loader. The Diagram represents: Conversion from source program to binary program Fill the empty space in the diagram A) 1= Linker. AX iv. Bootstrapping is a solution to the Chicken-and-egg problem of starting a certain system .c-iii.d-iv B) a-iv. 3= Translator D) 1=Translator.b-iii.d-i C) a-iv. DX iii. d. 3= Linker C) 1=Loader. 2=Translator.b-ii. A) a-i. State True or False 1. This register was useful as a pointer.b-iii. 2= Linker.d-iii D) a-i.c-i. 2=Linker. the count register is the Universal loop counter.

2=T. State True or False 1. Java is Object oriented programming Language 3. 3. 2= F 3= F 4=F 72. 3-F. we need to read a decoder for every BFF we want to manipulate 4. 2=T. when developing a machine code manipulation tool. 4-F B) 1-F. Traditionally. 2=F. 3=T. 4-F . 3-F. 4-F C) 1-T. 3=T. Compilers or assemblers typically generate the executable code with zero as Lower most starting addresses. 3. Fortran is an example for dynamic memory allocation 2. 3=F 4=F C) 1=T. 3=F. 2-T. Pascal is an example for static memory allocation 4. 3=F.T C) 1= T. 3=T 4=F B) 1=T. 2-T. In compiler design a boostrap or bootstrap compiler is a compiler that is written in the target Language. 4. The most fundamental functions of a loader are to bring an object program into memory and starting its execution. 2=T.T D) 1= T.T 71. 4. A) 1= F. 2-T. State true or false 1. 4. 2=F.Without the system already functioning. 2= F 3= T 4=F D) 1=T. 4. 3-T. malloc () function is available only in c programming A) 1-F.F B) 1= T. the OS first executes all relevant file information and carries out any necessary actions before putting it into memory A) 1=T. When a program needs to be executed. 2=F. 2. 4. In x86 systems the bootstrap ROM occupies the top 64K of the address space and ROM Code then starts up the computer.

A) 1. 2-T. Garbage collection was invented by John McCarthy around 1959 to solve the problems of manual memory management in his Lisp programming language. 3-T D) 1-F. In the variable length entry. The garbage collector or collector attempts to reclaim garbage. or memory used by Objects that will never be accessed or mutated again by the application.4 C) 1.2. 2. Garbage collection is an internal memory pool created at start-up that tasks use to dynamically allocate memory as needed. which requires the programmer to specify which objects to deallocate and return to the memory system. 2-T. the number of storage units used for the symbol depends on the number of symbols in it. 2. State True or False.3. 1.6 . Garbage collection is often portrayed as the opposite of manual memory management. 3-F B) 1-F. 1.2.3. such as tasks that use wide columns. 4-T 73.4. Find the True statements with respect to garbage collection. 3-F. 5. A length fields in variable length entry is added to the entry in order to indicate how many storage units are required by the symbol. An organization using variable length entries would require more storage than fixed length entries.5 D) 1.3 B) 1. 3. 4.5.D) 1-F. 2-F.2. Garbage collector is used by tasks that require a lot of memory from the stack. 2-F. Garbage collection (GC) is a form of automatic memory management. 3-F 74. 2-F. A) 1-T.3. 3-T C) 1-T.2. 3. 6.4.

Fill in the blanks A) 1-Syntatactic Corrector. 2.Symbol Table. 2-Symbol Table B) 1.parcer analyzer . 2-Symbol Table D) 1-Syntatactic Corrector.Syntatactic Corrector C) 1-parcer analyzer. 2.75.

Key A D A B A B B C C A D B C A D A A A C A Q.B Ans. 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 Part . No. No. Key B B C B B D D D D B C C B B A D A B D D Q. 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 Ans. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Ans.Answer Keys Part – A Q. Key B C D C B B A B D D B A D B A 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 . Key C B C C D B A B B C C C C D A C B D D A Q.C Ans. No. No. Part .

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->