CG (MCQs) - Oct 31, 2020

   

SRI LAKSHMI COLLEGE OF ARTS AND SCIENCE

DEPARTMENT OF COMPUTER SCIENCE

III B. Sc., (CS)

COMPUTER GRAPHICS (BECS54B) – MCQs – Oct 31, 2020

CG-MCQ4

(01) In Liang - Barsky Line Clipping Algorithm when P_k < 0 then

(A) Line proceeds from outside to inside

(B) Line proceeds from inside to outside

(C) Line lies parallel to clipping boundary

(D) line lies completely outside the boundary

(02) Which of the logical input device specifies picture component selection?

(A) STRING                                                        (B) CHOICE

(C) VALUATOR                                                (D) PICK

(03) Mouse, Joystick, Trackball, Spaceball, etc., are examples of

(A) VALUATOR                                                (B) LOCATOR

(C) STRING                                                        (D) CHOICE

(04) Style, Color & Pattern are the attributes of

(A) Line                                                               (B) Area

(C) Text                                                               (D) Marker

(05) The transformation technique which is used to resize the object is

(A) Translation                                                   (B) Scaling

(C) Shearing                                                        (D) Rotation

<<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>

Answers for Oct 30, 2020 (CG – MCQ3)

(01) D                   (02) A                   (03) D         (04) A         (05) A

  

SOFTWARE ENGINEERING (MCQs): Oct 31, 2020

 

 SRI LAKSHMI COLLEGE OF ARTS & SCIENCE

DEPARTMENT OF COMPUTER SCIENCE

III B. Sc., CS

SOFTWARE ENGINEERING (BSCS55) – MCQs – 31/10/2020

 SE – MCQ3

(01) SQA checks the

(A) ongoing software                                          (B) developed software

(C) malicious software                                        (D) undeveloped software

(02) In general, the number of cost drivers in COCOMO is

(A) 13                                                                            (B) 14

(C) 15                                                                            (D) 16

(03) What is the most common measure for correctness?

(A) Defects per KLOC                                                 

(B) Errors per KLOC

(C) $ per KLOC

(D) Pages of documentation per KLOC

(04) In "Use Cases", the user of the system is referred to as

(A) Client                                                                      (B) User

(C) Actor                                                                       (D) Developer

(05) Which of the following do not come under Black Box Testing?

(A) Control Flow Testing                                                      

(B) Equivalence Path Testing

(C) Boundary Value Analysis Testing                                  

(D) Decision Table Testing

<<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>

Answers for Oct 28, 2020 (SE – MCQ2)

(01) D                   (02) B                   (03) A         (04) A         (05) B

 

DAA - MCQs - Oct 31, 2020

   

 

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE

II B. Sc., CS

DESIGN & ANALYSIS OF ALGORITHMS (BSCS33) – MCQs – 31/10/2020

 DAA – MCQ5

(01) If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

(A) we will get a different spanning tree.

(B) we will get the same spanning tree.

(C) spanning will have less edges.

(D) spanning will not cover all vertices.

(02) Which sorting algorithm is the best if the list i     s already in order?

(A) Quick sort                                                     (B) Merge sort

(C) Insertion sort                                                 (D) None of these

(03) How many distinct binary search trees can be formed which contains the integers 1, 2, 3?

(A) 6                                                                     (B) 5

(C) 4                                                                     (D) 3

(04) Find the odd out:

(A) Prim's Minimal Spanning Tree Algorithm

(B) Kruskal's Minimal Spanning Tree Algorithm

(C) Floyd-Warshall's All pair shortest path Algorithm

(D) Dijkstra's Minimal Spanning Tree Algorithm

(05) Which data structure allows deleting data elements from the front and adding at the back?

(A) Stack                                                             (B) Queue

(C) Binary-search tree                                         (D) Map

 <<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>

Answers for Oct 30, 2020 (DAA – MCQ4)

(01) D                   (02) B                   (03) C         (04) C         (05) A

SOFTWARE ENGINEERING (MCQs): Oct 30, 2020

  

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE
III B. Sc., (CS)

SOFTWARE ENGINEERING (BSCS55) – MCQs – Oct 30, 2020

 

**** Click for MCQs.... ****

CG (MCQs): Oct 30, 2020

  

SRI LAKSHMI COLLEGE OF ARTS AND SCIENCE

DEPARTMENT OF COMPUTER SCIENCE

III B. Sc., (CS)

COMPUTER GRAPHICS (BECS54B) – MCQs – Oct 30, 2020

CG-MCQ3

(01) Which of the following points lies on the same sde of origin with reference to line 3x + 7y = 2?

(A) (3, 0)                                                              (B) (1,0)

(C) (0.5,0.5)                                                                   (D) (0.5,0)

(02) A point P (5,1) is rotated by 90º about a pivot point (2,2). What is the new transformation point ?

(A) (3,5)                                                               (B) (5,3)

(C) (2,4)                                                               (D) (1,5)

(03) Shearing is also termed as

(A) Selecting                                                        (B) Sorting

(C) Scaling                                                           (D) Skewing

(04) The logical ___ of the endpoint codes determines if the line is completely inside the window

(A) AND                                                                        (B) OR

(C) NOT                                                                        (D) NOR

(05) Consider a line AB with A(0,0) and B(8,4). Apply a simple DDA algorithm and compute the first four plots on the line

(A) (0,0) (1,1) (2,1) (3,2)

(B) (0,0) (1,1.5) (2,2) (3,3)

(C) (0,0) (1,1) (2,2.5) (3,3)

(D) (0,0) (1,2) (2,2) (3,2)

<<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>

Answers for Oct 29, 2020 (CG – MCQ2)

(01) B                   (02) C                   (03) D         (04) D         (05) B

  

DAA - MCQs - Oct 30, 2020

  

 

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE

II B. Sc., CS

DESIGN & ANALYSIS OF ALGORITHMS (BSCS33) – MCQs – 30/10/2020

 DAA – MCQ4

(01) Which of the following is not applicable for binary search?

(A) To find the lower/upper bound in an ordered sequence

(B) Union of intervals                                         (C) Debugging

(D) To search in unordered list

(02) Binary Search can be categorized into which of the following?

(A) Brute Force technique                                   (B) Divide and conquer

(C) Greedy algorithm                                         (D) Dynamic programming

(03) Given an array arr = {15,66,177,288,939} and key = 288; How many iterations are done until the element is found by using Binary Search?

(A) 4                                                                     (B) 3

(C) 2                                                                     (D) 1

(04) Which of the following algorithm does not divide the list?

(A) Merge Sort                                                    (B) Binary Search

(C) Linear Search                                                         (D) Quick Sort    

(05) The following sorting algorithms maintain two sub-lists, one sorted and one to be sorted:

1. Selection Sort            2. Insertion Sort            3. Merge Sort

(A) 1 and 2 only                                                  (B) 3 only

(C) 1, 2 and 3                                                      (D) 1 and 3 only

 <<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>

Answers for Oct 29, 2020 (DAA – MCQ3)

(01) A                   (02) C                   (03) D         (04) B         (05) A