Skip to content

Latest commit

 

History

History
167 lines (138 loc) · 4.52 KB

README.md

File metadata and controls

167 lines (138 loc) · 4.52 KB
Raw

Coding Test MCQs Reource

visitors

Why ?

While doing project i encoutered a problem that there is no online API or database resource availble for coding test mcqs. So i had to scrap these mcqs myself.All Mcqs are scrapped from sanfoundary website.

About Respository

You can download these mcqs either in .JSON or .CSV files. There are currently over 800 MCQS.Contributors are welcomed.

How to contribute ?

First of all, you can contribute minimum 30 mcqs in one pull requests.These mcqs can be scrapped from webistes or copy pasted all upto you. But you should follow the pattern.Choose the topic from the list you want to add mcqs to or you can also add a new topic not present in list.

Follow these steps:

1-Fork this repository:

Fork this repository by clicking on the fork button on the top of this page. This will create a copy of this repository in your account.

2-Clone the repository

Now clone the forked repository to your machine. Go to your GitHub account, open the forked repository, click on the code button and then click the copy to clipboard icon.

Open a terminal and run the following git command:

copy URL to clipboard

For example:

git clone https://github.com/alidevhere/Coding_MCQs.git

3-Create a branch

Change to the repository directory on your computer (if you are not already there):

cd Coding_MCQs

Now create a branch using the git checkout command:

git checkout -b your-new-branch-name

For example:

git checkout -b develop

Make necessary changes and commit those changes

Now open the topic file you want to contribute to, for example we want to contribute to arrays. Open arrays file and add mcsq at end of file.

Download

Topics:

  • CSV_Files
    • Algorithms
      • Balanced Parenthesis
      • Towers of Hanoi
      • Treap.csv
    • Arrays
      • Array and Array Operations
      • Bit Array
      • Count Inversion
      • Direct Addressing Tables
      • Dynamic Array
      • Number of Jumps to Reach End-array Operation
      • Parallel Array
      • Reversal Array Operation
      • Rotation Array Operation
      • Sparse Array
      • Suffix Array
    • Graphs
      • Binary Decision Diagrams & and Inverter Graph
      • Directed Acyclic Graph
      • Directed Graph
      • Graph
      • Multigraph and Hypergraph
      • Propositional and Directed Acyclic Word Graph
      • Undirected Graph
    • Hash Table
      • Hash Tables
      • Min Hash
    • Heap
      • Binomial and Fibonacci Heap
      • D-ary Heap
      • Heap
      • Leftlist Heap
      • Min-Max Heap
      • Pairing Heap
      • Skew Heap
      • Weak Heap
    • Linked Lists
      • Adjacency List
      • Circular Linked Lists
      • Doubly Linked Lists
      • Free List
      • Self Organizing List
      • Singly Linked Lists
      • Skip List
      • Xor Linked List
    • Matrix
      • Adjacency Matrix
      • Matrix
      • Sparse Matrix
    • Queue
      • Double Ended Queue (Dequeue)
      • Priority Queue
      • Queue
    • Special Data Structures
      • Bin
      • Disjoint-Set Data Structure
      • Rope
      • Van Emde Boas Tree
    • Stack
      • Reverse a Word using Stack
      • Stack Operations
    • Trees
      • 2-3 Tree
      • AA Tree
      • AVL Tree
      • B+ Tree
      • B-Tree
      • Balanced Binary Tree
      • Binary Heap
      • Binary Search Tree
      • Cartesian Tree
      • Expression Tree
      • K-ary Tree – 1
      • K-ary Tree – 2
      • KD Tree
      • Randomized Binary Search Tree
      • Red Black Tree
      • Self Balancing Binary Search Tree
      • Splay Tree
      • Suffix Tree
      • Tango Tree
      • Ternary Heap and Tree
      • Threaded Binary Tree
      • Top Tree
      • Trie
      • Weight Balanced Tree
    • Tree Traversals
      • Evaluation of a Postfix Expression
      • Evaluation of a Prefix Expression
      • Evaluation of an Infix Expression (Not Parenthesized)
      • Infix to Postfix Conversion
      • Infix to Prefix Conversion
      • Inorder Traversal
      • Postfix to Infix Conversion
      • Postorder Traversal
      • Preorder Traversal