[{"id":1065123,"question":"<p>A commonly used tool for creating data visualization&nbsp;</p>","choices":[{"text":"<p>MS Excel</p>","value":"A"},{"text":"<p>Python&nbsp;</p>","value":"B"},{"text":"<p>Tableau</p>","value":"C"},{"text":"<p>All of the above</p>","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":1065120,"question":"<p>Which real life example represents an undirected graph.</p>","choices":[{"text":"<p>Twitter followers</p>","value":"A"},{"text":"<p>Facebook friendships</p>","value":"B"},{"text":"<p>On way streets</p>","value":"C"},{"text":"<p>Email spam links</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065119,"question":"<p>What is he degree of a vrtex in a graph.</p>","choices":[{"text":"<p>The numebr of loops</p>","value":"A"},{"text":"<p>The number of edges connected to it</p>","value":"B"},{"text":"<p>The total numebrof vertices</p>","value":"C"},{"text":"<p>The weight of the vertex</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065118,"question":"<p>Which of the following is a difference between trees and graphs.</p>","choices":[{"text":"<p>Trees have cycles</p>","value":"A"},{"text":"<p>Trees have many path</p>","value":"B"},{"text":"<p>Trees have root ; graph may not</p>","value":"C"},{"text":"<p>Trees are more flexible</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065117,"question":"<p>Which of the following best describes a tree.</p>","choices":[{"text":"<p>Graph with cycles</p>","value":"A"},{"text":"<p>Graph with no cycles and a root</p>","value":"B"},{"text":"<p>Random graph</p>","value":"C"},{"text":"<p>Circular graph</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065115,"question":"<p>Which type of grah has edges with direction.</p>","choices":[{"text":"<p>Undirected graph</p>","value":"A"},{"text":"<p>Directed graph</p>","value":"B"},{"text":"<p>Weighted graph</p>","value":"C"},{"text":"<p>Binary graph</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065114,"question":"<p>Which of the following is a real world example of graph.</p>","choices":[{"text":"<p>File system</p>","value":"A"},{"text":"<p>Family tree</p>","value":"B"},{"text":"<p>Social network</p>","value":"C"},{"text":"<p>Web page navigation&nbsp;</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065113,"question":"<p>In which structures can cycles exist.</p>","choices":[{"text":"<p>Graph</p>","value":"A"},{"text":"<p>Tree</p>","value":"B"},{"text":"<p>Stack</p>","value":"C"},{"text":"<p>Queue</p>","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065112,"question":"<p>Which of the following is NOT a characteristic of a graph</p>","choices":[{"text":"<p>Vertices</p>","value":"A"},{"text":"<p>Edges</p>","value":"B"},{"text":"<p>One directional flow only</p>","value":"C"},{"text":"<p>Weighted or unweighted edges</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065111,"question":"<p>What is a graph in data structures.</p>","choices":[{"text":"<p>A linear structure</p>","value":"A"},{"text":"<p>A hierachiecal structure</p>","value":"B"},{"text":"<p>A set of vertices connected by edges.</p>","value":"C"},{"text":"<p>A type of array</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065110,"question":"<p>Which traversal is used for beacking up files in a directory.</p>","choices":[{"text":"<p>In order</p>","value":"A"},{"text":"<p>Post Order</p>","value":"B"},{"text":"<p>Pre order</p>","value":"C"},{"text":"<p>Level order</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065109,"question":"<p>What is the height of a tree.</p>","choices":[{"text":"<p>No of nodes</p>","value":"A"},{"text":"<p>Longest path&nbsp;</p>","value":"B"},{"text":"<p>Memory used</p>","value":"C"},{"text":"<p>No of leaves</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065108,"question":"<p>What is a leaf node.</p>","choices":[{"text":"<p>A node with many children</p>","value":"A"},{"text":"<p>A node with one child</p>","value":"B"},{"text":"<p>A node with no children</p>","value":"C"},{"text":"<p>A node with no parent</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065107,"question":"<p>Which node is the staring point of a tree.</p>","choices":[{"text":"<p>Leaf node</p>","value":"A"},{"text":"<p>Child node</p>","value":"B"},{"text":"<p>Root node</p>","value":"C"},{"text":"<p>Parent node</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065106,"question":"<p>What is a tree in data structures. &nbsp;</p>","choices":[{"text":"<p>Linear data</p>","value":"A"},{"text":"<p>Math function&nbsp;</p>","value":"B"},{"text":"<p>Hiearchical structure</p>","value":"C"},{"text":"<p>Loop</p>","value":"D"},{"value":"E"}],"correctAnswer":3}]