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