kunalkhandelwal Goto Github PK

arrayadt

“To study an Array ADT and to implement various operations on an Array ADT.” Create an array and implement the operations – traverse(), insert_element(), delete_element(), sort(), search(), merge(), copy(), create(), isFull(), isEmpty() and length(). Write a C program to demonstrate an array ADT using defined operations appropriately using a menu-driven approach. Your program should be able to print the array contents appropriately at any or all instances (as required may be). You must also ensure that no input is acquired within the body of functions, nor (preferably) display any prompts/results.

avl-tree-using-linked-list

“To study and implement AVL Tree - using Linked List” . Implement the routines for a AVL Tree to – (1) insert a node, (2) delete a node with specified key value, (3) traverse the tree (pre-, post-, and in- order & level order), (4) find the height of a tree, (5) count and list all leaf nodes and parent nodes. Write a menu driven program to execute these routines for the binary search tree.

bfs-dfs-major-graph-algorithms

“To study a graph data structure and demonstrate different traversals on it - Depth First Search and Breadth First Search and to demonstrate different shortest path algorithms - Warshall's Algorithm (Path Matrix) and Dijkstra's Algorithm” . Write a C routine to create an arbitrary graph [a minimum of 6 vertices] using adjacency matrix representation. Write menu driven C program that will include routines to – (1) display the graph [the adjacency matrix], (2) execute depth-first search, and (3) execute breadth-first search (4) find shortest path matrix using Warshall's algorithm, and (5) find shortest path between vertices using Dijkstra's algorithm.

binary-search-tree

“To study and implement binary search tree (BST) - using Linked List” . Implement the routines for a binary search tree to – (1) insert a node, (2) delete a node with specified key value, (3) traverse the tree (pre-, post-, and in- order & level order), (4) find the height of a tree, (5) count and list all leaf nodes and parent nodes. Write a menu driven program to execute these routines for the binary search tree.

codeforces

d3.js

d3.js Projects

datacamp-data-analyst-with-python

data analyst with python career track

doubly-linked-list

“To study doubly linked linear lists and implement various operations on it – Insert, Delete, Reverse, Order, Locate, Merge” . Create a self-referential structure, NODE to represent a node of a singly linked linear list. Implement the routines to (1) find length of the list, (2) create a list, (3) insert an element – at the beginning, at the end and at a specified position in the list, in ordered list (4) delete an element from the front, rear, or a specified position at the list, (5) reverse the list, (6) search the list (7) sort the list (8) merge two lists. Create a menu-driven program to test these routines.

flight-tariff-prediction-using-machine-learning

Flight Tariff Prediction Using Machine Learning in Python and Web App Using Flask with an accuracy of 89% using ML Hacks dataset from Kaggle.

gmaps--graph-expansion-and-contraction

5th Sem Project under Dr. Manoj Chandak

hybrid-movie-recommendation-system-using-personality-traits

For Final Year Project

intro-to-html5-final-peer-graded-assignment

Your final project is to create a web page that matches the example given here. Your page must match mine exactly other than the title and any parts that have been highlighted in yellow. (If you would like to open this image in a separate window you can find it here. If you need help with this content due to difficulties accessing the text, you can find a textual description of the image below at http://intro-webdesign.com/projectdescription.html.)

intro-to-html5-peer-graded-assignment

Your final project is to create a web page that matches the example given here. Your page must match mine exactly other than the title and any parts that have been highlighted in yellow. (If you would like to open this image in a separate window you can find it here. If you need help with this content due to difficulties accessing the text, you can find a textual description of the image below at http://intro-webdesign.com/projectdescription.html.)

kunalkhandelwal

My personal reporsitory

leetcode

leetcodesql50

LeetCode SQL 50 from June 17, 2023

map-based-application-for-realtime-crime-reporting

portfolio-website-2023

python-basics-university-of-michigan-coursera

Python Basics-University of Michigan-Coursera-course_1_assessment_2

python-projects

research-internships-for-undergraduates

List of Research Internships for Undergraduate Students

singly-linked-list

“To study singly linked linear lists and implement various operations on it – Insert, Delete, Reverse, Order, Locate, Merge, Linked Stack, and Linked Queue” . Create a self-referential structure, NODE to represent a node of a singly linked linear list. Implement the routines to (1) find length of the list, (2) create a list, (3) insert an element – at the beginning, at the end and at a specified position in the list, in ordered list (4) delete an element from the front, rear, or a specified position at the list, (5) reverse the list, (6) search the list (7) sort the list (8) merge two lists. Create a menu-driven program to test these routines. Use the singly linked linear list routines to implement a linked stack and a linked queue.

sorting

“ To study and implement basic sorting methods – Selection, Insertion, Shell, and Counting”. Write a generalized function that takes a parameter to indicate the mode (say 1 for decreasing order, 2 for increasing order, 3 for increasing order with the Nth element out of order, 4 for a randomly generated element values, 5 for array creation specifically for counting sort), to create a list of elements. The parameter indicating the number of elements in a statically allocated array (the maximum size is large enough to run possible iterations to test the time complexity, say 1000000) that will be a multiple of 10. Also write appropriate functionsto create a copy of the list and to display the list contents. Using above functions, write a menu-driven C program to order the list in ascending sequence using - Insertion Sort, Selection Sort, Shell Sort and Counting Sort.“ To study and implement the divide-and-conquer sorting methods – Merge, Quick, and Heap” . Using the utility functions created in Experiment-2, write a menu driven program to order a list in ascending order using following “ divide-and-conquer” approaches – the Quick Sort, the Heap Sort, and the Merge Sort. You should compare the running time for ordering lists different input sizes in respect of traditional comparison sorts and divide-and-conquer sorts.

stack-queue-circular-queue

“To study and implement different linear data structures using arrays - Stack ADT, Queue ADT, and Circular Queue” . Use array based allocation to initialize a Stack, a Queue, and a Circular Queue and implement the permissible operations on them. Write a menu-driven program in C to test these data structures. The solution involving use of structure(s) to realize the mentioned data structures will be preferred (but not essential).

tic-tac-toe-using-javascript-and-p5.js

3X3 Tic Tac Toe Game

tictactoe-using-minimax-algorithm-of-ai

Tic Tac Toe game is created based on the concept of the Minimax Algorithm of Artificial Intelligence. Technologies Used: HTML5, CSS3, Javascript, p5.js, Minimax Algo

website

The train engine powering the Coding Train website