Skip to content

This repository contains assignments I did as a part of a course I took on Data Structures and Algorithms

License

Notifications You must be signed in to change notification settings

vishal-ph/Data-Structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data-Structures

This repository contains assignments I did as a part of a course I took on Data Structures and Algorithms.

Assignment-1 contains multiplication of binary numbers using Naïve [O(n2)] and Karatsuba [O(nlog23)] Algorithms.

Assignment-2 is about implementation of Dynamics Arrays and then using it for the implementation of Stacks and Queues.

Assignment-3 takes input a directed graph and outputs whether the given directed graph is "atleast one way connected or not".

Assignment-4: Problem: Given integers R1......Rn and C1.....Cn, implement an algorithm that determines if there exists an nXn 0/1 matrix A such that for all i and j :

About

This repository contains assignments I did as a part of a course I took on Data Structures and Algorithms

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages