3i Infotech Papers: Sample Questions 594 - 595 of 1245

Examrace Placement Series prepares you for the toughest placement exams to top companies.

Question number: 594

» Operating System » Unix

Essay Question▾

Describe in Detail

What is the working set of a process?

Explanation

Understanding of The working set policy

Understanding of the Working Set Policy

Understanding of The working set policy

  • Working set is the approximation of the set of pages that the process will access in the future and more specifically is indication of pages to be kept in main memory to allow smooth execution of process without page faults.

  • The window of the working set of a process is the total number of pages the process has referred recently.

  • The working set information W at time t is the collection of information referred by the process during the process time interval ().

  • The units of information in question are considered memory pages.

  • It determines if there is enough RAM in the system.

  • If working set is smaller than RAM data the program frequently accesses is always in memory.

Question number: 595

» Basic CS » Data Structures

Essay Question▾

Describe in Detail

Draw a binary tree for the expression:

A * B- (C + D) + (P/Q)

Explanation

  • The binary tree for arithmetic expression (Binary Expression Tree or BET) represents the expression in the infix notation.

  • Two types of expressions that a binary expression tree represents are:

    • Algebraic

    • Boolean.

  • Trees can represent both unary and binary operators.

  • Example Arithmetic Expression:

  • Tree for the above expression is drawn as:

    • Leaves = operands (constants/variables)

    • Non-leaf nodes = operators

Arithmetic Expression

Arithmetic Expression

Arithmetic Expression

  • BET is used in most compilers

  • No parenthesis is needed- tree structure conveys precedence.

  • BET can be evaluated by using post order traversal.

Binary expression tree

Binary Expression Tree

Binary expression tree