problem 1: Describe Linear and Non-Linear data structures with appropriate exs.
a) Give any five string handling functions with appropriate illustrations.
b) What do you mean by pointer? Give the benefits of pointers.
problem 3: prepare a procedure for PUSH, POP and display of elements on stack and as well describe applications of stack.
problem 4: describe the Binary tree traversals.
problem 5: Describe quick sort method and as well arrange the given elements into sorting order:
310, 285, 179, 652, 351, 423, 861, 254, 450, 520.
problem 6: What is an array? describe various types of arrays.
problem 7: Define the term algorithm. How do you analyze an algorithm?
problem 8: Describe about the operations to perform on the Queue.
problem 9: Describe about circular linked list.
problem 10: prepare a program on the circular queue by using arrays.