0% found this document useful (0 votes)
5 views3 pages

Key Concepts in DBMS and OS Explained

Provide Data base basic training

Uploaded by

22103040
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views3 pages

Key Concepts in DBMS and OS Explained

Provide Data base basic training

Uploaded by

22103040
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

DBMS

[Link] is the difference between DBMS and RDBMS?

[Link] is referential integrity and how is it achieved?

[Link] is Weak Entity set?

[Link] is a view? How it is related to data independence?

5. How does Tuple-oriented relational calculus differ from domain-oriented relational calculus6. What is
normalization?

7. What is Functional Dependency?

[Link] is Multivalued dependency?

9. What is Lossless join property?

[Link] is Fully Functional dependency?

[Link] 1NF,2NF and 3NF?

[Link] the need for three schema architecture.

[Link] are data models?

14. What is Data Independence?

[Link] are the different types of join ?

[Link] data [Link] various integrity constraints

[Link] between DELETE and TRUNCATE command.

[Link] is the basic difference between clustered and non clustered index

19. Differentiate between relation and relationship.

[Link] should relations be normalized?

[Link] is the difference between conceptual model and logical model of adatabase

[Link] are the ideal features of a database system.

23. Differentiate between primary key, candidate key & super key.

24. What is the difference between the strong entity set and weak entityset ?

25. What do you mean by mapping cardinalities ? Explain various type of cardinalities.

26. What is difference between total and partial participation ?

27. Differentiate between Two phase locking and Rigorous two-phaselocking.

28. What is Hashing ?


[Link] is data dictionary?What are the information stored in the datadictionary?

[Link] are Armstrong’s axioms?

[Link] are aggregate functions.?

[Link] the ACID properties of transaction.

[Link] view serializability and conflict serializability.

[Link] between shared and exclusive locks.

[Link] is role of checkpointing?

OS

1.

What are the key object oriented concepts used by Windows NT?

[Link] is multi tasking, multi programming, multi threading?

[Link] are devices represented in UNIX?

[Link] are the sub-components of I/O manager in Windows NT?

[Link] is a binary semaphore? What is its use?

[Link] latency, transfer and seek time with respect to disk I/O.

[Link] are the wait/signal operations for monitor different from those for semaphores?

[Link] are the four layers that Windows NT have in order to achieve independence?

9. What is the kernel?

[Link] are privileged instructions?

11. What do you mean by system calls?

12. What are overlays?

[Link] spooling.

14. List the difference between monitor and semaphore.

15. What is a deadlock?

[Link] the 4 necessary conditions for deadlock occurrence.

[Link] is node?

[Link] the functionality of long term, short term and medium term scheduler.

[Link] between turn around time and waiting time.


[Link] thrashing.

[Link] are buddy systems?

22. Differentiate between internal and external fragmentation.

[Link] are the different ways of achieving intercrosses communication?

[Link] race condition.

[Link] do you mean by Belady's Anomaly.

[Link] is an advantage of a large scheduling quantum? What is a disadvantage?

[Link] is the difference between a ‘thread’ and a ‘process’[Link] is the difference between a
process and a program?[Link] the use of pipes in process [Link] the use of
paging.

Common questions

Powered by AI

Two-phase locking involves two phases: a growing phase, where new locks can be acquired and none released, and a shrinking phase, where locks are released and no new locks are acquired. Rigorous two-phase locking extends this by preventing any locks from being released until the transaction has been committed or aborted, thereby ensuring stricter adherence to serializability. Rigorous two-phase locking guarantees a higher level of consistency compared to traditional two-phase locking by preventing any reads or writes from observing uncommitted data .

The ACID properties—Atomicity, Consistency, Isolation, Durability—play a crucial role in transaction processing by ensuring that transactions are processed reliably. Atomicity ensures that all operations within a transaction are completed; otherwise, the transaction is aborted. Consistency maintains database integrity by enforcing rules before and after transactions. Isolation prevents transactions from conflicting by managing concurrency. Durability guarantees that once a transaction is committed, it is permanent, even in case of system failures, thus ensuring reliability in database systems .

The three schema architecture offers advantages such as data abstraction, independence, and easier system maintenance. Comprising the internal, conceptual, and external levels, it allows changes in one schema without affecting others, thereby enhancing flexibility. This influences system flexibility by allowing the database system to support multiple user views, accommodate changes to physical storage without altering conceptual schemas, and support logical schema modifications without affecting user applications .

A view contributes to data independence by providing an abstract layer over the physical storage of data. It allows users to interact with a logical representation of data without needing to understand or affect the underlying physical schema. This abstraction is a key component of logical data independence, as changes can be made to the physical layers without affecting how users interact with the data via views .

Normalization is significant in database design as it organizes data to reduce redundancy and improve data integrity. By structuring a database into tables with minimized duplication of data and dependencies, normalization ensures consistent and accurate data. It impacts data redundancy by decomposing tables into smaller tables without sacrificing the integrity and ensures that the database remains efficient and scalable .

The fundamental difference between a Database Management System (DBMS) and a Relational Database Management System (RDBMS) lies in their ability to handle data. DBMS is used for managing the database on a computer system which can be non-relational and does not support distributed databases. RDBMS, on the other hand, is based on the relational model of data where data is stored in tabular forms and it supports distributed databases. This affects data management processes by enforcing data integrity, facilitating complex queries, and supporting ACID properties, thereby enhancing data manipulation and retrieval processes .

A process is an independent program in execution with its own memory space, while a thread is a sequence of executable instructions that belongs to a process, sharing the process's resources. These differences affect system performance and resource management as threads are more lightweight, with lower memory overhead, and enable efficient communication through shared memory within a process. Processes provide more robust isolation, reducing the risk of instability but typically at the cost of higher overhead for inter-process communication and context switching .

Data independence benefits from the use of views by decoupling the user's interaction with the data from the storage and organization of the data within the database. Views provide a level of abstraction that hides the physical schema from the user, allowing changes to be made to the underlying data structures without affecting how users access the data. This enhances both logical and physical data independence, as users are insulated from changes in the database structure .

Referential integrity ensures data consistency by maintaining valid links between tables using primary and foreign keys. It prevents orphaned records and ensures that changes to linked data are systematically propagated throughout the database. Mechanisms to enforce referential integrity include the use of constraints like ON DELETE CASCADE or ON UPDATE CASCADE, which handle how changes in one table's primary key affect related foreign keys in another table .

A functional dependency implies a relationship where one attribute depends on another, which is critical for defining normal forms like 2NF and 3NF to eliminate redundancy. In contrast, a multivalued dependency occurs when one attribute determines a set of values for another, crucial for 4NF. While functional dependencies promote normalization by minimizing redundancy and ensuring data integrity, multivalued dependencies identify and eliminate partial redundancies beyond 3NF, further normalizing the database and organizing data into stable structures .

You might also like