Prepare for your exams
Get points
Guidelines and tips
Sell on Docsity
Docsity AI

Prepare for your exams

Study with the several resources on Docsity

Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips

Sell on Docsity

Prepare for your exams

Study with the several resources on Docsity

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents

For each uploaded document

Answer questions

For each given answer (max 1 per day)

All the ways to get free points

Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Northern Michigan University

Prof. Michael R. Kowalczyk - Study notes

The content listed below has not been created by Michael R. Kowalczyk

Algorithms and Programming Computer Science

Practice Questions for Final Exam - Computer Science I | CS 120

(1)

14 pag.

2009

Kruskal's Algorithm - Lecture Notes | CS 422

2 pag.

2009

Presentation Peer Review - Algorithms Design and Analysis | CS 422

1 pag.

2009

Greedy Algorithms - Algorithms Design and Analysis - Notes | CS 422

1 pag.

2009

NP-Completeness of Clique Problem through Reduction from 3-SAT - Prof. Michael R. Kowalczy

1 pag.

2009

P and NP - Algorithms Design and Analysis - Notes | CS 422

2 pag.

2009

Introduction to Vertex Cover as an NP-Complete Problem: Polynomial Time Mapping Reductions

2 pag.

2009

Matrix Chain Multiplication - Lecture Notes | CS 422

1 pag.

2009

Dynamic Programming: Solving Assembly-Line Scheduling with Dynamic Programming - Prof. Mic

1 pag.

2009

Dynamic Programming for Path Finding in Grid Terrain - Prof. Michael R. Kowalczyk

1 pag.

2009

CS 120 Fall 2008 Midterm Exam - Prof. Michael R. Kowalczyk

(1)

7 pag.

2009

XHTML and CSS Practice Final Exam Solutions - Prof. Michael R. Kowalczyk

8 pag.

2010

Midterm Exam Questions with Answers - Web Site Construction | CS 101

4 pag.

2010

CS-101 Section 4 Midterm Practice: Web Development - Prof. Michael R. Kowalczyk

4 pag.

2010

Reducing Undecidable Problems: v7 and 2-halt - Prof. Michael R. Kowalczyk

2 pag.

2009

Notes on Mapping Reduction - Algorithms Design And Analysis | CS 422

1 pag.

2010

Solutions to Midterm Exam - Website Construction | CS 101

4 pag.

2010

Code Writing and Tracing Section - Midterm Exam v1.1B | CS 120

7 pag.

2009

Average Case Analysis of Quicksort: Probability of Adjustments and Comparisons - Prof. Mic

2 pag.

2009

CS-101 Section 4 Midterm Exam - Prof. Michael R. Kowalczyk

4 pag.

2010

Notes on Linear time selection - Algorithms Design and Analysis | CS 422

2 pag.

2010

Lecture Notes on Halting Problem and Reductions | CS 422

1 pag.

2009

Greedy Algorithms: Knapsack Problem and Graph Coloring - Prof. Michael R. Kowalczyk

2 pag.

2009

Search for more notes