July, 2012 A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

July, 2012

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

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 The language used application programs to request data from the DBMS is referred to as
A) DML
B) DDL
C) Query Language
D) All of the above
1.2 When two transactions run concurrently types of problems encounter are
A) Data delete Problem, Dirty read problem, Incorrect summary problem
B) Lost update problem, Dirty read problem, Incorrect summary problem
C) Lost update problem, Data delete Problem, Incorrect summary problem
D) Lost update problem, Dirty read problem, Data delete Problem

PHP Hardware Institute Website Free Download

Girfa Hardware Institute is a website that Is suitable for all types institution or university or any educational body who running hardware courses. You can launch your business globally on web with a professional way. Content of this website is highly standardized by the expert. A comprehensive syllabus material has been added which will help you to design your course material. Online certificate verification enhances your working standard. So I am representing a tangible solution to you if you want to make such type of website.

Feature

• All necessary content based of live project
• PDF syllabus
• Online Certificate Verification
• Digital certificate download facility

January, 2013 A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS (DBMS)

January, 2013

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS (DBMS)

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 A database user manually notes that “The file contains two hundred records, each record
containing nine fields”. Translating this statement in database terminology means
A) 200 attributes and 9 rows
B) 200 rows 9 tuples
C) 200 tuples and 9 attributes
D) 200 attributes and 9 tuples
1.2 Given the following relation schemas
EMPLOYEE (EMP_CODE, EMP_NAME, JOB_CODE)
PLAN (PLAN_CODE,PLAN_DESCRIPTION)
BENEFIT(EMP_CODE,PLAN_CODE)
Attribute PLAN_CODE in relation BENEFIT is
A) Primary Key
B) Foreign Key
C) Candidate Key
D) Alternate Key

July, 2013 A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEM

July, 2013

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEM

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 A view is a
A) Base table
B) Derived table
C) Named Derived table
D) Soft table
1.2 Which of the following do you need to consider when you make a table in SQL?
A) Data types
B) Primary Keys
C) Default Keys
D) All of the above

January, 2014

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 Which of the following schemas defined the stored data structures in terms of the database
model used?
A) External
B) Conceptual
C) Internal
D) None of the above
1.2 Object oriented data models are used to
A) specify overall structure of the database
B) describe data and its relationships.
C) higher level description of storage structure and access mechanism.
D) all of the above

July, 2014

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 In DBMS the structure of a data file is stored separately from the access program. This
feature allows us to enforce
A) Program-Operation Independence
B) Program-data Independence
C) Physical Data Independence
D) Logical Data Independence
1.2 In DBMS Protection includes
A) System Protection against software/hardware malfunction
B) Security against unauthorized access
C) both A) and B)
D) None of the above

January, 2015 A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

January, 2015

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)
1.1 The separation of the data definition from the program is known as
A) Data dictionary
B) Data independence
C) Data integrity
D) Referential integrity
1.2 The data dictionary of a DBMS is called.
A) DBMS directory
B) DBMS Catalog
C) System Catalog
D) All of the above

PHP Consultancy Website Template Free Download

Girfa Consultancy is a template is lightweight responsive website. Design of this site is based on current trend and you can modified is easily as your project requirement. I have made this for consultancy but it is global template that can be used in any type field. So download it do whatever you want to do.

Feature

• Processional Design
• Responsive website
• Light weight
• Dynamic
• Content scrolling and Animation

Download Free PHP FMCG Website Full Source Code

FMCG

Fast Moving consumer goods are a type of business worldwide which cover broad range market and consumer. We used any product of belongs to FMCG within every hour of our daily life. Any type of person investing small amount of money can start their own FMCG Business. Most of startup start FMCG business and try to promote their business so they can cover huge amount of people for achieve this some business person need a website. So I am providing A FMCG website with full source code. So if you want make any FMCG business or project then this site is your one click solution.

PHP Online Test Website

PHP online test is website written in PHP as server side language, MySQL as back end database. This website has 10 set of test. Each exam consist 50 mcq type question.  A timer will start when exam start , there is not any specific time for test. On the Result page summary of test displayed.

Feature

• 10 Set of Exam
• MCQ type question
• Timer
• Instant Result

July, 2015 A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

July, 2015

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 Which of the following is NOT a basic element of the E-R model?
A) Entities
B) Attributes
C) Relationship
D) Primary keys
1.2 The result of the operation RUS includes all tuples that are
A) Either in R or S
B) Both in R and S
C) Both A) and B)
D) None of the above

Smart Phone Impact

January, 2016 A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

January, 2016

A7-R4: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 Which of these is an advantage of the database systems?
A) Data Abstraction
B) Program-data Independence
C) Centralized data management
D) All of the above
1.2 Which of the following phases of database design is the E-R model related to?
A) Conceptual Database design
B) Logical Database design
C) Requirement analysis
D) None of the above

CBSE based Inter College based template with full source Code and Content

CBSE based Inter College Inter College based template with full source code so if you want to make any website for CBSE associate college then this project is complete solution. I have included CBSE based standard text content and image, you don’t have to do lots of work for content. I bet you that you will not download such type of project net free of cost …. So enjoy …CBSE based Inter College Inter College based template with full source code so if you want to make any website for CBSE associate college then this project is complete solution. I have included CBSE based standard text content and image, you don’t have to do lots of work for content. I bet you that you will not download such type of project net free of cost …. So enjoy It…

Import Microsoft Access Database table to PHP mysql database table

Microsoft Access TO PHP MYSQL

Follow the upcoming steps to import access data to mysql PHP based database

• Export your access database to excel

• Open excel file and save this file as csv by save as option go to others format

Q. Write a program to make three array name mArry, even & odd move array value in even & odd array respect to this type ?

/* #############################

      Girfa Student Help

      Event Odd Sepration Program

      for more programs visit : http://girfahelp.blogspot.in/2012/09/some-program-of-c-language.html

   ##############################

*/

#include<stdio.h>

#include<conio.h>

#define MAX 5

void main()

{

      int even[MAX*2],odd[MAX*2],ar[MAX],i,oddindex,evenindex;

      clrscr();

      for(i=0;i<MAX;i++)

      {

Q. Write a program to make three array name mArry, even & odd move array value in even & odd array respect to this type ?

/* #############################

      Girfa Student Help

      Event Odd Sepration Program

      for more programs visit : http://girfahelp.blogspot.in/2012/09/some-program-of-c-language.html

   ##############################

*/

#include<stdio.h>

#include<conio.h>

#define MAX 5

void main()

{

      int even[MAX*2],odd[MAX*2],ar[MAX],i,oddindex,evenindex;

      clrscr();

      for(i=0;i<MAX;i++)

      {

Template Class In C++

A class or function which can operate any type of with single bunch of code (Run time data type initialization)

Template is one of the features added to C++ recently. It is a new concept which enable programmer to make generic class which can operate any data type. A Template class takes data type as an argument which run time set data type of calling object so there is no need to make different version of class and function different types of data type.

Syntax:

                Template <Class name Ob_Name>

                Class Class_name

                {

                                _____

                                _____

                }

A template can be considered as a kind of macros. When an object of a specific type is defined for actual use. The template definition for that class is substituted with the required data type. since a template is defined with a parameter that would be replaced by a specific data type at the time of actual use of the class or  function. The template is sometimes called parameterized or function. 

/* ##############################

      Girfa Student Help

      Template Class

      Date : 21-Sep-2016

      for more example visit:  http://girfahelp.blogspot.in/p/c-tutorial_20.html

   ###############################

*/

#include<iostream.h>

#include<conio.h>

const int size=3;

template <class t>

class vector

{

      t *v;

      public:

      vector()

      {

            v=new t[size];

Degree College Management PHP Project

Degree College Management is a PHP based website for any type of degree and other higher level institution, with many customized feature from which you can claim to a dynamic website. This is a live project running from last 5 years. So you are just one jiffy away from submit your project and start working with advance professional programming.

NIELIT A Level Introduction to Database Management System Assignment

NIELIT A Level

Introduction to Database Management System

Assignment 12

a)Create a tables Employee with following columns :

b)Create a table Department with following columns:

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.

In any language, arithmetic operation is support is needed which is same as mathematical expression. But writing data structure for understanding arithmetic expression has so many complications. Like scanning direction, operations priority and after that how to decide the priority if any parenthesis is coming. So designing compiler for any language has a need to take care of these complications. But support of arithmetic expressions one of basic requirement of any language. Let us take an arithmetic expression 

a+b/3

Suppose a=0 and b=6. suppose we are diving operation first then add. So the resultant value will be

NIELIT A Level July, 2013 A6-R4: DATA STRUCTURES THROUGH ‘C++’

NIELIT A Level July, 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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 Given the sequence of numbers: 13, 52, 95, 26, 38
The sequence after the 3rd iteration of insertion sort is:
A) 13, 26, 52, 95, 38
B) 13, 52, 95, 26, 38
C) 13, 26, 38, 52, 95
D) 13, 26, 52, 95, 38
1.2 Given the following unbalanced tree:
Q
M
N
P
O
R

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

NIELIT A Level January, 2014

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 If given data is already in sorted then it will be a worst case of

A) Bubble sort

B) Selection sort

C) Insertion sort

D) Quick sort

1.2 Advantage of doubly linked list over singly linked list is in

A) Addition at head

B) Addition at tail

C) Deletion at head

D) Deletion at tail

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

NIELIT A Level July, 2014

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 “OMR” answer sheet supplied with the question paper, following

instructions therein. (1x10)

1.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the

expected number of collisions involving a particular key x is :

A) less than 1

B) less than n

C) less than m x n

D) less than 2xn

1.2 Let A be an adjacency matrix of a graph G. The ijth entry in the matrix AK , gives

A) The number of paths of length K from vertex Vi to vertex Vj

B) Shortest path of K edges from vertex Vi to vertex Vj

C) Length of a Hamiltonian cycle from vertex Vi to vertex Vj

D) Length of a Eulerian path from vertex Vi to vertex Vj

NIELIT A Level January, 2015 A6-R4: DATA STRUCTURES THROUGH ‘C++’

NIELIT A Level January, 2015

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 Suppose a queue is implemented by a circular array QUEUE [0..11].The number of elements
in the queue ,if FRONT =10 and REAR =3,will be
A) 3
B) 4
C) 5
D) 6
1.2 +/-MNP^+QR-UV is the prefix equivalent of
A) M-N/P+Q+R^U-V
B) MN-P/QR+UV-^+
C) MNP/-Q+R^UV-+
D) None of the above

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

NIELIT A Level July, 2015

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 +/-ABC^+DE-FG is the prefix equivalent of
A) A-B/C+D+E^F-G
B) AB-C/DE+FG-^+
C) ABC/-D+E^FG-+
D) None of the above
1.2 The most efficient search technique used in an ordered array is
A) Sequential search
B) Binary search
C) Interpolation search
D) None of the above
1.3 What does the following code segment do?
void fn( )
{
char c;
cin.get(c);
if (c != ‘\n’)
{
fn( );
cout.put(c);
}
}
A) The string entered is printed as it is.
B) The string entered is printed in reverse order.
C) It will go in an infinite loop.
D) It will print an empty line.

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

NIELIT A Level January, 2016

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 A graph has M vertices and N edges. How many edges does a Minimum Spanning Tree
has?
A) (N + M) – 1
B) N – 1
C) M – 1
D) N × M
1.2 A sequence of operations performed on the stack of the size 4 is as follows:
push(5), push(3), pop, push(4), push(6), push(7), pop, push(8), pop, push(1)
What is the condition of the stack after all these operations?
A) Stack overflow message is displayed.
B) Stack finally contains: 5, 3, 4, 6, 7, 8, 1
C) Stack finally contains: 5, 4, 6, 1
D) Stack finally contains: 5, 4, 8, 1

NIELIT A Level Data Structure through C++ Assignment

Assignment 21

Prepare a decision tree that defines the following course grading scheme: A student may

receive a final course grade of S,A, B, C or F. In deriving the student’s final course grade,

the instructor first determines an initial grade for the first test of student. The initial course

grade is determined in the following manner.

a) A student who has scored a total of not less than 90 percent on the first test , quiz,

class performance and received a score not less than 75 percent in the final test will

receive an initial grade of ‘S’ for the course.

NIELIT A Level Data Structure through C++ Assignment

Assignment 20

Simplify the following decision table:

Rules

1 2 3 4 5 6 7 8 9 10 11 12

C1

N Y N Y N Y N Y N Y N Y

C2

N N Y Y N Y Y N N Y Y

C3

A A A A B B B B C C C C

A1

X X X

A2

NIELIT A Level Data Structure through C++ Assignment

Assignment 19

Identify the possible actions to be taken for the decision or policy for constructing decision

table:

a) Pay no interest

b) Pay 5.75% quarterly interest on entire amount

c) Pay 6% quarterly interest on entire amount

d) Pay 6% monthly interest on amount up to Rs.25000

e) Pay 6.55% monthly interest on amount between Rs.25000 and Rs.50000

NIELIT A Level Data Structure through C++ Assignment

Assignment 18

Prepare a limited entry decision table for the following case:

A wholesaler has three commodities to sell and has three types of customers. Discount is

given as per the following procedure:

a) For VIP’S orders, 10% discount is given irrespective of the value of the order.

b) For orders more than Rs. 50,000/- agent gets a discount of 15% and the

retailer gets a discount of 10%.

NIELIT A Level Data Structure through C++ Assignment

Assignment 17

The sales staff of a Jewellery shop is divided into commissioned salesman and salaried

salesman. A commissioned sales man receives 10% commission on every sale greater

than or equal to Rs.10, 000.00; receives 5% commission on every sale greater than or

equal to Rs.1, 000.00 and less than Rs. 10, 000.00 and receives 2% commission on every

sale less than Rs.1, 000.00. A salaried salesperson receives a Rs.700.00 bonus for

NIELIT A Level Data Structure through C++ Assignment

Assignment 16

In Accounts Receivable systems printing of the monthly account statement is the main

feature. Because of the frequency of accounts receivable invoices, customers generally

expect certain information to be included on the statement. Name, address and account

number details are essential as are the previous and current account balances.

NIELIT A Level Data Structure through C++ Assignment

Assignment 15

Given a file whose record consists of following attributes:

Roll No.

Name

Sex code                         ‘M’ for males

                                     ‘F’ for females

Marks in English

Marks in Biology

Marks in Maths

The scheme for selection and allotment of departments is as follows:

a) Reject the candidate, if aggregate marks are less than 180.

b) Allot ‘ENGINEERING ‘ department if the candidate has maximum marks in maths

and sex code is ‘M’.

NIELIT A Level Data Structure through C++ Assignment

Assignment 14

Given is a data file of School Education Board for compilation of result of middle standard

examination. Draw a decision table to compute the result of candidates. The pass formula

is:

a) Candidate is to be declared ‘PASS’ if he gets 40 or more than 40 marks in all three

subjects.

NIELIT A Level Data Structure through C++ Assignment

Assignment 13

Draw a mixed entry decision table for calculating income tax according to the following

conditions:

Income Slab                                                                Rate

Upto Rs. 18,000                                                          Nil

Greater than Rs.18000 but less than 25000                     25%

Greater than Rs.25000 but less than 50000                     30%

Greater than Rs.50000 but less than 1,00,000                 40%

NIELIT A Level Data Structure through C++ Assignment

Assignment 12

If a candidate is sharp and disciplined, take him as trainee systems analyst.

a) If a candidate is only sharp, take him as trainee programmer

b) If a candidate is only disciplined, take him as Trainee console operator.

c) If a candidate is neither sharp nor disciplined, reject him.

NIELIT A Level Data Structure through C++ Assignment

Assignment-11

The candidate is to be allotted the department, given the conditions

a) If a male secures maximum marks in mathematics, allot Engineering department.

b) if a female secures maximum marks in biology, she is allotted medical department.

c) If a candidate secures maximum marks in English, allot English department.

d) If a candidate secures less than 180 marks in aggregate, he/she is rejected.

e) Rest all cases are allotted psychology department.

NIELIT A Level Data Structure through C++ Assignment

Assignment-10

In a ABC Limited company, if the invoice paid is <5000, then no discount is offered. If the

payment is made within 10 days and the payment is above 5000 but less than 10,000 , 2%

discount is given. If the payment is made within 10 days and it is above 10,000, 3%

NIELIT A Level Data Structure through C++ Assignment

Assignment-9

Design a structured chart using following information:

Calling Module:

• Calculate Word Counting

Called Module:

• Get Sorted Word List
• Count Number of Different Words
• Output Count

NIELIT A Level Data Structure through C++ Assignment

Assignment-8

Design a structured chart using following information:

Calling module :

• Calculate student grade
• Called module:
• Get student’s academic information
• Get valid grade
• Find out errors
• Check for probation Period
• Check for director’s list