Scribd
Upload
216 views4 pages

Data Structure Assignments Overview

This document contains 4 assignments on data structures from Gurgaon Institute of Technology & Management. Each assignment contains 4 questions about topics such as stacks, queues, linked lists, trees, sorting, and searching algorithms. The faculty member assigning these questions is Akshat Agrawal and they relate to concepts like pointers, recursion, divide and conquer, and analyzing time and space complexity.

Uploaded by

api-3747330
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
216 views4 pages

Data Structure Assignments Overview

This document contains 4 assignments on data structures from Gurgaon Institute of Technology & Management. Each assignment contains 4 questions about topics such as stacks, queues, linked lists, trees, sorting, and searching algorithms. The faculty member assigning these questions is Akshat Agrawal and they relate to concepts like pointers, recursion, divide and conquer, and analyzing time and space complexity.

Uploaded by

api-3747330
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

GURGAON INSTITUTE OF TECHNOLOGY &

MANAGEMENT

Subject:- Data structure Assignment no:- 1


Faculty name:- Akshat Agrawal

Que:1 Write a C program using pointers to implement a stack with all the

operations.

Que:2 Write a program to convert a given prefix expression to postfix

expression using stacks.

Que:3 Declare a circular queue of integers such that F points to the front

and R points to the rear. Write functions

a). To insert an element into queue

b). To delete an element from queue


GURGAON INSTITUTE OF TECHNOLOGY &

MANAGEMENT

Subject:- Data structure Assignment no:- 2


Faculty name:- Akshat Agrawal

Que:1 Define input-restricted deque as deque in which insertion is restricted

to one end and deletion can be made at either end. Write routines to

implement operations on this deque

Que:2 What is a linked list. Explain various operations performed on linked

lists with suitable algorithms

Que:3 Define a doubly linked list. Write an algorithm to insert and delete a

node in a doubly linked list.

Que:4 Explain AVL tree & its implementation


GURGAON INSTITUTE OF TECHNOLOGY &

MANAGEMENT

Subject:- Data structure Assignment no:- 3


Faculty name:- Akshat Agrawal

Que:1 Prove that a binary tree with n leaves contains 2n-1 nodes

Que:2 Explain a procedure for preorder traversal of a binary tree with an

example in detail. Analyze the time complexity of this procedure.

Que:3 How to implement path matrix by an aaray

Que:4 Define hash function with an example & its application.


GURGAON INSTITUTE OF TECHNOLOGY &

MANAGEMENT

Subject:- Data structure Assignment no:- 4


Faculty name:- Akshat Agrawal

Que:1With the help of an example determine how to calculate the space

and time complexity

Que:2 Write in detail about the following

a) divide and conquer algorithm

b) recursion

Que:3 Write an algorithm for quick sort. What is its time complexity.

Que:4 Write a C program to search for a given element in the integer

array using binary search

You might also like