Skip to main content

BCA II Sem - Data Structures Using C Question Paper 2010


II Semester BCA Examination, May/June 2010
(O.S. Scheme)
COMPUTER SCIENCE
2BCA3 : Data Structures Using C
Time : 3 Hours                                                                                                                  Max. Marks : 80
Instruction : Answer any eight questions :

PART - A

1. What are primitive and non-primitive data structures? Give examples.
2. Write a C program to find the length of a string.
3. What is recursion? Mention its advantages.
4. Write an algorithm to insert an element into an array.
5. What is a deque? How is it different from a liner queue?
6. Write an algorithm to push an element into an array.
7. Define the following tree terminologies :
    a) Terminal node
    b) Height of tree
    c) Degree of a node
8. Explain linear search.
9. Explain time-space complexity of an algorithm.
10. What is Inter traversal of a tree?



Comments

Popular posts from this blog

B.com I Sem - Company Law and Secretarial Practice(CLSP) Question Paper 2011

I Sem B.com Examination, Nov/Dec 2011  (Semester Scheme) (2011-12 Batch and Onwards)  COMMERCE  Company Law and Secretarial Practice  Time : 3 Hrs                                                                                                     Max. Marks: 90  SECTION - A  1. Answer any 10 sub-questions. Each sub-question carries 2 marks (10x2=20) a) What are the different kinds of company ? b) Who is ‘Pro-tem Secretary’ ?  c) Who are the promoters of Company ?  d)  What is certificate of incorporation ?  e)  What is statutory report ?  f) What is Reserve Capital ?  g ) Who is a company secretary ?  h) What do you mean by statement in lieu of prospectus ?  i) What is meeting ?  j) What is Quoram ?  k) Who is a Director of a Company ? l) What is a share warrant ?