Muhammad Habib

60
1 |P a g e (RIPHAH INTERNATIONAL UNIVERSTY FAISALABAD CAMPUS) Department: Compter S!"en!e La# $or% Mana& o' Data Str!tre S#m"tte B*: M+amma Ha#"# (BSCS , r ) S#m"tte To: Mr-S*e M a."r Submission Date: January 22, 2015 Data Structure and Algorithms

description

kbjk., llkm;lmk;

Transcript of Muhammad Habib

3 | Page

(RIPHAH INTERNATIONAL UNIVERSTY FAISALABAD CAMPUS)

Department: Computer ScienceLab Work Manual of Data-Structure

Submitted By:

Muhammad Habib(BSCS 3rd)

Submitted To:Mr.Syed Muddasir

Submission Date: January 22, 2015

SR#TopicPage #

1Display array elements usingPointer04

2Implement the concepts ofinheritance05

3The concepts ofPolymorphism06

4Power Function07

5Structure Phone08

6Reverse String09

7Transpose11

8Implement a stack12

9Allocate the memorydynamically15

10Queue16

11Singly linked list19

12Doubly linked list28

13Find Factorial33

14Array Values Are Palindromeor not34

15Tower of Hanoi35

16Bubble Sort36

17Merge Sort38

18Quick Sort40

19Insertion Sort43

20Build Max Heap44

21Radix Sort47

22Binary Search49

23Linear Search51

24Binary Tree Operation53

25Swapping57

Write a code to display array elements using pointer.#include "stdafx.h"#include "iostream"using namespace std;int _tmain(int argc, _TCHAR* argv[]){ int no[5], i;int *ptr;cout