Prep Hub

UGC NET PAPER 2 COMPUTER SCIENCE – SET 32

UGC NET PAPER 2 COMPUTER SCIENCE – SET 32

Period: JUNE 2013


621. Fundamental parameter-passing modes include

Programming Languages • Parameter passing • JUNE 2013


622. Bresenham’s line algorithm is attractive because it uses

Programming Languages • Raster algorithms • JUNE 2013


623. The three golden rules (user control, reduced memory load, consistency) are for?

Software Engineering • HCI / User Interface Design • JUNE 2013


624. ________ is a process model removing defects before hazards.

Software Engineering • Process Models • JUNE 2013


625. Match models: (a) Watson–Felix (b) Quick-Fix (c) Putnam resource allocation (d) Log-Poisson — (i) Failure intensity (ii) Cost estimation (iii) Project planning (iv) Maintenance

Software Engineering • Reliability & Estimation Models • JUNE 2013


626. Software Maturity Index (SMI) stabilizes when?

Software Engineering • Software Metrics (SMI) • JUNE 2013


627. Equivalence partitioning is a ______ testing method.

Software Engineering • Testing Techniques • JUNE 2013


628. Task of correcting and pre-processing data is called

Software Engineering • Data preprocessing • JUNE 2013


629. Repository of information gathered from multiple sources at one site is called

Software Engineering • Data warehousing • JUNE 2013


630. Software safety is a __________ activity that focuses on the identification and assessment of potential hazards.

Software Engineering • Safety assurance • JUNE 2013


631. A PDA is deterministic if δ(q,a,b) has ≤1 move, and if δ(q,λ,b)≠∅ then δ(q,c,b)=∅ for all c∈Σ.

Theory of Computation • Automata theory • JUNE 2013


632. Match grammars to automata: (a) C-sensitive (b) Regular (c) C-free (d) Unrestricted — (i) DFA (ii) PDA (iii) LBA (iv) TM

Theory of Computation • Automata theory • JUNE 2013


633. A file of 100 000 chars over {g–l} with frequencies 45k,13k,12k,16k,9k,5k can be Huffman-coded into approximately

Theory of Computation • Coding & compression • JUNE 2013


634. s₁: CSL closed under intersection, concatenation, substitution, inverse homomorphism. s₂: CFL closed under complementation, substitution, homomorphism.

Theory of Computation • Formal languages • JUNE 2013


635. Horn clauses are propositions with________.

Theory of Computation • Logic programming • JUNE 2013


636. α–β cutoffs are applied to ________

Artificial Intelligence • Adversarial search • JUNE 2013


637. Which is not part of an expert system shell?

Artificial Intelligence • Expert systems • JUNE 2013


638. Given fuzzy A and B, A∧B is ________

Artificial Intelligence • Fuzzy sets • JUNE 2013


639. Support of fuzzy A={x1:0.2,x2:0.15,x3:0.9,x4:0.95,x5:0.15} is ________

Artificial Intelligence • Fuzzy sets • JUNE 2013


640. Perceptron weight update rule is ________

Artificial Intelligence • Perceptron learning • JUNE 2013



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