Explore topic-wise InterviewSolutions in .

Yes.

Yes.

Yes.

Yes.

Yes.

Yes.

FOREIGN KEY is the key i.e. attribute which refers to another table primary key. REFERENCE key is the primary key of table REFERRED by another table.

Foreign key is the key i.e. attribute which refers to another table primary key. Reference key is the primary key of table referred by another table.

32 BIT LENGTH.

32 bit length.

Valid.

Valid.

ALIAS is temporary and USED with ONE QUERY. Synonym is PERMANENT and not used as alias.

Alias is temporary and used with one query. Synonym is permanent and not used as alias.

Synonym is just a second NAME of table used for multiple link of database. VIEW can be created with many TABLES, and with virtual columns and with CONDITIONS. But synonym can be on view.

Synonym is just a second name of table used for multiple link of database. View can be created with many tables, and with virtual columns and with conditions. But synonym can be on view.

No.

No.

No.

No.

YES, DATABASE TRIGGER WOULD FIRE.

Yes, database trigger would fire.

TO make index ACCESS PATH unavailable - Use FULL hint to OPTIMIZER for full table scan - Use INDEX or AND - EQUAL hint to optimizer to use one index or set to indexes instead of another. - Use an expression in the Where CLAUSE of the SQL..

TO make index access path unavailable - Use FULL hint to optimizer for full table scan - Use INDEX or AND - EQUAL hint to optimizer to use one index or set to indexes instead of another. - Use an expression in the Where Clause of the SQL..

To be CREATED when table is queried for LESS than 2% or 4% to 25% of the table rows.

To be created when table is queried for less than 2% or 4% to 25% of the table rows.

Network OVERHEAD (traffic), Speed and Load of CLIENT SERVER.

Network Overhead (traffic), Speed and Load of client server.

RDBMS - R SYSTEM.

Hierarchical - IMS.

Network - DBTG.

RDBMS - R system.

Hierarchical - IMS.

Network - DBTG.

In a Single Threaded ARCHITECTURE (or a DEDICATED server CONFIGURATION) the database manager creates a separate process for each database user. But in MTA the database manager can assign multiple users (multiple user processes) to a single DISPATCHER (server process), a controlling process that queues REQUEST for work thus reducing the databases memory requirement and resources.

In a Single Threaded Architecture (or a dedicated server configuration) the database manager creates a separate process for each database user. But in MTA the database manager can assign multiple users (multiple user processes) to a single dispatcher (server process), a controlling process that queues request for work thus reducing the databases memory requirement and resources.

A RELATIONAL Database is a database where all data VISIBLE to the user is organized STRICTLY as tables of data VALUES and where all database operations work on these tables.

A Relational Database is a database where all data visible to the user is organized strictly as tables of data values and where all database operations work on these tables.

3.

3.

SYSTEM FUNCTION.

System Function.

LAST RECORD.

Last Record.

No.

No.

Yes.

Yes.

@.

@.

No ROWS.

No rows.

9 ROWS.

9 rows.

Yes.

Yes.

• Public AVAILABLE to all instances
• PRIVATE Available to SPECIFIC instance

Explicit cursors can take PARAMETERS, as the example below SHOWS. A CURSOR parameter can appear in a QUERY wherever a CONSTANT can appear. CURSOR c1 (median IN NUMBER) IS SELECT job, ename FROM emp WHERE sal > median; 

Explicit cursors can take parameters, as the example below shows. A cursor parameter can appear in a query wherever a constant can appear. CURSOR c1 (median IN NUMBER) IS SELECT job, ename FROM emp WHERE sal > median; 

254.

254.

Yes.

Yes.

Yes.

Yes.

No.

No.

UNIQUE KEY can be NULL; PRIMARY key cannot be null.

Unique key can be null; Primary key cannot be null.

The various STATES of a rollback segment are :

ONLINE, OFFLINE, PARTLY AVAILABLE, NEEDS RECOVERY and INVALID.

The various states of a rollback segment are :

ONLINE, OFFLINE, PARTLY AVAILABLE, NEEDS RECOVERY and INVALID.

Two.

Two.

YES. In the CHECK condition for a COLUMN of a table, we can REFERENCE some other column of the same table and thus enforce SELF REFERENTIAL integrity.

Yes. In the CHECK condition for a column of a table, we can reference some other column of the same table and thus enforce self referential integrity.

Yes.

Yes.

No.

No.

The TIME for INSERT INCREASES.

The time for Insert increases.

ACCESS TIME REDUCED for JOINS.

Access time reduced for joins.

USED by ORACLE to store information about various physical and logical Oracle structures.

e.g. TABLES, Tablespaces, DATAFILES, ETC...

Used by Oracle to store information about various physical and logical Oracle structures.

e.g. Tables, Tablespaces, datafiles, etc...

CONTAINS POINTERS to locations of VARIOUS data files, redo log files, ETC.

Contains pointers to locations of various data files, redo log files, etc.

YES, by ADDING DATAFILES to it.

Yes, by adding datafiles to it.

PHYSICAL : Data FILES, Redo Log files, Control file.

Logical : Tables, Views, TABLESPACES, ETC.

Physical : Data files, Redo Log files, Control file.

Logical : Tables, Views, Tablespaces, etc.

A trigger giving an INSERT / UPDATE on a table having referential INTEGRITY CONSTRAINT on the triggering table.

A trigger giving an Insert / Update on a table having referential integrity constraint on the triggering table.

A TRIGGER GIVING a SELECT on the table on which the trigger is WRITTEN.

A trigger giving a SELECT on the table on which the trigger is written.

When a STATEMENT in a trigger body CAUSES another trigger to be fired, the TRIGGERS are said to be CASCADING. MAX = 32.

When a statement in a trigger body causes another trigger to be fired, the triggers are said to be cascading. Max = 32.

INSERT : NEW = new VALUE, OLD = NULL.

DELETE : new = NULL, old = old value.

UPDATE : new = new value, old = old value.

INSERT : new = new value, old = NULL.

DELETE : new = NULL, old = old value.

UPDATE : new = new value, old = old value.

No.

No.

One.

One.