Prep Hub

UGC NET PAPER 2 COMPUTER SCIENCE – SET 47

UGC NET PAPER 2 COMPUTER SCIENCE – SET 47

Period: JUNE 2014


921. of a system is its structure comprising elements, their properties and relationships.

Software Engineering • Architecture • JUNE 2014


922. In function-point analysis, the number of complexity adjustment factors is ___.

Software Engineering • Estimation • JUNE 2014


923. A part-whole relationship where objects represent components of an assembly is ___.

Software Engineering • OO Design: Relationships • JUNE 2014


924. Which is NOT a CMM Level-5 Key Process Area?

Software Engineering • Process Improvement: CMM • JUNE 2014


925. KPA in CMM stands for .

Software Engineering • Process models • JUNE 2014


926. Match these software quality attributes to their definitions: (i) Conformance to requirements (ii) Closeness to true value (iii) Handling invalid inputs (iv) All specified functions implemented → Correctness, Accuracy, Robustness, Completeness

Software Engineering • Quality Attributes • JUNE 2014


927. A software reliability growth model shows 200 initial failures infinite, now 100 remaining. If initial failure intensity is 20 f/hr, current intensity is:?

Software Engineering • Reliability Growth Models • JUNE 2014


928. Which is NOT a risk-management technique for unrealistic schedules/budgets?

Software Engineering • Risk management • JUNE 2014


929. Project function-point count: inputs=50, outputs=40, enquiries=35, files=6, interfaces=4; all complexity factors average. Total FP is:?

Software Engineering • Software Metrics: Function Points • JUNE 2014


930. Software testing is?

Software Engineering • Software Testing • JUNE 2014


931. Regression testing is primarily related to ___.

Software Engineering • Testing • JUNE 2014


932. Which is NOT a valid definition of “error” in software engineering?

Software Engineering • Testing Concepts: Errors vs Faults • JUNE 2014


933. L₁={aⁿbⁿ | n>1}∪{a}, L₂={w C wᴿ}. Which are deterministic?

Theory of Computation • Deterministic Context-Free Languages • JUNE 2014


934. Given grammars G1 and G2 (as shown), which are ambiguous?

Theory of Computation • Grammar Ambiguity • JUNE 2014


935. Match normal forms to grammars: Chomsky (a), Greibach (b), S-grammar (c), LL (d). Answer codes iv–iii–ii–i.

Theory of Computation • Grammar Normal Forms • JUNE 2014


936. Subgraph-isomorphism and set-partition decision problems are ___.

Theory of Computation • Complexity Classes • JUNE 2014


937. Which suffices to convert an arbitrary CFG to LL(1)?

Theory of Computation • Grammar transformation • JUNE 2014


938. A shift–reduce parser suffers from .

Theory of Computation • Parsing • JUNE 2014


939. If L is regular then even(L) (chars in even positions) and Chop(L) (remove first 2 chars) are?

Theory of Computation • Regular Languages: Closure • JUNE 2014


940. In data mining, classification rules are extracted from?

Artificial Intelligence • Data Mining • JUNE 2014



Disclaimer for MCQ Quiz
This quiz is for educational purposes only…

0 0 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
Scroll to Top