GoConqr has a new look! Let us know what you think.

Quiz

Comprehensive Exam Computer Science - 2017

Faheem Ahmed 150 questions 3.0 (1 rating)

Take the quiz

This quiz has a time limit, so it opens in the usual player.

Questions in this quiz (150)

  1. 1Given a binary tree whose inorder and preorder traversal are given by
    Inorder : EICFBGDJHK
    Preorder : BCEIFDGHJK
    The post order traversal of the above binary tree is
    1. AIEFCGJKHDB
    2. BIEFCJGKHDB
    3. CIEFCGKJHDB
    4. DIEFCGJKDBH
  2. 2An all-pairs shortest-paths problem is efficiently solved using
    1. ADijkstra' algorithm
    2. BBellman-Ford algorithm
    3. CKruskal Algorithm
    4. DFloyd-Warshall algorithm
  3. 3Consider the Breshenham’s circle generation algorithm for plotting a circle with centre (0,0) and radius ‘r’ units in first quadrant. If the current point is (x1,y1) and decision parameter is pi then what will be the next point (xi+1,yi+1) and updated decision parameter pi+1 for pi ≥ 0
    1. Axi+1 = xi + 1 yi+1 = yi pi+1 = pi + 4xi + 6
    2. Bxi+1 = xi + 1 yi+1 = yi - 1 pi+1 = pi + 4(xi - yi) + 10
    3. Cxi+1 = xi yi+1 = yi - 1 pi+1 = pi + 4(xi - yi) + 6
    4. Dxi+1 = xi - 1 yi+1 = yi pi+1 = pi + 4xi + 10
  4. 4A point P(5,1) is rotated by 900 about a pivot point (2,2). What is the coordinate of new transformed point P’ ?
    1. A(3,5)
    2. B(5,3)
    3. C(2,4)
    4. D(1,5)
  5. 5Consider a triangle A(0, 0), B(1, 1), C(5, 2). The triangle has to be rotated by an angle of 450 about the point P(-1, -1). What shall be the coordinates of the new triangle?
    1. AA'=(1, √2-1), B'=(-1, 2√2-1), C'=(3√2-1, (9/2)√2-1)
    2. BA'=(1, √2-1), B'=(2√2-1, -1), C'=(3√2-1, (9/2)√2-1)
    3. CA'=(-1, √2-1), B'=(-1, 2√2-1), C'=(3√2-1, (9/2)√2-1)
    4. DA'=(√2-1, -1), B'=(-1, 2√2-1), C'=(3√2-1, (9/2)√2-1)
  6. 6Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper right-hand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates:
    Line AB: A(-6,2) and B(-1,8)
    Line CD: C(-1,5) and D(4,8)
    Line EF: E(-2,3) and F(1,2)
    Which of the following line(s) is/are candidate for clipping?
    1. AAB
    2. BCD
    3. CEF
    4. DAB and CD
  7. 7The Boolean expression x' y' z + y z + x z is equivalent to
    1. Ax
    2. By
    3. Cz
    4. Dx+y+z
  8. 8Match the following:
    (a) Huffman codes (i) O(n2)
    (b) Optimal polygon triangulation (ii) θ(n3)
    (c) Activity selection problem (iii) O(nlgn)
    (d) Quicksort (iv) θ(n)
    Codes:
    (a) (b) (c) (d)
    1. A(i) (ii) (iv) (iii)
    2. B(i) (iv) (ii) (iii)
    3. C(iii) (ii) (iv) (i)
    4. D(iii) (iv) (ii) (i)
  9. 9Which of the following is asymptotically smaller?
    1. Alg(lg*n)
    2. Blg*(lg n)
    3. Clg(n!)
    4. Dlg*(n!)
  10. 10Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined?
    1. A925, 221, 912, 245, 899, 259, 363, 364
    2. B3, 400, 388, 220, 267, 383, 382, 279, 364
    3. C926, 203, 912, 241, 913, 246, 364
    4. D3, 253, 402, 399, 331, 345, 398, 364

Information

Description
ThirdYear Third Year Quiz on Comprehensive Exam Computer Science - 2017, created by Faheem Ahmed on 09/03/2017.
Language
English
Views
755
Rating
3.0 out of 5 · 1 rating
Rate this quiz
Rate this quiz

Feedback

What is it about?

What do you think of the new look?

How do you like it?