Scribd Logo
Upload

Welcome to Scribd!

  • B.C.A. C' PROGRAMMING AND DATA STRUCTURES JUNE 2009. First Year

    Uploaded by

    Sudhakar R
    26 views2 pages
    This document contains instructions for a BCA degree examination in C Programming and Data Structures. It outlines that the exam will be 3 hours long and worth a maximum of 60-75 marks. It divides the exam into 2 parts - Part A is worth 20-25 marks and contains 4-5 questions to answer, Part B is worth 40-50 marks and contains 4-5 longer questions. It lists the questions that candidates should answer in each part, with some candidates answering 4 questions and others answering 5, depending on their enrollment number. The questions cover topics like bitwise operators, library functions, variable naming rules, conditional operators, linear search, arrays, AVL trees, operator priorities, call by value vs reference,

    Original Description:

    Original Title

    B.C.A. ‘C’ PROGRAMMING AND DATA STRUCTURES JUNE 2009. First Year

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains instructions for a BCA degree examination in C Programming and Data Structures. It outlines that the exam will be 3 hours long and worth a maximum of 60-75 marks. It divides the exam into 2 parts - Part A is worth 20-25 marks and contains 4-5 questions to answer, Part B is worth 40-50 marks and contains 4-5 longer questions. It lists the questions that candidates should answer in each part, with some candidates answering 4 questions and others answering 5, depending on their enrollment number. The questions cover topics like bitwise operators, library functions, variable naming rules, conditional operators, linear search, arrays, AVL trees, operator priorities, call by value vs reference,

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    26 views2 pages

    B.C.A. C' PROGRAMMING AND DATA STRUCTURES JUNE 2009. First Year

    Uploaded by

    Sudhakar R
    This document contains instructions for a BCA degree examination in C Programming and Data Structures. It outlines that the exam will be 3 hours long and worth a maximum of 60-75 marks. It divides the exam into 2 parts - Part A is worth 20-25 marks and contains 4-5 questions to answer, Part B is worth 40-50 marks and contains 4-5 longer questions. It lists the questions that candidates should answer in each part, with some candidates answering 4 questions and others answering 5, depending on their enrollment number. The questions cover topics like bitwise operators, library functions, variable naming rules, conditional operators, linear search, arrays, AVL trees, operator priorities, call by value vs reference,

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 2

    Ws 6

    UG–818 BCA–02

    B.C.A. DEGREE EXAMINATION –


    JUNE 2009.

    First Year

    ‘C’ PROGRAMMING AND DATA STRUCTURES

    Time : 3 hours Maximum marks : 60/75

    PART A — (4 × 5 = 20 / 5 × 5 = 25 marks)

    Candidates with enrolment number starting with


    A4BCA and C5BCA should answer any FOUR
    from Qn. 1 to 6 and all others should answer any
    FIVE from Qn. 1 to 7 in Part A.

    1. Explain Bitwise Operators.

    2. Briefly explain the Library functions.

    3. List out the rules for naming variables.

    4. With suitable example, explain the use of


    conditional operator.

    5. Explain Linear search briefly.

    6. Discuss on representation of arrays.


    Ws 6

    7. What is an AVL tree? Give example.

    PART B — (4 × 10 = 40 / 5 × 10 = 50 marks)

    Candidates with enrolment number starting with


    A4BCA and C5BCA should answer any FOUR
    from Qn. 8 to 13 and all others should answer any
    FIVE from Qn. 8 to 14 in Part B.

    8. List the priority and associativity of various


    operators in C.

    9. Explain call by value and call by reference with


    suitable examples.

    10.Write a program to find the length of the given


    character string without using library functions.

    11.Explain the pointers expression with suitable


    example.

    12.Explain the procedure for implementing Queue


    operations.

    13.Briefly explain symbol table with an example.

    14.Explain file organisation in detail.

    ————————

    2 UG–818

    You might also like