<!DOCTYPE html>
<html lang="en">
<head>
	<meta charset="utf-8">
	<meta http-equiv="X-UA-Compatible" content="IE=edge">
	<meta name="viewport" content="width=device-width, initial-scale=1">
	<title>Basic Quiz Application with login and logout options as well as computation of final scores</title>
	<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.6/css/bootstrap.min.css" integrity="sha384-1q8mTJOASx8j1Au+a5WDVnPi2lkFfwwEAa8hDDdjZlpLegxhjVME1fgjWPGmkzs7" crossorigin="anonymous">
	<link rel="stylesheet" type="text/css" href="\css\topicpage_1.css">
	<script>
		function score(){
	    var count=0;
	    if (document.getElementById('correct_1').checked) {
	    	count=count+1;
	    }
	    if (document.getElementById('correct_2').checked) {
			count=count+1;
		}
		if (document.getElementById('correct_3').checked) {
			count=count+1;
		}
		alert("Score obtained = " + count + "\nRedirecting to the home screen");
		window.location.replace('/');
		}
	</script>
</head>
<body>
	<main>
		<form>
			<h2>Q1 What data structure is used for depth first traversal of a graph ?</h2>
			<aside><p>1 point</p></aside>
			<label class="transform"><input type="radio" checked="checked" name="data" value="list">list <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data" value="none of the above">none of the above <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data" value="queue">queue <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data" value="stack" id="correct_1">stack <span class="correct"></span></label><br/>	
			<h2>Q2 Binary search tree has best case run-time complexity of O(log n). What could the worst case ?</h2>
			<aside><p>1 point</p></aside>
			<label class="transform"><input type="radio" checked="checked" name="data_1" value="O(n^3)">O(n^3) <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data_1" value="O(n^4)">O(n^4) <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data_1" value="O(n)" id="correct_2">O(n) <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data_1" value="O(n^2)">O(n^2) <span class="correct"></span></label><br/>
			<h2>Q3 Which of the below mentioned sorting algorithms are not stable ?</h2>
			<aside><p>1 point</p></aside>
			<label class="transform"><input type="radio" checked="checked" name="data_2" value="Selection Sort" id="correct_3">Selection Sort <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data_2" value="Bubble Sort">Bubble Sort <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data_2" value="Merge Sort">Merge Sort <span class="correct"></span></label><br/>
			<label class="transform"><input type="radio" name="data_2" value="Insertion Sort">Insertion Sort <span class="correct"></span></label><br/>
			<input type="button" value="Submit" name="submission" class="transform_1" onclick="score()">
		</form>	
	</main>
</body>
</html>