3i Infotech Papers: Sample Questions 139 - 140 of 1245

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

Question number: 139

» Database » Oracle



What is built_in Subprogram?


Choice (4) Response


Collection of Packages


Stored procedure & Function


Collection of Subprograms


None of the above




Understanding of Built-in subprograms

Understanding of Built-In Subprograms

Understanding of Built-in subprograms

  • A built-in-function is SQL keyword to execute some operation in SQL statements which are built in the system – to perform some built-in function.

  • Also used in program or subprogram environment that provide by the oracle database.

  • It executes store procedures, function, triggers.

Two types of subprogram:

  • Procedures

    • Use perform the action

  • Function

    • Use to compute the value.

    Subprogram is PL/SQL block that can be called with a set of parameters.

Two types of subprogram

Two Types of Subprogram

Two types of subprogram

  • It has:

  • A declarative part, with declarations of types, cursors, constants, variables, exceptions and nested subprograms.

  • An executable part, with statement, its assigned values, control execution, and manipulate oracle data.

  • Optional exception-handling part, which deals with runtime error conditions.

Question number: 140

» Basic CS » Operating System

Essay Question▾

Describe in Detail

What is page cannibalizing?


  • Page cannibalizing is page swapping and page replacement so that the page in use by the same process in the current working set is forced to be replaced by another page. This would result in poor performance.

Page swapping:

  • Enables CPU to execute program and manipulate data files larger than main memory through virtual memory.

  • Data in nearest working set is put into main memory and the rest is put on the disk.

  • Swapping exchanges a portion of data in main memory with a portion of data on the disk.

  • Old pages not accessed in recent past are good candidates for swapping.

    Page replacement:

  • Algorithm to decide the page, which needs to be replaced when new page comes in.

  • When a requested page is not in memory and a free page cannot be used to satisfy the allocation the number of free page is lower.

  • When the page was selected for replacement and paged out is referenced again paged in and waiting for I/O completion.

  • A new page is referred and not present in memory, page fault occur and replace page with newly needed page.