Self Studies

Computer Science Test - 4

Result Self Studies

Computer Science Test - 4
  • Score

    -

    out of -
  • Rank

    -

    out of -
TIME Taken - -
Self Studies

SHARING IS CARING

If our Website helped you a little, then kindly spread our voice using Social Networks. Spread our word to your readers, friends, teachers, students & all those close ones who deserve to know what you know now.

Self Studies Self Studies
Weekly Quiz Competition
  • Question 1
    2 / -0.66

    Consider the processor of a supercomputer which can support a maximum memory of 512 TB. Assume that memory is word addressable and a word consists of 32 bytes. The size of the address bus of the processor is at least _____ bits.

    Solution

    1 word = 32 bytes = 25

    1 Terabyte = 240

    Main Memory Size =  TB

    = 29 × 240 B

    = 24 × 25 × 240 B

    = 244 W 

    ∴ size of the address bus of the processor is at least 44 bits.

  • Question 2
    2 / -0.66

    A box contains the following three coins.

    I. A fair coin with head on one face and tail on the other face.

    II. A coin with heads on both the faces.

    III. A coin with tails on both the faces.

    A coin is picked randomly from the box and tossed. Out of the two remaining coins in the box, one coin is then picked randomly and tossed. If the first toss results in a head, the probability of getting a head in the second toss is

    Solution

    Application:

    Let event A is defined as:

    A = Getting head in the first toss

    Event B is defined as:

    B = Getting head in the second toss

    According to the question, we need to find the probability of getting a head in the second toss when

    Already a head has occurred in the first toss, i.e.So, the probability of getting head in the first toss will be:

    P(A) = P(fair coin is selected) × P(Getting head) + P(double-headed coin is selected) × P(getting head)

  • Question 3
    2 / -0.66

    If G is a simple graph with 20 vertices and degree of each vertex is at most 13, then minimum edges possible in G̅ is ________.

    Solution


    If maximum edge is present in G then minimum edge will be present in G̅ because sum of edges of G and G̅ is constant

  • Question 4
    2 / -0.66

    Identify the correct sequence in which following actions take place on the network when a user searches a specific URL in a web browser.

    I. Browser initiates a TCP connection with the server.

    II. The browser sends a request to the server and receives a response from the server.

    III. If the requested URL is not in the cache, ISP’s DNS server initiates a DNS query to find the IP address of the server that hosts given URL.

    IV. Browser checks for DNS record for corresponding IP Address of a given URL.

    Solution

    The browser checks the cache for a DNS record to find the corresponding IP address of a required address.

    DNS (Domain Name System) is a database that maintains the name of the website (URL) and the particular IP address it links to. 

    Every single URL on the internet has a unique IP address assigned to it.

    Once the browser receives the correct IP address it will build a connection with the server that matches IP address to transfer information.

    The server handles the request and sends back a response.

  • Question 5
    2 / -0.66

    The logic circuit given below consists of three 2:1 multiplexers. The output of the logic circuit is F. What is the expression for F?

    Solution

    Output of MUX1 = P'(1) + P(0) = P'

    Output of MUX2 = P'(1) + P(P') = P' + 0 = P'

    Output of MUX3 = F = Q'(P') + Q(P) = P'Q' + PQ = P⊙Q

  • Question 6
    2 / -0.66

    Consider a hypothetical workstation having an I/O bus speed of 2 Gbps and memory bandwidth of 10 Gbps. Assume that direct memory access is used to move data in and out of the main memory. Find the maximum number of interfaces, a switch based on this workstation can handle for a 160 Mbps Ethernet link?

    Solution

    Data:

    I/O bus speed = 2 Gbps = 2 × 1000 Mbps

    Bandwidth = 10 Gbps

    Ethernet links = 160 Mbps

    Explanation:

    Here, I/O bus speed is less than the memory bandwidth.

    So, Effective bandwidth that is provided by I/O bus = 

    It is because each packet crosses the I/O bus two times. That’s why it is divided by 2.

    Number of interfaces to 50 Mbps Ethernet links a switch bases on this workstation can handle are

  • Question 7
    2 / -0.66

    A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, A to G are initially entered using a hashing function with linear probing. The maximum number of comparisons needed searching an item that is not present is

    0

    B

    1

    C

    2

     

    3

    F

    4

     

    5

    A

    6

     

    7

    G

    8

    D

    9

    E

    Solution

    Data:

    Largest cluster size = n = 5

    Formula:

    In a linear probing

    maximum number of comparisons = n + 1

    Calculation:

    maximum number of comparisons = 5 + 1 = 6

    Important Point:

    Largest cluster = {G, D, E, B, C}

  • Question 8
    2 / -0.66

    Consider the following DAG.

    Which of the following expression is represented by above DAG?

    Solution

    Concept:

    A directed acyclic graph (DAG) is a directed graph that contains no cycles. A DAG is used to identify common sub-expressions. By doing so it gives the compiler important hints on how to generate efficient code to evaluate the expressions.

    Explanation:

    Hence  the Expression will be (a*b) + c*(a*b) + c*(a*b)*d.

    Option 1 is the correct answer.

  • Question 9
    2 / -0.66

    Create a binary search tree B1 by inserting the numbers 1, 2, 3, ... n  into an empty binary search tree. Create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?

    Solution

    Concept:

    The right subtree of a node contains only nodes with values greater than or equal to the node’s value.

    The left subtree of a node contains only nodes with values less than the node’s value.

    Explanation: Take n = 5

    B1:

    n = 5

    ∴ Difference = 5 - 1 =  n- 1

    Therefore option 2 is correct

  • Question 10
    2 / -0.66

    What does the following query return?

    SELECT Pnumber, Pname, COUNT (*)

    FROM PROJECT, WORKS_ON

    WHERE Pnumber = Pno

    GROUP BY Pnumber, Pname

    HAVING COUNT (*)>2; 

    The relational schemas are PROJECT(Pname, Pnumber, Plocation, Dnum) and WORKS_ON(Essn, Pno, Hours).

    Solution

    The SELECT clause is used to retrieve the attributes Pnumber, Pname and the count of the employees.

    The FROM clause specifies the tables i.e. PROJECT and WORKS_ON.

    The WHERE clause specifies the conditions for selecting the tuples from these relations, including join conditions if needed i.e. 'Pnumber must be equal to Pno'.

    GROUP BY specifies grouping attributes i.e. Pnumber and Pname, whereas HAVING specifies a condition on the groups being selected rather than on the individual tuples.

    Therefore, the query retrieves the project number, the project name and the number of employees who work on the project where for each project more than two employees work.

Self Studies
User
Question Analysis
  • Correct -

  • Wrong -

  • Skipped -

My Perfomance
  • Score

    -

    out of -
  • Rank

    -

    out of -
Re-Attempt Weekly Quiz Competition
Self Studies Get latest Exam Updates
& Study Material Alerts!
No, Thanks
Self Studies
Click on Allow to receive notifications
Allow Notification
Self Studies
Self Studies Self Studies
To enable notifications follow this 2 steps:
  • First Click on Secure Icon Self Studies
  • Second click on the toggle icon
Allow Notification
Get latest Exam Updates & FREE Study Material Alerts!
Self Studies ×
Open Now