HNBGU BCA Second Semester Previous Year 2019-20 Question Papers

HNBGU BCA Second Semester Previous Year 2019-20 Question Papers

Data Structure and file organization

NOTE: Attempt any five question. Each question carries 5 marks
  1. Convert the following in-fix expression into equivalent post-fix expressions:
    (a) A* (B+D) / E – ( F*G )

    (b) ( B-C )/E*( F-G )

  2. Why there is a need to convert an in-fix expression into post-fix notation?

  3. What are advantages and disadvantages of doubly linked list over singly linked list? In what cases linked list? In what cases linked list is better than array?

  4. Write down an algorithm that generates first fifty odd numbers and displays the total of these

  5. Consider the following binary search tree:



  6. Perform the deletion of node 0 from the given tree with proper explanation.

  7. Write down the following as recursive function:
    (a) A*b

    (b) Xa

    (c) N!

  8. Consider the following list of numbers:

    14,10,17,11,20,48,9,18,33

  9. Built a binary search tree for these numbers.

  10. What do you understand by divide and conquer algorithm?
Note: attempt any three questions. Each question carries 15 marks.

  1. Let a Binary Search Tree ‘T’ Is maintained in memory and an ITEM of information is given. Write an algorithm for funding the location of item in the binary search tree ‘T’.

  2. Write an algorithm to travers a linked list in reverse order with the help of recursion.

  3. What do you mean by circular queue? Write an algorithm for insertion and deletion in a circular queue.

  4. Describe Huffman algorithm, with the help of an example. Write down the Huffman algorithm.

  5. What do you mean by Hashing? Explain it with the help of suitable examples. What is collision in hashing? Discuss two methods for collision resolution.

  6. Write short notes on the following.
    • Threaded trees
    • AVL Trees
    • ADT
    • Application of stack


Environmental Science


NOTE: Attempt any five question. Each question carries 5 marks

  1. Describe food chain and food web with examples

  2. What is desertification? Enumerate different factors responsible for desertification

  3. What are the different health risks of nuclear hazards?

  4. Write a note on man wildlife conflict

  5. Describe any two renewable sources of energy.

  6. Describe energy flow in an ecosystem.

  7. Describe different levels of biodiversity.
NOTE: Attempt any three question. Each question carries 15 marks

  1. What is ecosystem? Describe structure and function of a river ecosystem.

  2. What is climate? Describe various factors responsible for climate change.

  3. Describe various factors responsible for ozone layer depletion. Give an account of national and international efforts made for ozone layer protection.

  4. What is solid waste? Describe integrated solid waste management practices.

  5. Define pollution. Describe causes and effect of air pollution.

  6. Write short notes on any three of the following:
    Kyoto Protocol
    Environmental movements
    Biodiversity hotspots
    Ex-situ conservation
    Environmental ethics  

  7. Write short notes on any three of the following
    • Threats to biodiversity
    • Consequences of deforestation
    • Convention on Biodiversity (CBD)
    • Conflicts over water
    • Wildlife (Protection ) Act, 1972

Database management system


NOTE: Attempt any five question. Each question carries 5 marks
  1. Differentiate between DBMS and file system.

  2. Explain data independency with example.

  3. Explain the SQL commands used in RDBMS with example.

  4. What do you mean by Normalization?

  5. What do you mean by database design?

  6. Explain the key constraints used in RDBMS.

  7. Why do you use relational algebra in RDBMS? Explain it in brief
Note: Attempt any three questions. Each question carries 15 marks.

  1. Design an E-R diagram for library system in an organization and explain each entity in detail.

  2. Explain the different types of normal form used in RDBMS with suitable examples in detail.

  3. What do you mean by schema? Explain the different components used in architecture of DBMS.

  4. Differentiate between the following with suitable examples:

    DBMS and RDBMS

    DML and DDL

    Primary key and Foreign key

  5. Explain the RDBMS and its components with an example

  6. Write short notes on any three of the following:

    DFD
    Functional dependency
    Joints and union operation
    Integrity constraints
    Triggers and Clusters

Programming in C++


NOTE: Attempt any five question. Each question carries 5 marks

  1. What is Object oriented programming? What are the advantages of object oriented programming?

  2. What are the different forms of inheritance supported by C++? Explain them with example.

  3. Define inline function. What are the guidelines that need to be followed for deciding if the function is to be used inline function?

  4. Explain the following:

    Data abstraction

    This pointer

  5. What is visibility mode? What are the different inheritance visibility modes supported by C++

  6. What do you mean by function overloading? When do we use this concept.
NOTE: Attempt any five question. Each question carries 15 marks

  1. (a) What are the elements of object oriented programming?

    (b) What are the base and derived classes?

  2. (a) What are the differences between static binding and late binding? Explain dynamic binding with a suitable example.

    (b) What are variables? List c++ rules for variables naming.
  3. (a) What are objects? Describe the syntax for defining objects with example.

    (b) What are constructors and destructors? Explain how they differ from normal functions.

  4. (a) What is operator overloading? Explain the importance of operator overloading.

    (b) Why is friend function not allowed to access members of a class directly although its body can appear within the class body?

  5. (a) Justify the need of virtual function in C++

    (b) What are streams? Explain the features of C++ stream I/O with C’s I/O system.

  6. (a) What are virtual destructors? How do they differ from normal destructors? Can constructor be declared as virtual constructors?

    (b) What is static binding and dynamic binding of functions? How is dynamic binding achieved in C++?

Post a Comment

0 Comments