Which university started first post-graduate course in Library Science in India ?

Asked in Librarian Grade II 2019 · Topic: Basics of Computers and Information Technology (Database Management Systems (DBMS) Basics: Concepts, Types of Databases)

1. University of Rajasthan
2. Banaras Hindu University
3. University of Delhi
4. Madras University

More Information and Communication Technology questions

• Raja Rammohan Roy Library Foundation was established by Government of India in which year ?
• According to Dr. S.R. Ranganathan which one from following is the fourth law of Library Science ?
• In ER Model constructs, which type of attribute is most suitable to represent the skill(s) of an employee for an organization?
• In Relational Model, which type of constraint does not allow composite and multivalued attributes?
• Consider following two instances of relations X and Y – X Code Item 100 A 200 B 300 B 400 C Y Item Quantity A 5 B 6 C 3 How many total tuples a Cartesian product between the two relations X and Y will produce?
• Consider the following instance of a relation District - District Name Population JA 10 AJ 50 MM 5 Which of the District name will be returned by the following relational algebra expression? ($ \pi_{\text{Name}} (\sigma_{\text{Name}="Aj"} (\text{District}))) - [(\pi_{\text{Name}} (\sigma_{\text{Population}>5}(\text{District}))) \cap (\pi_{\text{Name}} (\sigma_{\text{Name} ="Aj"}(\text{District}))) ]$
• Consider a schema R (A, B, C, D) and functional dependencies A → B, C → D. Then, the decomposition of R into R1 and R2 where R1 (AB) and R2 (CD), is -
• Dependency Preservation A decomposition is dependency preserving if all original functional dependencies can be enforced on the decomposed relations. In this case, $A \rightarrow B$ is preserved in $R_1(AB)$, and $C \rightarrow D$ is preserved in $R_2(CD)$. 2. Lossless Join A decomposition is lossless if the original relation R can be perfectly reconstructed by joining the decomposed relations. A common condition for lossless join decomposition of R into $R_1$ and $R_2$ is that $R_1 \cap R_2$ must contain a superkey for $R_1$ or $R_2$. However, in cases where the dependencies are disjoint and correspond directly to the decomposed relations (as here), the decomposition is typically lossless even if the intersection is empty. The original relation R is effectively the Cartesian product of its projections onto the disjoint attribute sets, which is what $R_1 \bowtie R_2$ would represent in this case. 197. Consider following two instances of relation Student and Faculty with operation on these instances – Student Faculty (a) Student - Faculty (b) (Student ∩ Faculty) U (Faculty ∩ Student) (c) (Student U Faculty) - (Student ∩ Faculty) (d) Student ∩ Faculty Identify the correct option that produces equivalent output -

All 1,360 Information and Communication Technology questions →