Study Guide For IT Students
Hello, My name is Kruti Shah. I am software developer. I completed my Master's degree in major of Computer Science.
INTERESTS :
1) Design And Analysis Of Algorithms
Theoretical computer science
Algorithm design and analysis
Graph theory and algorithms
Data structures
Discrete mathematics
Formal languages and machines
Computational complexity
2) Data Science
Artificial intelligence
Machine learning
Artificial neural networks and deep learning
- 18
- 0
- 2
Community
- Followers
- Following
2 Reviews received
20 items
MiniPascalCompiler-JavaProject
Project to build MiniPascalCompiler- java language
- Book
- Other
- • 0 pages •
Project to build MiniPascalCompiler- java language
MiniPascalCompiler-JavaProject
MiniPascalCompiler document
- Book
- Other
- • 114 pages •
MiniPascalCompiler document
CS2148 Discrete Mathematics with Applications
This document is containing selected question of some chapters for all the young IT aspirants who want to keep learning new things and new questions. CHAPTER 4: ELEMENTARY NUMBER THEORY AND METHODS OF PROOF CHAPTER 5: SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
- Package deal
- • 2 items •
This document is containing selected question of some chapters for all the young IT aspirants who want to keep learning new things and new questions. CHAPTER 4: ELEMENTARY NUMBER THEORY AND METHODS OF PROOF CHAPTER 5: SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
Theory of Computation
This document includes details and examples related with following topics: Regular Expresion DFA NFA Pumping Lemna for regular language Context free grammar Parse tree Ambiguous grammar Chomsky normal form Turing machine
- Answers
- • 153 pages •
This document includes details and examples related with following topics: Regular Expresion DFA NFA Pumping Lemna for regular language Context free grammar Parse tree Ambiguous grammar Chomsky normal form Turing machine
CHAPTER 2 Insertion Sort
This document is containing selected question of chapter 2 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
- Book & Paket-Deal
- Answers
- • 5 pages •
This document is containing selected question of chapter 2 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
CHAPTER 5: SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
This document is containing selected question of chapter 5 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This blog will be updated as new and good solutions are posted by you geeks.
- Book & Paket-Deal
- Answers
- • 155 pages •
This document is containing selected question of chapter 5 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This blog will be updated as new and good solutions are posted by you geeks.
CHAPTER 5 Probabilistic Analysis and Randomized Algorithms
This document is containing selected question of chapter 5 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
- Book & Paket-Deal
- Answers
- • 4 pages •
This document is containing selected question of chapter 5 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
CS3112 - Design and Analysis of Algorithm
This blog is containing selected question of some chapters. CHAPTER 2 Insertion Sort CHAPTER 3 Growth of Functions CHAPTER 4 Divide-and-conquer CHAPTER 5 Probabilistic Analysis and Randomized Algorithms CHAPTER 6 Heapsort CHAPTER 7 Quicksort CHAPTER 8 Sorting In Linear Time CHAPTER 11 Hash Tables CHAPTER 12 Binary Search Trees
- Package deal
- • 9 items •
- CHAPTER 12 Binary Search Trees • Answers
- CHAPTER 11 Hash Tables • Answers
- CHAPTER 8 Sorting In Linear Time • Answers
- CHAPTER 7 Quicksort • Answers
- CHAPTER 6 Heapsort • Answers
- And more ….
This blog is containing selected question of some chapters. CHAPTER 2 Insertion Sort CHAPTER 3 Growth of Functions CHAPTER 4 Divide-and-conquer CHAPTER 5 Probabilistic Analysis and Randomized Algorithms CHAPTER 6 Heapsort CHAPTER 7 Quicksort CHAPTER 8 Sorting In Linear Time CHAPTER 11 Hash Tables CHAPTER 12 Binary Search Trees
CHAPTER 7 Quicksort
This document is containing selected question of chapter 7 for all the young IT aspirants who want to keep learning new things and new questions. Since I had problems when I used to solve questions of CLRS and I couldn't verify my solutions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
- Book & Paket-Deal
- Answers
- • 6 pages •
This document is containing selected question of chapter 7 for all the young IT aspirants who want to keep learning new things and new questions. Since I had problems when I used to solve questions of CLRS and I couldn't verify my solutions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
CHAPTER 8 Sorting In Linear Time
This document is containing selected question of chapter 8 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
- Book & Paket-Deal
- Answers
- • 10 pages •
This document is containing selected question of chapter 8 for all the young IT aspirants who want to keep learning new things and new questions. I hope this document can help you in verifying your solutions and learning new things. Please feel free to post any new solutions or any doubts.This document will be updated as new and good solutions are posted by you geeks.
Theory of Computation
Minimum Spanning Tree