Monday 12 September 2016

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

NIELIT A Level Data Structure through C++ Assignment

Assignment-7


Design a system for the Warehouse Inventory System and illustrate the solution with a Structure Chart that will take in customer orders, select the item from inventory, and
generate a packing slip and invoice.

INPUTS:

a) Customer Order from the Sales Department.
b) Shipments of Finished Goods to be put in Inventory.

OUTPUTS:
a) Plant Order for more Finished Goods.
b) Shipments of Finished Goods to the Customer.
c) Invoice and Packing Slip for items shipped to Customer.
d) Notice to Sales that items are Back Ordered.