GATE CSE 2014 Set 2 | Software Engineering Question 9 | Software Engineering

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-0.3

Which one of the following is TRUE?

The requirements document also describes how the requirements that are listed in the document are implemented efficiently.

Consistency and completeness of functional requirements are always achieved in practice.

Prototyping is a method of requirements validation.

Requirements review is carried out to find the errors in system design.

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.3

In the context of modular software design, which one of the following combinations is desirable?

High cohesion and high coupling

High cohesion and low coupling

Low cohesion and high coupling

Low cohesion and low coupling

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Match the following:
$$1)$$ Waterfall model
$$2)$$ Evolutionary model
$$3)$$ Component-based software engineering
$$4)$$ Spiral development

$$a)$$ Specifications can be developed incrementally
$$b)$$ Requirements compromises are inevitable
$$c)$$ Explicit recognition of risk
$$d)$$ Inflexible partitioning of the project into

$$1 - a,\,\,2 - b,\,\,3 - c,\,\,4 - d$$

$$1 - d,\,\,2 - a,\,\,3 - b,\,\,4 - c$$

$$1 - d,\,\,2 - b,\,\,3 - a,\,\,4 - c$$

$$1 - c,\,\,2 - a,\,\,3 - b,\,\,4 - d$$

GATE CSE 2011

MCQ (Single Correct Answer)

-0.3

Which of the following is NOT desired in a good Software Requirement Specifications $$(SRS)$$ document?

Functional Requirements

Non Functional Requirements

Goals of Implementation

Algorithms for software Implementation

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory