Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
52 views1 page

Suggestion-Data Structure and Algorithm-PCC CS 301

The document outlines various programming tasks including the implementation of stack and queue operations, linked list manipulations, and sorting algorithms. It also covers search algorithms, time complexity analysis, and data structure comparisons. Additionally, it mentions infix to prefix and postfix conversion as supplementary material.

Uploaded by

thenameisrul.amirulofficial
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views1 page

Suggestion-Data Structure and Algorithm-PCC CS 301

The document outlines various programming tasks including the implementation of stack and queue operations, linked list manipulations, and sorting algorithms. It also covers search algorithms, time complexity analysis, and data structure comparisons. Additionally, it mentions infix to prefix and postfix conversion as supplementary material.

Uploaded by

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

1. Develop an algorithm and code for PUSH and POP for array representation of stack.

2. Write an algorithm and code for all insertion operation and all deletion operation on
linkedlist.
3. Compare Linear Search and Binary Search with example.
4. Explain the difference between a circular linked list and a singly linked list
5. Write a code to insert a node of a linked list by taking the position from the user.
(Consider the position can be after node, in between, at the begining).
6. Write an algorithm and a code to implement queue with all basic operation.
7. Explain Asymptotic notation.
8. Write an algorithm to implement Stack with all basic operation(Including code).
9. Explain Stack ADT.
10. What is meant by time complexity? Find the time complexity of the following code
snippet:
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
c[i][j]=0;
for(k=0;k<n;k++)
c[i][k]+=a[i][k]*b[k][j];
}
}
(Practice all Time complexity related questions which was discussed in your class)
11. Explain Insertion sort, Bubble sort, Selection sort.(Including Algorithm)

(*Follow Infix to Prefix Conversion and Infix to Postfix Conversion


note which is uploaded in Google Classroom*)

You might also like