Recent Open Source Project Lab
- Teacher: Admin User
IP Lab Course for AY 25-26
- Teacher: Admin User
This course is offered as compulsory Lab course during BE IT 25-26 ODD Semester.
It has a weekly contact period of 2 hours. There are 6 modules in the course and 10 experiment submission during the course.
- Teacher: rupendra meshram
- Teacher: Admin User
Automata Theory involves study of Abstract Mathematical representation of computational devices having varied organization and formally prove their capability of solving certain categories of computational problems.
We start with learning about the abstraction called as Language (Formal Language) Which is used by researchers to categorize computational problems into 4 categories Regular, Context Free, Context Sensitive, Recursively Enumerable. We also dedicate our attention to mathematical devices called as FA, PDA, TM.
Course Objectives:
The course aims:
- The fundamental knowledge of data structures.
- The programming knowledge which can be applied to sophisticated data structures.
- The fundamental knowledge of stacks queue, linked list etc.
- The fundamental knowledge of Trees, Graphs etc
- The fundamental knowledge of different sorting, searching, hashing and recursion techniques
- The real time applications for stacks, queue, linked list, trees, graphs etc
Course Outcomes:
On successful completion, of course, learner/student will be able to:
- 1 Classify and Apply the concepts of stacks, queues and linked list in real life problem solving.L1, L2, L3
- Classify, apply and analyze the concepts trees in real life problem solving. L2, L3,L4
- Illustrate and justify the concepts of graphs in real life problem solving. L3, L5
- List and examine the concepts of sorting, searching techniques in real life problem solving. L2, L3, L4
- Use and identify the concepts of recursion, hashing in real life problem solving. L3, L4
- Examine and justify different methods of stacks, queues, linked list, trees and graphs to various applications. L3, L4, L5