Sikkim-Manipal University of Health Medical and Technological Sciences (SMUHMTS) 2008-3rd Sem M.C.A - SYSTEM PROGRAMMING - Question Paper

Qs two the Von Neumann architecture is a computer design model that uses a ---------- & ------------to hold --------- & ----------.
1. Data & instruction, storage structure & processing unit
2. Knowledge & data, cpu speed & Structure
3. Storage structure & processing unit, data & instruction,
4. Data & instruction, Knowledge & data,

Qs 3. Cisc supports extensive manipulation of _____level computational elements & events such as ____, ____ &____.

1. Low, Memory, Binary arithmetic & addressing.
2. High, Memory, binary arithmetic & addressing.
3. Middle, Memory, binary arithmetic & addressing.
4. None of the Above

Qs 4. Risc or decreased instruction_______. Is a kind of_________ architecture that utilizes a small, ________set of instruction rather than a more _______of instructions often obtained in other kind of architecture

1.Set computer, microprocessor, highly optimized, specialized set.
2 Specialized set, microprocessor, highly optimized, Set computer,
3 Set computer, microprocessor, specialized set, highly optimized,
4 None of the above

Qs 5. . ---------- is the process of anlazing a sequence of -------- to determine its grammatical structure with respect to a provided -----------. A parser is the component of a --- that carries out this task.
1. parsing , tokens , formal grammer, compiler
2. compiling , keywords , grammer , assembler
3. parsing , keywords, grammer, assembler
4. parsing, tokens, grammer, assembler

Qs 6.-------- is the process of replacing symbolic references or names of libraries with true usable addresses in memory before running a program. It is done by -------- during -----------although if can be done at run-time by a -------.
1. parsing, loader, linker, loader
2. relocation, linker ,loader, compilation
3. relocation, linker , compilation , loader
4. loading , loader, parsing , compiler
Qs 7. Match the register names and their meanings
Column A Column B

1. AX - stack pointer
2. DX - base pointer
3. BP - base register
4. SP - accumulator register
- Destination index
- addition register
Qs 8. SP-ESP is the sacred stack pointer. With the important ---- , ----- , -------- and ------- instructions requiring its value.
1. front , rear, push, pop
2. push , pop , call and Ret
3. clear, push, pop, call
4. pop, clear, call, ret

Qs 9. An ---------- is a program which accepts assembly language program as input and produces its equivalent ------------as output along with info for the loader. The input to the assembler program is called -------- and the output is called the ----------
1.compiler, machine language program, object program, source program.
2. assembler, machine language program, source program, object program.
3. linker, machine language program, source program, object program.
4. loader, machine language program, source program, object program.

Qs 10. Bootstraping can also refer to the development of successively more --------,------ The simplest environment will be perhaps , a very basic ---------and an ------------program.

1. complex, faster programming environment, text editor, assembler
2. simple, faster programming environment, text editor, linker
3. complex , slow programming environment, text editor, loader
4. complex, avg. programming environment, text editor, linker
Qs 11. code optimization is an optional phase designed to improve the ---------code so that the ultimate object program runs ------and takes --------- space. Its output is a different intermediate code program that does the identical job as the original, but perhaps in a way that saves time and space.
1. intermediate, faster, less, time and space
2. program, slow, more, time and space
3. complex , faster, more , time and space
4. more, faster ,program, time / space
Qs 12. The bookkeeping portion of the ----- keeps track of the names used by the program and records essential info about every such as its--------------
The ---------- used to record this info is called ----------
1. compiler, kind (Int. Real), MOT
2. compiler, kind (int ,real), data structure, symbol table
3. linker, datatype, structure, table
4. loader, datatype, strucuture, symbol table.
Qs 13. the lexical analyzer is the interface ranging from ------- and -----------. The lexical analyzer reads the ------- program 1 character at a time, carving the source program into a sequence of characters that can be treated as a single logical entity. Identifiers, keywords, constants, operators, and punctuation symbols such as commas, and parentheses are typical-------.

1. object code , compiler, source, tokens
2. source program , compiler , source , tokens
3. keywords , source code, object , tokens
4. source code, object code, keywords, tokens
QS 14. Match the column A with column B
Column A Column B

(1.) FSM - (a) situation free grammer
(2.) HTA – (b) Natural Language processing
(3.)NLP - (c) Hierchical Task Analysis
(4.) CFG - (d) Finite state machine
1. (1)-d,(2)-c,(3)-b,(4)-a
2. (1)-a,(2)-c,(3)-b,(4)-d
3. (1)-d,(2)-b,(3)-c,(4)-a
4. (1)-b,(2)-c,(3)-d,(4)-a

Qs 15. A -------- is a set of computer software programs and data structure which implements a specific--------. This model accepts a form of computer intermediate language , commonly referenced to as---------, which conceptually represents the instruction set of stack-oriented capability architecture. This code is generated by ---------language compilers.

1. JVM, model, byte, C++
2. JVM, virtual machine model, java byte code, Java
3. FSM, virtual machine model, byte, VB
4. FSM, virtual machine model, java byte code, Java

Earning:   Approval pending.