Assam University 2007 B.C.A Computer Application TDC Part-I Honours --- Second - Question Paper

NTS-07/ BCA-2 /387

2007
BACHELOR IN COMPUTER APPLICATION
(Honours)
Second Paper (BCA-102)
(Data Structure and Programming with FORTRAN and C)
TDC Part-I

Full Marks : 70
Pass Marks : 21

Time : three hours

The figure in the margin shows full marks for the ques.
Use separate ans booklet for separate Group

GROUP –A
(Data Structure)

Full Marks: 35
Pass Marks: 10

ans 1 ques. from every Unit

UNIT –I

1. (a) Distinguish ranging from the data structures ‘Array’ and ‘Linked List’ giving examples. 3
(b) provide an algorithm to transverse a linear array of n integers to obtain out the integers
greater than 100. four

2. (a) What is a ‘string’? Name the structures used to store and represent strings. one + one = 2
(b) provide an algorithm for searching a linked list when the list is unsorted. 5

UNIT –II

3. (a) What is a ‘Stack’? elaborate the operations on stack? one + two = 3
(b) How do you represent stacks by a Singly Linked List? 4

4. (a) Mention the advantages and disadvantages of recursive algorithms over non-recursive
algorithms. provide the recursive version of the function to generate Fibonacci numbers.
two + 3=5
(b) What is ‘deque’? 2

UNIT –III

5. (a) What is a ‘tree’? describe a ‘binary tree’ one + three = 4
(b) Represent the algebraic expression X as a binary tree such that
X = (a-b) / ((c * d) + e) 3

6. discuss with examples, the rebalancing of the AVL tree after insertion of 1 element into it.
7

UNIT –IV

7. describe the subsequent terms and provide examples: two + two + three = 7
(a) Complete graph
(b) Direct graph
(c) Magnetic disk

8. discuss a technique for finding the shortest path ranging from 2 nodes in a direct graph. 7

UNIT –V

9. provide an algorithm for ‘Insertion Sort”. Apply the algorithm to sort the subsequent elements : four + three = seven

77, 33, 44, 11, 88, 22, 66, 55

10. Mention how linear search is advantageous over binary search. provide an algorithm for linear search. What is the time complexity of your algorithm? two + three +2 = 7

GROUP –B
(Programming with FORTRAN and C)

Full Marks: 35
Pass Marks: 11

ans 1 ques. from every Unit

UNIT –VI

11. provide the flowchart and write an algorithm to learn an integer n and finf out the prime numbers up to n . 7

12. elaborate the data kinds available in FORTRAN? Write a FORTRAN program to learn number of days and then compute and print number of years, months and days in it. 2+5 = 7

UNIT –VII

13. Distinguish ranging from functions and subroutines in FORTRAN. Write a function in FORTRAN to obtain factorial of an integer. three + four = 7

14. Write a FORTRAN program to obtain out all roots of a quadratic formula of the form

Ax2 + Bx + C = 0

UNIT –VIII

15. What do you mean by ‘constants’ in C? discuss with examples how various kinds of constants are represented in C. How are the ‘unsigned integer constants’ and ‘long integer constants’ various from the ordinary integer constants? one + four + two = 7

16. Write a C program to store a list a list of integers in an array and then to obtain out the largest and smallest integers, and also the avg. of the integers. 7

UNIT –IX

17. What is a ‘pointer’? Write a C program using pointers to learn a line of text and then count the total numbers of ‘vowels’ and ‘consonants’ in it. one + six = 7

18. Mention the advantages of using functions in C programs. What is the significance of the keyboard ‘void’? Write a function in C to take 3 integers as argument and return the largest. two + two + three = 7

UNIT –X

19. explain the significance of the various file opening modes in C. Write a C program to learn the contents of a data file and display them on the screen. three + four = 7

20. What is the purpose of a buffer area while working a stream-oriented data file? How is a buffer area defined? Write a C program to copy 1 file to a different. one + one + five = 7

* * *

Earning:   Approval pending.