ISRO CSE 2018 PYQ ⋆ CSE Study247

ISRO CSE 2018 PYQ

Questions 56-60 of 80

0% completed (0/80 answered)

Question 56

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2018 PYQ

The Function Point (FP) metric is

A Calculated from software complexity assessment B Calculated from lines of code C Calculated from user requirement D None of the above

📘 Detailed Solution

Key Concepts

• Definition: Developed by Allan J. Albrecht at IBM, Function Points (FPs) measure the functional size of a software system from the user's point of view. It serves as a normalization metric that remains completely independent of programming language or lines of code (LOC).

JAVASCRIPT

• Derivation Formula: Function points are calculated by measuring the software's information domain characteristics (External Inputs, External Outputs, External Inquiries, Internal Logical Files, and External Interface Files) derived from user requirements.
• Complexity Assessment: Each of these components is evaluated and weighted according to its technical complexity (Simple, Average, or Complex). The total unadjusted count is then multiplied by a Value Adjustment Factor (VAF) derived from 14 general system complexity characteristics (such as data communications, distributed performance, and processing complexity).
Because the final FP value relies heavily on mapping components to their respective complexity matrices and adjusting via overall system characteristics, standard examination keys (like ISRO and UGC NET) officially recognize it as being calculated from a software complexity assessment.

Question 57

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2018 PYQ

The lowest degree of cohesion is

A Logical Cohesion B Coincidental Cohesion C Procedural Cohesion D Communicational Cohesion

Question 58

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2018 PYQ

What is the outputof the following program?

main(){
int x = 2, y = 5;
if(x < y) return (x = x + y);
else printf("z1");
prinf

A z2 B z1z2 C Compilation error D None of these

Question 59

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2018 PYQ

Periodically collecting free memory space to form contiguous block is called

A Concatenation B Garbage collection C Collision D Dynamic Memory Allocation

Question 60

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2018 PYQ

Consider the following program

main()
{
int x = 1;
printf("%d",(*char(char*)&x));
}
Assuming required header files are included and if the machine in which this program is executed is littleendian, then the output will
be

A 0 B 1 C 99999999 D unpredictable

📘 Solution & Detailed Explanation

🔢 Step-by-Step Solution

Step-by-Step Explanation

Integer Representation in Memory:
The variable x is an integer initialized to 1. In a standard 32-bit (4-byte) system, the binary representation of 1 is:
00000000 00000000 00000000 00000001

CODE

Little-Endian Storage:
On a little-endian machine, the least significant byte (LSB) is stored at the lowest memory address (the starting address), while the most significant bytes are stored at higher addresses.
Therefore, the bytes of x are arranged sequentially in memory starting from address &x as:
	• &x (Lowest address): 00000001 (Hex: 0x01)
	• &x + 1: 00000000 (Hex: 0x00)
	• &x + 2: 00000000 (Hex: 0x00)
	• &x + 3: 00000000 (Hex: 0x00)

CODE

Pointer Typecasting and Dereferencing:
	• The expression (char *)&x takes the address of the integer x and typecasts it into a character pointer (char *). A character pointer reads memory byte-by-byte (1 byte at a time).
	• Dereferencing this character pointer via *(char *)&x fetches only the single byte located at the base address &x.
	• As determined above, the byte stored at the lowest address &x is 0x01 (decimal 1).

Final Output:
The value passed to printf("%d", ...) is 1, so the program outputs 1.