Skip to main content

MCS-023 Assignment Questions July 2012


Question 1:
Describe briefly all the possible applications of a database
system in a University? (15 Marks)

Question 2:
 Identify all the associated entities for a Study Centre Management System, their corresponding attributes, relationships and cardinality and design an ER
diagram for it. (20 Marks)

Question 3:
 Consider the E-R diagram of Question 2 and design the tables. Perform Normalization till the required normal form. Implement it using MS-Access. (25 Marks)

Question 4:
 Consider a “Project Management System” that maintains the database using the following tables: (10 Marks)
Project (pid, ptitle, startdate, enddate, duration_in_months, cid, Cost)
Clients (cid, cname, caddress, cphone)
Employee (eid, name, address, phone)
Project-person (pid, eid)
Please note that an employee may be working on more than one project in the organization at any given time. Write and run the following SQL queries on the tables:
(a) Find the cid and cname of the clients who have given only one project to the company.
(b) List the details of all the employees whoever are working on the project with project code (pid) = 111.
(c) List all the project details those are currently under development.
(d) Find the projects whose cost is more than 11 lakhs.
(e) Find the employee who is not working on any of the project.
Note: Make suitable assumptions, if any.

Question 5:
 Consider the Relation R={A, B, C, D, E, F, G, H } and the set of
functional dependencies. (10 Marks)
A→C B→CG AD→EH C→DF A→H
What is the key for R? Decompose R into 2NF, 3NF and finally in BCNF relation.

Comments

Popular posts from this blog

IGNOU Syllabus for interview/test for admission to PhD programme in Computer Science

COMPUTER SCIENCE AND APPLICATION (Syllabus for interview/test for admission to PhD programme in Computer Science) Computer Architecture: representation of numbers; Octal, Hexadecimal, and Binary 2’s complement and 1’s complement arithmetic, Floating point representation. Combinational Circuit Design, Sequential Circuit Design, Hardware and Microprogrammed processor design, Instruction formats, Addressing modes, Memory types and organisation, interfacing peripheral devices, Interrupts. Data Structures & Algorithms: Arrays, stacks, queues, lists, linked, trees, graphs priority queues, heaps, Binary tree, AVL tree, B-tree and Hash tables. Graphs : connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning tree of a graph, Eccentricity of a vertex, radius and diameter of a graph. Hamiltonian, Eulerian graphs and Planar graphs. Sorting and Searching Algorithms, Binary Search, Analysis of Algorithms, Asymptotic notation...