MATCSI 31: APPLIED MATHEMATICS - I
Hours per week :4
I.A
Marks: 25
Total Lecture Hours: 48
Exam Marks: 100
1. NUMERICAL ALGORITHMS
12
Hrs
Approximations and Errors - Significant Figures, Accuracy andPrecision,
Round Off and Truncation Errors. Algorithms to Compute Roots of Equations -
Bisection Method, Newton Raphson Method, Method of False Position.
Algorithms to Solve Linear Algebraic Equations - Gauss Elimination, Guass
Jordan, Gauss Seidel, LU Decomposition. Algorithms to Solve Ordinary
Differential Equations - Euler Method and Modifications, Runge Kutta II and
IV Order Methods.
2. FOURIER SERIES AND FOURIER TRANSFORMS
12 Hrs
Periodic Functions - Elle's Formula, Fourier Series of Even and Odd
Functions, Fourier Series of Functions of Arbitrary Period, Half Range
Expansion, Practical Harmonics. Definition of Fourier Transform, Cosine and
Sine Transforms, Inverse Transforms, Convolution, Applications of Fourier
Transforms.
3. PROBABILITY
9
Hrs
Axioms and Models, Conditional Probability, Baye's Rule - Examples. Random
Variables - Simple Examples, Discrete and Continuous Random Variables,
Jointly Distributed Random Variables, Distributions of Random Variables -
Examples. Expectation - Moments. Conditional Distributions and Conditional
Expectations. Stochastic Process - Bernoulli and Poisson Process.
4. STATISTICAL INFERENCE 9
Hrs
Random Sampling, Sampling Distributions, Parametet Estimation and Hypothesis
Testing, Regression, Correlation andAnalysis of variance.
5. MARKOV CHAINS
6 Hrs
Continous Parameter and Discrcte Parameter Markov Chains. Concept of a
Queue, The M/G/I and M/M/I Queuing Systems, Simple Analysis - Examples.
Text Books:
1. Steven C. Chapra and Raymond P.Canale, Numerical Methods for Engineers,
McGraw-Hill, 3rd Ed., 1998.
2. Grewal B.S., Higher Engineering Mathematics.
3. Miller, Freund and Johnson, Probability and Statistics for Engineers, 4th
Ed., PHI, 1990
4. K.S. Trivedi, Probability, Statistics with Reliability, Queuing and
Computer Science Applicatiotis, PHI, 1988.
Reference Books
1. V.Raj ararnan, Computer Oriented Numerical Methods, 2nd Ed., PHI, 1992.
2. Krishna Murthy and Sen, Numerical Algorithms, AEWP, 1991
3. McCormick and Salvadori, Numerical Methods in FORTRAN, PHI, 1992
4. L.Kleinrock ,Queuing Theory ,Vol I annd II.
Back
To Top
CSI 32 : DISCRETE MATHEMATICAL
STRUCTURES
Hrs Per Week :04
I.A.Marks
:25
Total Lecture Mrs :48 Exam.Marks:100
1. FUNDAMENTALS
10 Hrs
Sets and subsets, Operations on sets, Counting - Permutations, Combinations,
Pigeonhole principle, Recurrence relations.
2. LOGIC
6 Hrs
Propositions and logical operations, Conditional statements, Methods of
proof, Mathematical Induction.
3. RELATIONS AND FUNCTIONS
16 Hrs
Product sets and partitions, Relations and Digraphs, Paths in relations and
digraphs, Properties of relations, Equivalance relations, Computer
representation, Manipulation of relations, Transitive closure and Warshall's
algorithm.Functions - Functions for computer science, Permutation functions,
Growth of functions.
4. ORDER RELATIONS AND STRUCTURES
8 Hrs
Partially ordered sets, Extremal elements, Lattices, Finite Boolean
Algebras.
5 SEMIGROUPS AND GROUPS
8Hrs
Semigroups, Products and Quotients of Semigroups, Products and Quotients of
Groups.
Text Book
1. Bernard Kolman, Robert C Busby, Sharon Ross, Discrete athmatical
structures, Third Edition,PHI 1997. ( Chapters 1.1 to 1.3, 2, 3.1 to 3.3,
3.5, 4, 5, 7.1 to 7:5, 9 )
Reference Books 1. Lipschutz, Discrete Mathematics, Schauni's Series,
2. R Johnsonbaugli, Discrete Mathematics, Revued edition Macmillan
International,1989.
3. C L Liu, Elements of Discrete Mathematics, McGraw Hill 1986.
4. Trembly & Manohar, Discrete Mathematics with application to Computer
Science, McGraw Hill, 1988.
Back
To Top
CSI 33 : DATA STRUCTURES WITH C
Hours per week :4 I.A
Marks : 25
Total Lecture Hours: 48
Exam Marks: 100
1. Review of structures and pointers, Introduction to special features of C
8 Hrs
Register variables, Bitwise operators, Bit fields, Enumerations, Command
line parameters, Macros, Preprocessor statements. Dynamic Memory Allocation.
Files.
2. THE STACK
6 Hrs
Definition and Examples, Representation of stacks in C, Evaluation of
Postfix expression, Conversion ftom Infix to postfix.
3. RECURSION
4Hrs
Recursive definition and processes, Recursion in C,
Writing recursive programs, Efficiency of Recursion, GCD, Fibonacci,
Binomial coefflcients and Tower of Hanoi problems.
4. QUEUES AND LISTS
8 Hrs
The Queue and its sequential representation. Linked lists, Lists in C, Other
list structures.
5. TREES 8
Hrs
Binary trees, Binary tree representations, Trees and
their Applications.
6. SORTING
8 Hrs
General background, Quick Sort, Binary tree sorts, Heap sort -Heap as
priority queue, Sorting using a Heap, Heap sort procedure. Insertion Sorts -
Simple Insertion, Shell sort ,Address calculation sort, Radix sort.
7. SEARCHING
6 Hrs
Basic scarcil tcchniques- Algorithmic notation, Sequential Searching,
Searching an Ordered Table, Binary Search. Interpolation Search, Tree
Searching - Binary Search Tree Insertions and Deletions. Hashing - Resolving
Hash Clashes by Open Addressing.
Text Book:
1. Yedidyah Langsam, Moshe J Augenstein & Aaron M Tenenbaum, Data
Structures using C and C++,2nd Ed., PHI, 1997. ( Chapters 2, 3.1 to 3.3,
3.5, 4.1 to 4.3, 4.5,5.1,5.2, 5.5, 6.1, Selected Portions from 6.2 to 6.5,
7.1,Selected Portions from 7.2 and 7.4)
2. E. Balaguruswamy, Programming in ANSI C, 2nd Ed., TMH,1998 ( Chapters 11,
12 and Selected portions from 13, 14 and Appendix I)
Reference Books:
1. Robert L Kruse, Data Structures and Program Design using C, PHI. 2.
Trembly & Sorenson, Data Structures, McGraw Hill.
Back
To Top
CSI 34 : LOGIC
DESIGN
Hours per week :4
I.A Marks: 25
Total Lecture Hours :48 Exam
Marks: 100
Note: Use of IEEE/ANSI standard logic symbols is recommended in
addition to conventional symbols (Ch. 3-15; 5-10; 6-18; 7-10; 7-23; 9-10; of
Tocci and Widmer book)
1. SIMPLIFICATION OF BOOLEAN FUNCTIONS
(10
Hrs)
The K- map method (up to 4 variables), SOP and P0S simplification, NAND and
NOR implementation, don't care conditions. Quine-MeCluskey tabulation method
(5-variables, Decimal notation) - determination and selection of prime
implicants.
2. COMBINATIONAL LOGIC
6 Hrs
Design procedure, design of adders, subtractors, and code converters.
Analysis procedure, multi level NAND and NOR circuits, Ex-OR and equivalence
functions.
3. COMBINATIONAL LOGIC WITH MSI AND LSI
8
Hrs
Application of typical TTL IC components like Binary Parallel adder (74283),
Carry look ahead adder (74182), BCD adder (8283), Comparator (7485),
decoders(74138, 7442), encoder (74148), multiplexer (74157).
4. SEQUENTIAL LOGIC
12
Hrs
NAND / NOR gate latch, clocked signals and clocked flip flops (S-C, J-K, and
D), J-K master-slave flip flop. Ripple (asynchronous) counters (mod 2N and
mod mod < 2N), IC asynchronous counters (7490, 7493), asynchronous down
counter, cascading of counters, presettable counter (74193). Analysis of
clocked sequential circuits, design of clocked sequential circuits, state
reduction, state assignment, flip flop excitation tables, design of
synchronous counters. Shift registers, universal shift register ((74194),
Ring counter, Johnson counter. Schmitt trigger, monostable multivibrator,
clock generator circuits
5. MEMORY DEVICES
12
Hrs
Terminology, memory operation, CPU - Memory connections,ROM and its
architecture, Types or ROMs - PROM, EPROM,EEPROM, CDROM, Flash memory. ROM
applications,Programmable Logic Devices. RAM and its architecture, SRAM,
DRAM - structure andoperation ,read/write cycles, refreshing, technology.
Expanding word size and capacity. Special memory functions
Text Books:
1.Morris Mano, Digital logic and Computer design, PHI 1998 (Chapters
3,4,5,6,and 7) 2.Tocci and Widmer, Digital Systems, Seventh edition,
Prentice Hall 1998 (Chapters 5,7,and 11)
Reference Books:
1. Bartee, Computer architecture and Logic design, McGraw hill 1991 2.
Nasliclsky, Introduction to digital technology, John Wiley 3. Fletcher, An
Engineering approach to Digital design, PIll 1990
Back
To Top
CSI
36L DATA STRUCTURES LAB
Hours per week : 3
Exam Marks: 100
Sessional Marks : 25
Ia. Write a C program to demonstrate the working of a Stack of size N
using an array. The elements of the Stack may assumed to be of type Integer
or Real. The operations to be supported are:
1. PUSH
2.
POP
3. DISPLAY
The program should print appropriate messages for Stack Overflow, Stack
Undertlow and Stack Empty. You may write seperate functions to detect these
cases.
lb. Write a C program to evaluate a valid Suffix expression using
Stack. Aussme that the suffix expression is read as a single line consisting
of non-lnegative single digit operands and binary arithmetic operators. The
arithmetic operators allowed are +(ADD),
- (SUBTRACT),
*
(MULTIPLY), and
/ (DIVIDE).
2. Write a C program to convert and print a given valid fully
parenthesized Infix arithmetic expression to Suffix expression. The
expression consisting of single character (letter or digit) as operands and
+,-, *, / as operators. You may assume that only binary operators are
allowed in the expression.
3. Write a C program to convert and print a given valid fuIly
parenthesized Infix arithmetic expression to Prefix expression. The
expression consisting of single character (letter or digit) as operands and
+. -.*, / as operators. You may assume that the Infix string is read from
right to left and that the Prefix string is created from right to left.
4a. Write a C program to simulate the working of an ordinary Queue of
integers using an array. Provide the following operations: l.QINSERT 2.
QDELETE 3.QDISPLAY Write functions to check the Queue status - QEmpty, QFuIl.
4b. Write a program to design a Priority Queue which is maintained as
a set of Queues (assume a maximum of 3 Queues). The elements are inserted
based upon the given priority. For example (3, 34) will be inserted to 3rd
Queue with the elemental value 34.. The deletion of an elernent is to be
done starting from the 1st Queue, if it is not empty. In case if it is
empty, the elements from the 2nd Queue will be deleted, and so on.
5. Write a C program to simulate the working of a CircuIar Queue of
names using an array. Provide the following operations:
1. CQINSERT 2. CQDELETE
3. CQDISPLAY
Write functions to check the Queue status - QEmpty, QFulI.
6. Using Dynamic variables and Pointers, write a C program to
construct a Singly Linked List - consisting of the following informafions in
each node:
Job_id (Integers ), Job_name ( Character Suing ) Job_desc (Character String)
The operations to be supported are:
1. LINSERT - Inserting in the front of the List.
2. LDELETE - Deleting a node based on Job_id.
3.LSEARCH - Searching a node based onJob_id
4. LDISPLAY - Displaying all the nodes in the List.
7. A deque is a list in which items can be added or deleted from either
end of the List. Implement the following C functions to simulate the working
of such a Deque of integers, using Pointers and Dynamic variables.
1. Remleft
4. InsertRight
2. RemRight 5.
Display.
3. InsertLeft
8. Write a C program, using Dynamic variables and Pointers, to
perform the following operations: 1. Construct two Ordered ( Ascending )
Singly Linked Lists. 2. Combine these two ordered lists into a single
ordered List.
9. Using the Circular Linked List Data St:ructure write a program in
C to Add two long positive integers. The Circular lists can have Header
nodes and the numbers are to be inputted in a normal way. Each node in the
list contains a single digit of the number.
10. Write a program in C using dynamic variables and pointers to
support the following operations on Doubly Linked List of integers.
1. Create a Doubly Linked list by adding each node at the front.
2. Insert a new node to the left of the node whose key value is read as an
input.
3. Delete all occurrences of a given key, if it is found,otherwise display
appropriate message.
4. Display the contents of the List
11. Write a C program to implement an Ascending Priority Queue
(assume integer data type) as a Binary Search Tree. The program should
support the following operations:
1. Pqlnsert
2. PqminDelete
Preorder and Postorder-to display tile elements in the
Tree.
12. Using Pointers and Dynamic variables, Construct a Binary Search
Tree (BST) of integers. Write C functions to do the following:
1. Given a key, perform a search in the BST. If the key is found then
display "Key Found", else insert the key in BST.
2. While constructing the BST, do not add any duplicates.
3. Display the Tree using any one of the traversal Methods.
13. Write a C program to evaluate a given expression (the operands of
the expression may all be assumed as single character integer variables, the
values of which may be obtained from the user separately) using an
Expression Tree.
14. Write a C program to construct a Multilinked representation of a
Sparse Matrix. Assume that the Matrix is of dimension M x N, where M is tile
number of rows and N is tile number of columns. Using the Multilinked
representation , write a function to add two Sparse Matrices.
15a. Write a C program to sort a list of N elements of integer type
using the Quick Sort Algorithm.
15b. Write C program to simulate the working of Towers of Hanoi
problem for n disks. Print the number bf moves taken by your program.
Back
To Top
LD LAB
Hours per week : 3
Exam Marks: 100
Sessional Marks : 25
Note: General purpose Digital Trainer kit is to be used. Kits meant
for only specific experiments should not be used. Experiments could be
conducted using ICs of any logic family
1.Design a Half adder and a Full adder using NAND gates only. Cascade
them to implement a 2 bit binary adder.
2.Design and implement Exccss-3 to BCD code converter using logic
gates. (Choice of Logic gates left to the student)
3.Design and implement using NAND gates:
a. 4:1 multiplexer
b. 2:4 decoder
4.Design and implcment the following using 4-bit adder chip and
gates.
a. Excess-3 to BCD code converter
b. BCD to Excess-3 code converter
5.Design and implement a full adder using a multiplexer. Also
iniplement a multiplexer tree using 3 multiplexers.
6.Design and implement using decoder and other gates
g. Full adder
h. Full subtractor.
7.Design and implement a 3 variable Boolean SOP expression using 2
numbers of 4:1 multiplexer IC.
8.Design and implemcnt a 3 stage asynchronous counter using J-K flip
flops to count down from 7 to n (n > 0). Display result on discrete LEDs
and the waveform on CR0. 9.Design and implement asynchronous counter
using a Decade counter IC to count up from 0 to n (n <9). Display count
value on 7 segment LED display using BCD to 7 segment code converter IC.
1 0.Design and implement to display result suitably: k. Asynchronous
counter using 4 bit binary counter IC to count up from 0 ton (n <=15). I.
An asynchronous counter to count up to FFH using 2 stages of such an IC.
11. Design and implement Mod n (n <8) synchronous counter using
flip flops. Display result suitably.
I 2.Design and implement a 3-stage up/down counter that count. from a
preset value using Decade presettable counter ICs Display result suitably.
13. Design and implement using 4-bit shift register IC: n. Johnson
counter o. Ring counter .
14.Design and implement the following: a. Oscillator for a given
frequency using Schmitt trigge inverter and RC components. b. Crystal
controlled clock using CMOS inverters.
15.Design and implement a monostable multivibrator to generate pulse
of given duration using a non-retriggerable
Back
To Top
ISE 35 : STRUCTURED COBOL PROGRAMMING
Hrs Per Week :04 IA
Marks:25
Total Lecture hrs : 48 Exam
Marks:100
1. BASIC CONCEPTS 6 Hrs
Introduction to COBOL, COBOL standards, Example programs and an overviewof
the divisions of a COBOL program, coding rules. Features of Identification
and Environment Divisions. Introduction to Data Division: File Section and
Working- Storage Section.
2. BASIC FEATURES OF PROCEDURE DIVISION
6 Hrs
Format of the Procedure Division, Statements typically coded in the main
module, Processing input records and producing output records, Coding
Comments. The MOVE statements, Numeric and Non-numeric MOVE and other
options of MOVE, Printing output, Edit flinctions. Interactive processing
using SCREEN section.
3. COMPUTATION, DECISION MAKING
6 Hrs
Basic arithmetic verbs and their options, COMPUTE statement, Use of signed
numbers, USAGE clause, Intrinsic flinctions. Simple IF statement and other
options of IF statement, Condition Names, EVALUATE statement for CASE
structure.
4. ITERATION, DATA VALIDATION
6 Hrs
Review of simple PERFORM, Iteration using different types of PERFORM, Nested
PERFORM, Test After option. Need and Techniques for data validation, INSPECT
statement, Error handling, Program Interrupts.
5. ARRAY PROCESSING AND TABLE HANDLING
6Hrs
Single-level OCCURS clause, Processing arrays and Tables, Use of SEARCH,
SEARCH VARYING and SEARCH ALL statements, Multiple-level OCCURS clause.
6. SEQUENTIAL FILE PROCESSING, SORTING AND MERGING
6 Hrs
Overview, Sequential file updating (Creating a new master, Rewriting records
on disk. SORT statement, INPUT/OUTPUT Procedures, MERGE statement.
7. INDEXED AND RELATIVE FILES, MODULAR DEVELOPMENT
6 Hrs
System considerations for organization of disk files, Indexed files
(creation, updating, retrieval), Relative files (creation, updating,
retrieval). Modular development using COPY, CALL statements, Text
Manipulation with STRING and UNSTRING statements.
8. CONTROL BREAK PROCESSING, REPORT WRITER
6 Hrs
Introduction to control Break processing, Programming for Single-level and
multiple-level control breaks. Benefits of REPORT WRITER module, Report
Section in the Data Division, Procedure Division Statements.
Text Book:
1. Stern and Stern, Structured COBOL Programming, Eighth Edition, JohnWiley,
1997. (Chapters 1, 2,3,4,6,7,8,9,lO,11,12,13,14,15,16,17)
Reference Books:
1 Robert T. Graver, COBOL: From Micro to Mainframe, Third Edition,Pentice -
Hall, 1998. 2. Welburn, Structured COBOL: Fundamentals and Style, Fourth
Edition,McGraw-Hill, 1995.
3. Roy, M. K, and Dastidar Ghosh, D: COBOL Programming, Tata McGraw Hill,
1982.
Back
To Top
ISE 38L DATA PROCESSING LABORATORY
Notes
1 .The following programs are to be developed using COBOL-85, or
later standards.
2.Use structured programming practices 3.Certain problems require the
availability of certain data files. The institute must make these data files
available to the students during examination.
------------------------
1 .a) ASSUME that SALES_AMT is a numeric data item with PlC clause of
999 v99. Discount is calculated as shown below:
SALES_AMT >500 Discount is 10%
200<=500 Discount is 5%
100<=200 Discount is 2%
SALES_AMT <=100 No Discount
NET AMT is to bc calculated as SALES_AMT - DlSCOUNT :
Where DISCOUNT is SALES_AMT * DISCOUN_RATE.
Write a COBOL program which ACCEPTs the SALES_AMT from keyboard , calculates
the NET_AMT and displays SALES_AMT ,DISCOUNT_RATE, DISCOUNT and NET_AMT.
Display the SALES_AMT and NET_AMT as edited fields using $ and Check
protection characters.
b)Modify the above program in the following way: There are 10
transactions. ACCEPT the values of SALES_AMT from the user and store them in
the array. At the end, determine the number of transactions in each of the
above 4 categories of sales and display these values.(Use the SEARCH Verb)
2.a) Create a sequential file with the following record layout:
Field
Size
Type
EMP_ID
5
Alphanumeric
FILLER
25
Alphanumeric
M_SALARY
5
Numeric (No decimal position) FILLER
45
Alphanumeric
ACCEPT the relevant data from the keyboard. Ensure that EMP_ID is in
ascending order. If an out_of_order record is entered, display an error
message; do not write this record to the file.
b) ACCEPT the EMP_ID from keyboard and search for the record with
matching EMPJD field in the sequential file created in part (a). If the
record is found, display all the details of the record; otherwise display a
suitable message.
3.Assume that OLD_MASTER is a sequential file with records in
sequence by M_ACCT_NO field and the record layout as shown below:
M_ACCT_NO
PlC 9(5)
AMT_DUE
PlC
9(4)V99
FILLER
PlC X (69)
TRANS FILE is also a sequential file with records in sequence by T_ACCT_NO
field and the record layout as shown below:
T_ACCT_NO
PIC9(5)
TRANS_AMT
PlC
9(4)V99
FILLER
PlC X (69)
You can assume that these two files are already available.
Develop a COBOL program to create a sequential file called NEW_MASTER, which
contains the updated data. The record layout of NEW_MASTER is same as the
record layout OLD MASTER.
The update is performed as follows:
If the OLD_MASTER has a record with a M_ACCT_NO matching the T_ACCT_NO of a
record from TRANS_FILE the AMT_DUE field of OLD_MASTER is added to the
TRANS_AMT field of the TRANS_FILE to get the AMT_DUE field for the record of
the NEW_MASTER. The M_ACCT_NO field will be the same. Otherwise the records
from the OLD_MASTER, TRANS_FILE are copied to NEW_MASTER. Note that the
records in the NEW_MASTER also must be in sequence by the M~ACCT_NO field.
You can assume that there will be, at most, one transaction record per
master record.
Display the updated data.
4.Create a sequential data file with the following record layout
Field
Size
Type
STUDENT_ID 14
Alphanumeric
S_NAME
20
Alphanumeric
BRANCH
4
Alphanumeric
CUM_PER
4
Numeric(99V99)
COLLEGE
20
Alphanumeric
FILLER
18
Alphanumeric
The data is obtained using SCREEN section and after the creation, all data
is displayed using the SCREEN section.
5.Assume that two files OLD_MASTER and TRANS_FILE as described in
problem 3 are available. In other words, assume that OLD_MASTER is a
sequential file with records in sequence by M_ACCT_NO field and the record
layout as shown below:
M_ACCT_NO PlC 9(5)
AMT_DUE
PlC 9(4)V99
FILLER
PICX(69)
TRANS_FILE is also a sequential file with records in sequence by T_ACCT_NO
field and the record layout as shown below:
T_ACCT_NO PlC
9(5)
TRANS_AMT PlC
9(4)V99
FILLER
PlC X(69)
You can assume that these two files are already available.
Develop a COBOL program to create a sequential file called NEW_MASTER, which
contains the updated data. The record layout of NEW_MASThR is same as the
record layout of the OLD_MASTER.
The update is performed as follows:
If the OLD_MASTER has a record with a M_ACCT_NO matching the T_ACCT_NO of a
record from TRANS_FILE the AMT_DUE field of OLD_MASTER is added to the
TRANS_AMT field of the TRANS_FILE to get the AMT_DUE field for the record of
the NEW_MASTER. The M_ACCT_NO field will be the same.
If the TRANS_FILE has a record for which there is no matching record in the
OLD_MASTER, do not write it to NEW_MASTER. Instead, display the record along
with suitable message and continue the processing.
The other records of OLD_MASTER are to be copied to the NEW_MASTER. Note
that the records in the NEW_MASTER also must be in sequence by the M_ACCT_NO
field.
You can assume that there will be, at most, one transaction record per
master record.
Display the updated data
6.Assume that a sequential file STUDENT, as described in problem 4 is
available to you. In other words, this file has the record layout as
described below:
Field
Size
Type
STUDENT_ID
14
Alphanumeric
S_NAME
20
Alphanumeric
BRANCH
4
Alphanumeric
CUM_PER
4
Numeric(99V99)
COLLEGE
20
Alphanumeric
FILLER
18
Alphanumeric
Sort the file into descending sequence by CUM_PER within ascending sequence
by BRANCH,but eliminate, before sorting, all records that have CUM_PER less
than 60.00. (Use INPUT procedure.) Display the records that have been
eliminated and also display the sorted file.
7.Assume that two files, T_FILEI and T_FILE2 both of type TRANS_FILE
as described in problem 3 are available. In other words, both these files
have the following record layout:
T_ACCT_NO
PlC
9(5)
TRANS_AMT
PlC
9(4)V99
FILLER
PlC
X (69)
Create a NEW_FILE by merging the above two files and display the records in
the merged file. Determine the count of transaction numbers that appear in
both the files (using OUTPUT procedure) and display this count also.
8.a) Assume that a sequential file OLD_MASTER as described in problem
3 is available. In other words , this file has the following record layout :
M_ACCT_NO PlC
9(5)
AMT_DUE
PlC
9(4)V99
FILLER
PlC X(69)
Using the data from this file, create an indexed file indexed by the field
M_ACCT_NO.
b) Update the records in the indexed file created above by ACCEPTing
the M_ACCT_NO and AMT_DUE field values from keyboard. If the specified
record is not found, display suitable error message. After the updating the
specified records, display the contents of all the records in the file.
9.Assume that sequential file OLD_MASTER as described on problem 3 is
available. In other words, this file has the following record layout:
M_ACCT_NO PlC
9(5)
AMT_DUE
PlC 9(4)V99
FILLER
PlC X (69)
Using the data from this file , create a relative file based on the field
M_ACCT_NO. Assume that there are no more than 100 records. The relative file
must therefore have approximately 100 record slots only. You must develop a
suitable hashing algorithm. You may ignore the collision problem. (If a
collision occurs, display suitable message; do not write this record to the
file.)
After the file, ACCEPT a value for M_ACCT_NO from the keyborad and display
the matching record,if present;otherwise dispaly a suitable message.
10.Assume that an indexed file MASTER_IND with the record layouts as
describe in problem 3 is available. In other words,this file has the
following records layouts:
M_ACCT_NO PlC 9(5)
AMT_DUE PlC 9(4)V99
FILLER
PlC X (69)
Develop a menu-driven COBOL program for pen following tasks:
a) Add new record
b)
Display an existing record.
The program must include necessary error handling.
11 .Assume that an indcxed file MASTER_IND with the record layout as
described in problem 3 is available. In other words, this file has the
following record layout:
M_ACCT_NO PlC
9(5)
AMT_DUE
PlC
9(4)V99
FILLER
PlC
X (69)
Develop a menu-driven COBOL program to perform the following tasks:
a) Delete an existing record
b) Display an existing record The program must include necessary error
handling.
1 2.Create an indexed file with the record layout as described below:
M_ACCT_NO PlC 9(5)
AMT_DUE PlC
9(4)V99
FILLER
PlC X (69)
The data is obtained using SCREEN section and after creation, display all
the records using again SCREEN section.
13.Assume that a sequential file STUDENT with the record layout r as
described in problem 4 is available to you. In other words this file has the
following record layout:
Field
Size
Type
STUDENT_ID
14
Alphanumeric
S_NAME
20 Alphanumeric
BRANCH
4
Alphanumeric
CUM_PER
4 Numeric(99V99)
COLLEGE
20
Alphanumeric
FILLER
18
Alphanumeric
Further ,assume that the records are in sequence by branch within a sequence
by college.
Print a summary report of the average marks (CUM_PER filed) for each branch
within each college. Each college's statistics must start on a new page.(Use
Control Break processing concepts; do not use the report writer future.)
14.Assume that a sequential file with record layout as described in
problem 4 is available to you. In other words this file has the following
record layout:
Field
Size
Type
STUDENT_ID 14
Alphanumeric
S_NAME
20
Alphanumeric
BRANCH
4
Alphanumeric
CUM_PER
4
Numeric(99V99)
COLLEGE 20
Alphanumeric
FILLER
18
Alphanumeric
Further, assume that the STUDENT_ID field consists of two characters
representing year,3 characters representing the college, 3 characters
representing the branch and 3 characters representing the roll-number; with
'I' separating these sub-fields. The output requires this field to be
separated into individual fields. Write a routine called UNSTR to do this
job using UNSTRING statement. Write a program which displays the individual
fields of the STUDENT_ID field of the first two records in the above file by
calling the UNSTR routine.
15.Assume that a sequential file STUDENT_US with record layout as
described in problem 4 is available to you. In other words this file has the
following record layout:
Field Size Type
STUDENT_ID
14 Alphanumeric
S_NAME
20
Alphanumeric
BRANCH
4
Alphanumeric
CUM_PER
4
Numeric(99V99)
COLLEGE 20
Alphanumeric
FILLER
18
Alphanumeric
The records are not in any specific order. There are a total of 3 colleges
and 3 branches in each college. Determine the average marks for each branch
in each col1eg~ and display the results. (Use arrays. Control Break
processing cannot be used as we are given that records need not be in
order.)
Back
To Top
