Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Home / Developers / archana77archana
Developer Profile

archana77archana

Discovered public repositories for archana77archana in the GitHub catalog.

↗

archana77archana/swot

Identify email addresses or domains names that belong to colleges or universities. Help automate the process of approving or rejecting academic discounts.

↗

archana77archana/DBMS

Given functional dependencies of the type a ® b, check if there is any extraneous attribute in a.

↗

archana77archana/impress.js

It's a presentation framework based on the power of CSS3 transforms and transitions in modern browsers and inspired by the idea behind prezi.com.

↗

archana77archana/Heap

A binary heap is a data structure created using a binary tree with two additional constraints: – The shape property : the tree is a complete binary tree ; that is all the levels of the tree, excepts possibly the l ast one (deepest) are fully filled, and if the last level of th e tree is not complete, the nodes of that level are filled from left to right.

↗

archana77archana/transactionata

Transactionata: Transactional dynamic test data for Rails Tests. Set up your models and factories in a block that will be executed once and then rolled back by hooking into ActiveRecord's built-in fixture transactions

↗

archana77archana/Binary_Search_Tree

A data structure accessed beginning at the root node. Each node is either a leaf or an internal node. An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings . Contrary to a physical tree, the root is usually depicted at the top of the structure , and the leaves are depicted at the bottom .

↗

archana77archana/Stack_Data-Structure

A stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push , and removal of an entity, known as pop . A stack can be generally defined as a linear list of items in which all additions and deletions are restricted to one end that is top .

↗

archana77archana/Data-Structures

Data Structures are something which is really needed in our coding process. Whenever you need to have large data bases you use data structures. You have stack, linked lists, vectors, trees etc. as data structures which are efficient ways of storing data's.

FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.

SPONSORED Sponsored Partner