Scribd
Upload
92 views1 page

Data Structures and Algorithms Overview

The document contains questions from a data structures exam for a BCA 4 course. It asks students to define Big O notation and its advantages, provide two examples of problem solving techniques, describe stacks and how they are implemented, define data structures and list two elements, and write programs to implement bubble sort and linear search on arrays.

Uploaded by

Sunil
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
92 views1 page

Data Structures and Algorithms Overview

The document contains questions from a data structures exam for a BCA 4 course. It asks students to define Big O notation and its advantages, provide two examples of problem solving techniques, describe stacks and how they are implemented, define data structures and list two elements, and write programs to implement bubble sort and linear search on arrays.

Uploaded by

Sunil
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/ 1

Test: Data Structure Chapter 1 2 BCA 4

Write a short note on Big 'O' Notations? Give its advantages? [2]

What is meant by problem solving techniques? Give any two examples? [3]

Write a short note on Stack? How are they implemented? [5]

What is meant by Data Structure? What are its advantages? List any two

data structure elements? [5]

Write a program to implement Bubble sort in array ? [5]

Write a program to implement linear search using array? [5]

You might also like