Lovely Professional University 2010 B.Tech Computer Science and Engineering Assignment -1 Data structures and algorithm - Question Paper

PART: A

Q1: Delineate the concept of data kind in data structures.

Q2: provide a brief description of the different data structures known to you.

Q3: what are the concept of “Algorithm complexity” by taking suitable examples.

PART: B

Q4: explain the concept of “Big O Notation” by taking a few example.

Q5: provide a few illustrative examples for linked and sequential data structure
representation. How linked and sequential representation is beneficial in data structures?

Q6: what are the concept of The best, avg. & Worst cases analysis methodology.



LHST

Data Structures and Algorithms

Assignment - 1 Class    : A1801

Date of Allotment    : 17^th February 2010

Date of Submission :27^th February 2010 Date of Test    : 26^th February 2010

PART: A

Q1: Delineate the concept of data type in data structures.

Q2: Give a brief description of the various data structures known to you.

Q3: Elaborate the concept of Algorithm complexity by taking suitable examples.

PART: B

Q4: Discuss the concept of Big O Notation by taking some example.

Q5: Give some illustrative examples for linked and sequential data structure representation. How linked and sequential representation is beneficial in data structures?

Q6: Elaborate the concept of The best, average & Worst cases analysis methodology.

*********

Attachment: lovely-professional-university-2010-b-tech-computer-science-and-engineering-3096-1.pdf

Earning:   Approval pending.