Light

ankay212000 / ds_assignment Goto Github PK

View Code? Open in Web Editor NEW

0.0 2.0 1.0 24 KB

Data Structures Assignment

C++ 100.00%

ds_assignment's Introduction

DS_Assignment

Data Structures Assignment.
This repository is to complete Data structures assignment with the help of contributors, to get efficicent ways to solve problems.

How to contribute?

If first one to contribute in new assignment then make a file name as 'Assignment No.NUMBER".
Merge program in the file name 'Assignment No.NUMBER".
Upload the files with name as the question no. in the assignment.
To a PR,add comment: "Solved AS.NO. Q.NO". Example: "Solved 1 Q.2",This means Question number 2 of assignment 1 solution.

ds_assignment's People

Contributors

Watchers

Forkers

ds_assignment's Issues

2. Given two sorted arrays X[] and Y[] of size m and n each, merge elements of X[] with elements of array Y[] by maintaining the sorted order. i.e. Õll X[] with Õrst m smallest elements and Õll Y[] with remaining elements. The conversion should be done in-place and without using any other data structure.

Input:
X[] = { 1, 4, 7, 8, 10 }
Y[] = { 2, 3, 9 }
Output:
X[] = { 1, 2, 3, 4, 7 }
Y[] = { 8, 9, 10 }

Rearrange the array with alternate high and low elements Given an array of integers, rearrange the array such that every second element of the array is greater than its left and right elements. Assume no duplicate elements are present in the array.

 For example,

Input: {1, 2, 3, 4, 5, 6, 7}
Output: {1, 3, 2, 5, 4, 7, 6}
Input: {9, 6, 8, 3, 7}
Output: {6, 9, 3, 8, 7}
Input: {6, 9, 2, 5, 1, 4}
Output: {6, 9, 2, 5, 1, 4}

Write a DLList method isPalindrome() that returns true if the list is a palindrome, i.e., the element at position is equal to the element at position n-i-1 for all i. Your code should run inO(n) time.

Shuffle a given array of elements :- Given an array of integers, in-place shuße it. The algorithm should produce an unbiased permutation i.e every permutation is equally likely.

Design and implement an SLList method, secondLast(), that returns the second-last element of an SLList. Do this without using the member variable,n, that keeps track of the size of the list.

Find Pair with given Sum in the Array Given an unsorted array of integers, find a pair with given sum in it

For example,
Input:
arr = [8, 7, 2, 5, 3, 1]
sum = 10
Output:
Pair found at index 0 and 2 (8 + 2)
or
Pair found at index 1 and 4 (7 + 3)

Write a method, reverse() that reverses the order of elements in a DLList

Design and implement a MinQueue data structure that can store comparable elements and supports the queue operations add(x), remove(), size and min() operations, which returns the minimum value currently stored in the data structure. All operations should run in constant amortized time.

Design and implement an SLList method, reverse( ) that reverses the order of elements in an SLList. This method should run in O(n) time, should not use recursion, should not use any secondary data structures, and should not create any new nodes.

Write a method, truncate(i), that truncates a DLList at position i. After executing this method, the size of the list will be i and it should contain only the elements at indices 0,1,2..i-1. The return value is another DLList that contains the elements at indices i,i+1....n.

Design and implement SLList and DLList (doubly linked list) methods called checksize(). These methods walk through the list and count the number of nodes to see if this matches the value, n, stored in the list. These methods return nothing, but throw an exception if the size they compute does not match the value of n.

Design and implement a Minstack data structure that can store comparable elements and supports the stack operations , push() pop() and size(), as well as the min operation, which returns the minimum value currently stored in the data structure.

All operations should run in constant time.

Implement a Single Linked List(SLL) method to add two very large numbers.

Recommend Projects

React

A declarative, efficient, and flexible JavaScript library for building user interfaces.
Vue.js

🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
Typescript

TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
TensorFlow

An Open Source Machine Learning Framework for Everyone
Django

The Web framework for perfectionists with deadlines.
Laravel

A PHP framework for web artisans
D3

Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

javascript

JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
web

Some thing interesting about web. New door for the world.
server

A server is a program made to process requests and deliver data to clients.
Machine learning

Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Visualization

Some thing interesting about visualization, use data art
Game

Some thing interesting about game, make everyone happy.

Recommend Org

Facebook

We are working to build community through open source technology. NB: members must have two-factor auth.
Microsoft

Open source projects and samples from Microsoft.
Google

Google ❤️ Open Source for everyone.
Alibaba

Alibaba Open Source for everyone
D3

Data-Driven Documents codes.
Tencent

China tencent open source team.