Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update general-cs-quiz.ts #710

Merged
merged 4 commits into from
Oct 2, 2023
Merged

Update general-cs-quiz.ts #710

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
3614cd8
Update general-cs-quiz.ts
dhruvjain896 Oct 2, 2023
0d5e44b
Update src/data/general-cs-quiz.ts
dhruvjain896 Oct 2, 2023
ffc9241
Update src/data/general-cs-quiz.ts
dhruvjain896 Oct 2, 2023
b6d7789
Merge branch 'main' into b_tree
jdwilkin4 Oct 2, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions src/data/general-cs-quiz.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1457,6 +1457,15 @@ const generalCSQuiz = [
Distractor3: "number*of*donuts",
Explanation: "Kebab case separates each lowercase word by dashes.",
Link: "https://www.freecodecamp.org/news/snake-case-vs-camel-case-vs-pascal-case-vs-kebab-case-whats-the-difference/"
},
{
Question: "Which of the following type of tree is also known as 'large key' tree?",
dhruvjain896 marked this conversation as resolved.
Show resolved Hide resolved
Answer: "B-Tree",
Distractor1: "Binary Search Tree",
Distractor2: "Adelson-Velsky and Landis Tree (AVL Tree/Height balanced tree)",
Distractor3: "Ternary Tree",
Explanation: "B-Trees are characterized by the large number of keys that they can store in a single node, which is why they are also known as large key trees",
dhruvjain896 marked this conversation as resolved.
Show resolved Hide resolved
Link: "https://www.freecodecamp.org/news/b-tree-self-balancing-search-index-data-structures-explained/"
}
];

Expand Down