Scribd
Upload
33 views2 pages

Department of BBA-CA Unit Test - 1

This document contains instructions for a unit test in Data Structure Using C. It has two sections worth a total of 20 marks. The first section contains 6 short answer questions worth 2 marks each and the second contains 3 longer answer questions worth 4 marks each. The test covers topics like defining data structures, measuring algorithm performance, asymptotic notation, pointers, self-referential structures, polynomials, and dynamic memory allocation functions. Students have 50 minutes to complete the test.

Uploaded by

Mangesh Deshmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views2 pages

Department of BBA-CA Unit Test - 1

This document contains instructions for a unit test in Data Structure Using C. It has two sections worth a total of 20 marks. The first section contains 6 short answer questions worth 2 marks each and the second contains 3 longer answer questions worth 4 marks each. The test covers topics like defining data structures, measuring algorithm performance, asymptotic notation, pointers, self-referential structures, polynomials, and dynamic memory allocation functions. Students have 50 minutes to complete the test.

Uploaded by

Mangesh Deshmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Department of BBA-CA

Unit Test -1
Class: SY-BBA (CA) Subject: Data Structure Using C

Time: 50 Min Total Marks: 20 Date:


_________________________________________________________________

Q.1 Attempt any 4 of the following: [4×2=8]

1. Define Data Structure.

2. How to measure performance of an Algorithm.

3. How to calculate count of Best, Worst and Average case?

4. What is Pointer to Pointer?

5. What is self referential structure?

6. What is Polynomial? How it is represented.

Q.2 Attempt any 3 of the following: [3×4=12]

1. Write a ‘C’ program for addition of two polynomials

2. Explain different types of Dynamic Memory Allocation Functions

3. Explain different types of Asymptotic notation in detail.

4. What is an Algorithm? Explain its characteristics in detail.


Department of BBA-CA

Unit Test -1
Class: TY-BBA (CA) Subject: VB.NET

Time: 50 Min Total Marks: 20 Date:


_________________________________________________________________

Q.1 Attempt any 4 of the following: [4×2=8]

You might also like