NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level Introduction to Database Management System Assignment 11

Manufacturing
Consider the following relation that keeps track of the orders placed by a manufacturing
company:
Orders(orderDate, deliveryDate, supplier, partID, material, price).
Suppose the following functional dependencies hold on the relation:
orderDate, supplier -> deliveryDate
partID, supplier, orderDate -> price
partID -> material
material -> supplier.

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level Introduction to Database Management System Assignment 11

Manufacturing
Consider the following relation that keeps track of the orders placed by a manufacturing
company:
Orders(orderDate, deliveryDate, supplier, partID, material, price).
Suppose the following functional dependencies hold on the relation:
orderDate, supplier -> deliveryDate
partID, supplier, orderDate -> price
partID -> material
material -> supplier.

NIELIT A Level Introduction to Database Management System Assignment 10

NIELIT A Level

Introduction to Database Management System

Assignment 10

Wholesale Dealer

Consider the following relation that keeps track of the sales of a wholesale dealer in trousers:
TrousersSold(customerID, customerName, model, size, day, numberSold, price)
Suppose the following functional dependencies hold on the relation:

customerID -> customerName
customerID, model, size, day -> numberSold
model, size -> price
model, price -> size

NIELIT A Level Introduction to Database Management System Assignment 9

NIELIT A Level

Introduction to Database Management System

Assignment 9

Exam Administration
Consider the following relation that keeps track of the exams taken by students at
a University department:
Exam(studID, studName, courseID, courseTitle, acadYear,
examSession, mark, degreeCourse)

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 8

Normalization of the CAR_SALE Table.

The purpose of this exercise is for you to demonstrate your ability to take a database schema and convert it up through the Third Normal Form. Upon completion of this exercise you will have:

a) Listed the functional dependencies for a database schema
b) Explained why a specific schema is not in Second or Third Normal Form
c) Normalized a given schema into the Third Normal Form

The below scenario has been created to help you determine the table structures r

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 7

The NBA (NDHU Basketball Association) is in dire need of a database in order to keep track of the 

activities in their league.

The entities in the database are

• People (with attributes id, name and age),
• Teams (with attributes team name and manager), and
• Courts (with attributes court id, address and capacity).

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 6

Produce an E-R diagram, which documents the entities and relationships involved in the staff management and pay-roll for the employees working in a super market. Create a relational schema to hold information. Identify the tables, perform normalization to the tables
and fully implement the code with necessary validations using MS-Access / FOXPRO /

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 5

Assume that a Consumer item lease Company which leases various household items to its clients for their use for a specific period of time, maintains the following tables:

Clients (clientID, name, address, contact Phone)

Itemlist (itemID, itemName, itemCost, purchase Date )

Leaselist (clientID, transactionNO, itemID, startDate, returnDate, amountTObeCharged)

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 4

Consider the following requirements for a construction company that uses database system to keep track of its projects, workers and material requirements of various projects.

The projects for the company are of two kinds: (i) Turn key projects and (ii) Others.All the projects have a life cycle (Please note that the turn key projects have a maintenance phase in addition.) and workers are allotted as per the phase of the project. Each project has its own plan of completion that is drawn at the start of the project. The worker and material requirement of project is calculated at the start of the project.

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 3

Performa following queries in SQL using the above schema:
a) Find details of Teachers who taught DBMS.
b) Find details of students who did MCA from PB University.
c) Find courses taught by T# 5078.

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 2

Create an E R diagram and relational schema to hold information about the situation inmany institutions affiliated to some University, many teachers of different disciplines areteaching to many students enrolled in many courses offered by the university to thestudents through the institutions. Use concept of keys, aggregation, generalisation,cardinality etc. in a proper way.Say the schema of respective entities is:Teacher( T#, Tname, Tqual, Tsubject, Tcourse, Prog)

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 1

The following tables form part of a database held in a relational DBMS:

•  Hotel (Hotel_No , Name, Address) 
• Room (Room_No, Hotel_No, Type, Price)
•  Booking (Hotel_No, Guest_No, Date_From, Date_To, Room_No) 
• Guest (Guest_No, Name, Address) 

where Hotel contains hotel details and Hotel_No is the primary key. Room contains room details for each hotel and (Hotel_No, Room_No) forms the primary key. Booking contains details of the bookings and the primary key comprises (Hotel_No, Guest_No, Date From) and Guest contains guest details and Guest_No is the primary key.

Syllabus A7-R4 Introduction to Database Management System (NIELIT A Level)

Objective of the Course

This course will allow students to develop background knowledge as well as core expertise in

Database Management Systems. The students will learn Database concept, Data Structure,

Data Models, various approaches to Database design, strengths of relational model,
Normalization.

At the end of the course the student will be able to
• Understand Database design and normalisation techniques.
• Use Standard Query Language and its various versions.
• Understand Importance of backup and recovery techniques.
• Develop Database system to handle the real world problem.

NIELIT A Level July, 2010 A6-R4: DATA STRUCTURE THROUGH C++

NIELIT A Level  July, 2010

A6-R4: DATA STRUCTURE THROUGH C++

PART ONE

(Answer all the questions)

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be
A) m*n
B) maximum of m, n
C) minimum of m, n
D) m + n –1
1.2 The postfix equivalent of the prefix * + ab – cd is
A) ab + cd – *
B) abcd + – *
C) ab + cd* –
D) ab + – cd*

NIELIT A Level January, 2011 A6-R4: DATA STRUCTURE THROUGH C++

NIELIT A Level January, 2011

A6-R4: DATA STRUCTURE THROUGH C++

PART ONE

(Answer all the questions)

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 For linear search in an array of n elements the time complexity for best case is.
A)
2
n
O
B) O(n)
C) O(1)
D)
 −
2

NIELIT A Level July, 2011 A6-R4: DATA STRUCTURE THROUGH C++

NIELIT A Level July, 2011

A6-R4: DATA STRUCTURE THROUGH C++

PART ONE

(Answer all the questions)

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 Identify the incorrect statement.
A) The resources most relevant in relation to efficiency are CPU time and internal memory.
B) An algorithm cannot have same Big-O measure for the worst case and the best case.
C) Worst case complexity of an algorithm can be determined by choosing a set of input conditions
that force the algorithm to make the least possible progress towards its final goal at each step.
D) Algorithms having exponential complexity can be practically solved only for very small values
of n.
1.2 The correct ADT of pop operation of a stack is
A) Function: Adds newItem to the top of stack
Precondition: Stack has been initialized
Postcondition: If (stack is full), exception fullStack is thrown,
else newItem is at the top of the stack
B) Function: Adds newItem to the top of stack
Precondition: Stack has been initialized
Postcondition: If (stack is empty), exception emptyStack is thrown,
else top element is removed from the stack
C) Function: Removes top element from the stack
Precondition: Stack has been initialized
Postcondition: If (stack is empty), exception emptyStack is thrown,
else top element is removed from the stack
D) Function: Removes top element from the stack
Precondition: Stack has been initialized
Postcondition: If (stack is full), exception FullStack is thrown,
else newItem is at the top of the stack

NIELIT A Level January, 2012 A6-R4: DATA STRUCTURES THROUGH C++

NIELIT A Level January, 2012

A6-R4: DATA STRUCTURES THROUGH C++

PART ONE

(Answer all the questions)

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 Array M[5,6] is stored in memory in row-major order and base address of M =200. If there are
4 words per memory cell then address of M[2,3] is
A) 250
B) 252
C) 254
D) 256
1.2 Sparse matrices are the matrices with
A) Less proportion of zeros
B) High proportion of zeros
C) No zeros
D) None of the above

NIELIT A Level July, 2012 A6-R4: DATA STRUCTURES THROUGH C++

NIELIT A Level July, 2012

A6-R4: DATA STRUCTURES THROUGH C++

PART ONE

(Answer all the questions)

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 Krushkal's algorithm is used for finding
A) Sorting
B) Searching
C) Critical Path
D) Minimum Spanning Tree
1.2 Which of the method belong to external sorting?
A) Bucket Sort
B) Multi way Merge
C) Selection Sort
D) Insertion Sort

NIELIT A Level January, 2013 A6-R4: DATA STRUCTURES THROUGH C++

NIELIT A Level  January, 2013

A6-R4: DATA STRUCTURES THROUGH C++

PART ONE

(Answer all the questions)

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 If the address of A[1,1] and A[2][1] are 1000 and 1010 respectively and each element
occupies 2 byte of memory, then the array has been stored in
A) row major order
B) column major order
C) matrix major order
D) None of the above
1.2 One difference between a queue and a stack is:
A) Queues require dynamic memory, but stacks do not.
B) Stacks require dynamic memory, but queues do not.
C) Queues use two ends of the structure; stacks use only one.
D) Stacks use two ends of the structure, queues use only one

Algorithm Infix to postfix conversation

Postfix expression evolution is task for computer not for human. We deal with infix expression in our daily life.  Where we take care about operator priority etc which untimely need some more consideration for solve an expression if computer will follow infix expression as calculation then it need more time for getting priority operation.

So postfix is a solution where all bracket are removed.  One advantage that postfix has over infix is that it is very easily implemented and does not have overhead of parentheses. Evaluating an expression in postfix notation requires scanning from left to right so you know what to do as soon as you encounter an operator in the expression string. Also, with postfix there is no complication of precedence of one operator over the other.