Course Objectives
The Course is aimed at-
1. Introducing linear differential equations and partial differential equations
2. Explaining Laplace Transform, Inverse Laplace Transform and applications to electric circuit problems
3. Demonstrating Fourier transform and their applications.
4. Explaining mathematical programming and assignment problems.
5. Demonstrating applications to computer engineering.
Course Outcomes
Upon completion of this course, student should be able to –
1. Solve linear differential equations and apply them on simple electric circuit
2. Solve the problems on partial differential equations.
3. Gain the basic knowledge of Laplace transform and their applicability in solving initial value problems.
4. Understands the new notion of Fourier transform and their usability
5. Solve engineering problems using Mathematical Programming
6. Analyze and solve engineering problems using Assignment problems.
- Teacher: Amarja Bhosale
- Teacher: Vidya Swami
Course Objectives
The Course is aimed at -
1. Providing knowledge about basics of Data Communication and computer network
2. Providing knowledge about the Functions of Physical Layer.
3. Providing details of different data link layer functions including error detection and error corrections.
4. Providing knowledge about different framing techniques and network layer protocols for data communication
5. Providing detail knowledge of Transport Layer and protocols.
6. Providing knowledge about protocols from application layer.
Course Outcomes
Upon completion of this course, student should be able to –
1. Explain Data Communications System, its components and Articulate the networking Basics.
2. Explain and examine wired and wireless communication with medium access control layer. Differentiate and analyze various multiplexing techniques.
3. Apply error control techniques and study different protocols used at Data Link Layer.
4. Examine IPv4 and IPv6 structure. Solve sub-netting problems and analyze various routing mechanism, Identify and compare congestion control mechanisms
5. Examine the services provided by transport layer and have a hands-on experience of socket programming
6. Inspect the networking applications used in everyday tasks such as reading email or surfing the web and analyze its architecture
- Teacher: Amarja Bhosale
Course Objectives
The Course is aimed at-
1. Provide the knowledge of basic data structures and their implementations.
2. Demonstrating data structures such as arrays, stacks, queues, hash tables and linked list etc.
3. Understanding searching and sorting techniques.
4. Introducing the concepts of trees and graphs.
5. Understanding the hashing technique.
Course Outcomes
Upon completion of this course, student should be able to –
1. Implement abstract data types using arrays and linked list.
2. Apply the different linear data structures like stack and queue to various computing problems.
3. Implement different types of trees and apply them to problem solutions.
4. Discuss graph structure and understand various operations on graphs and their applicability
5. Analyze the various sorting and searching algorithms.
6. Understand the hashing technique and hash functions.
- Teacher: Hemant Tirmare
Course Objectives
The Course is aimed at-
1. Introducing the analysis and design of digital systems and microprocessors.
2. Understanding combinatorial analysis and design.
3. Explaining Computer aided design and programming of digital electronic circuits through the application of several modern software packages.
4. Explaining features and architectures of 8085.
5. Introducing 8085 Instruction set.
6. Studying types of Main memory.
Course Outcomes
Upon completion of this course, student should be able to –
1. Understand the logical behavior of digital circuits
2. Design combinatorial logic using K maps
3. Design sequential logic using ASM charts
4. Analyze combinatorial and sequential digital circuits
5. Explain the architecture, pin configuration of various microprocessors
6. Perform various microprocessor-based programs and apply the concepts of 8085 programming, interrupts, stacks & subroutines
- Teacher: Amarja Bhosale
Course Objectives
The Course is aimed at -
1. Providing knowledge about basics of Data Communication and computer network
2. Providing knowledge about the Functions of Physical Layer.
3. Providing details of different data link layer functions including error detection and error corrections.
4. Providing knowledge about different framing techniques and network layer protocols for data communication
5. Providing detail knowledge of Transport Layer and protocols.
6. Providing knowledge about protocols from application layer.
Course Outcomes
Upon completion of this course, student should be able to –
1. Explain Data Communications System, its components and Articulate the networking Basics.
2. Explain and examine wired and wireless communication with medium access control layer. Differentiate and analyze various multiplexing techniques.
3. Apply error control techniques and study different protocols used at Data Link Layer.
4. Examine IPv4 and IPv6 structure. Solve sub-netting problems and analyze various routing mechanism, Identify and compare congestion control mechanisms
5. Examine the services provided by transport layer and have a hands-on experience of socket programming
6. Inspect the networking applications used in everyday tasks such as reading email or surfing the web and analyze its architectur
- Teacher: Amarja Bhosale
Course Objectives
The Course is aimed at-
1. Provide the knowledge of basic data structures and their implementations.
2. Demonstrating data structures such as arrays, stacks, queues, hash tables and linked list etc.
3. Understanding searching and sorting techniques.
4. Introducing the concepts of trees and graphs.
5. Understanding the hashing technique.
Course Outcomes
Upon completion of this course, student should be able to –
1. Implement abstract data types using arrays and linked list.
2. Apply the different linear data structures like stack and queue to various computing problems.
3. Implement different types of trees and apply them to problem solutions.
4. Discuss graph structure and understand various operations on graphs and their applicability
5. Analyze the various sorting and searching algorithms.
6. Understand the hashing technique and hash functions.
- Teacher: Amarja Bhosale
- Teacher: Hemant Tirmare
Course Objectives
The Course is aimed at-
1. Introducing the analysis and design of digital systems and microprocessors.
2. Understanding combinatorial analysis and design.
3. Explaining Computer aided design and programming of digital electronic circuits through the application of several modern software packages.
4. Explaining features and architectures of 8085.
5. Introducing 8085 Instruction set.
6. Studying types of Main memory.
Course Outcomes
Upon completion of this course, student should be able to –
1. Understand the logical behavior of digital circuits
2. Design combinatorial logic using K maps
3. Design sequential logic using ASM charts
4. Analyze combinatorial and sequential digital circuits
5. Explain the architecture, pin configuration of various microprocessors
6. Perform various microprocessor-based programs and apply the concepts of 8085 programming, interrupts, stacks & subroutines
- Teacher: Amarja Bhosale
Course Objectives
The Course is aimed at-
1. Introducing most of the basic terminologies used in computer science courses and application of ideas to solve practical problems
2. Explaining basic mathematical logic and Set theory
3. Demonstrating relations and functions
4. Extending student’s Logical and Mathematical ability to deal with abstraction
5. Exposing to concepts and properties of algebraic structures such as semi groups, monoids and groups
6. Demonstrating core ideas in graph theory
Course Outcomes
Upon completion of this course, student should be able to –
1. Apply mathematical thinking, mathematical proofs, and algorithmic thinking, and be able to apply them in problem solving
2. Demonstrate the fundamental concepts related to set theory, relations and functions which are frequently required in advanced courses such as analysis of algorithms.
3. Compare algebraic structures like monoid, semi groups and groups.
4. Learn and summarize the group theory and group codes with applications in communication model.
5. Develop the ability to solve the problems related to algebra, POSETs, lattices, Boolean algebra and their application in computer science.
6. Solve the practical problems using graphs and related discrete structures
- Teacher: Chetan Awati
- Teacher: Amarja Bhosale
