From 3614cd8fc08b99f44adcb5e160814e36092205c5 Mon Sep 17 00:00:00 2001 From: Dhruv Jain <56195235+dhruvjain896@users.noreply.github.com> Date: Mon, 2 Oct 2023 14:21:55 +0530 Subject: [PATCH 1/3] Update general-cs-quiz.ts Added a question based on the concept of B tree data structure --- src/data/general-cs-quiz.ts | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/src/data/general-cs-quiz.ts b/src/data/general-cs-quiz.ts index b73ebb49c..6a58e411b 100644 --- a/src/data/general-cs-quiz.ts +++ b/src/data/general-cs-quiz.ts @@ -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?", + 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", + Link: "https://www.freecodecamp.org/news/b-tree-self-balancing-search-index-data-structures-explained/" } ]; From 0d5e44bce0a47606fb313301d4f7a1c56c25c479 Mon Sep 17 00:00:00 2001 From: Dhruv Jain <56195235+dhruvjain896@users.noreply.github.com> Date: Mon, 2 Oct 2023 19:39:17 +0530 Subject: [PATCH 2/3] Update src/data/general-cs-quiz.ts Changed grammar in question Co-authored-by: Jessica Wilkins <67210629+jdwilkin4@users.noreply.github.com> --- src/data/general-cs-quiz.ts | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/data/general-cs-quiz.ts b/src/data/general-cs-quiz.ts index 6a58e411b..046ae0da4 100644 --- a/src/data/general-cs-quiz.ts +++ b/src/data/general-cs-quiz.ts @@ -1459,7 +1459,7 @@ const generalCSQuiz = [ 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?", + Question: "Which of the following type of trees is also known as a 'large key' tree?", Answer: "B-Tree", Distractor1: "Binary Search Tree", Distractor2: "Adelson-Velsky and Landis Tree (AVL Tree/Height balanced tree)", From ffc924168fac7df2efc87704ba1688bc26e5b978 Mon Sep 17 00:00:00 2001 From: Dhruv Jain <56195235+dhruvjain896@users.noreply.github.com> Date: Mon, 2 Oct 2023 19:39:38 +0530 Subject: [PATCH 3/3] Update src/data/general-cs-quiz.ts Modified Explanation Co-authored-by: Jessica Wilkins <67210629+jdwilkin4@users.noreply.github.com> --- src/data/general-cs-quiz.ts | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/data/general-cs-quiz.ts b/src/data/general-cs-quiz.ts index 046ae0da4..737968e97 100644 --- a/src/data/general-cs-quiz.ts +++ b/src/data/general-cs-quiz.ts @@ -1464,7 +1464,7 @@ const generalCSQuiz = [ 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", + Explanation: "B-Trees are identified by their capacity to hold a significant quantity of keys within a single node, leading to their alternative name, large key trees.", Link: "https://www.freecodecamp.org/news/b-tree-self-balancing-search-index-data-structures-explained/" } ];