School of Computer Science & Engineering


Prerequisites:  Programming in C, Data Structures and Algorithms, Computer Organization and Architecture, Operating System.

 

Course Outcomes (COs):

At the end of the course the student should be able to: 

                      i.        Explain the concepts of parallel computing and programming techniques.

                     ii.        Apply parallel algorithm design techniques to solve problems.

                    iii.        Analyze performance of parallel systems by applying analytical modeling.

                    iv.        Write programs using different parallel programming models.

                     v.        Demonstrate the concepts of parallel computing using appropriate techniques.


 


Course Outcomes
1.Apply logical thinking to develop an algorithm to solve a problem.
2.Implement a C program using appropriate constructs to solve a given problem.
3.Trace a given C program.
4.Develop test cases for all legitimate inputs for a given problem.
5.Build solutions for online coding challenges.

Course Outcomes (COs):

At the end of the course the student should be able to: 

·         Apply fundamental concepts of database systems to analyze the problem specification and design a             relational model for the same.

·         Formulate relational algebra and SQL solutions to a broad range of data management scenarios.

·         Apply normalization theory to design normalized relational database.

·         Apply concepts of transaction processing and security techniques for database systems.

·         Describe NoSQL and Columnar database system concepts.

           Design and Implement a Database application.

Course Outcomes (COs): At the end of the course the student should be able to:

1. Design combinational and sequential circuits using digital components.

2. Analyze different ways of communication between processor and peripherals.

3. Design memory units for given specifications.

4. Describe the architectures of various processors.

5. Analyze the performance of pipelined architecture in a processor.

Prerequisites: Discrete Mathematical Structures and Data Structures courses.

 

Course Outcomes (COs):

    At the end of the course the student should be able to: 

i.      Explain formal language concepts applied in the compilation process.

ii.     Design a suitable computing machine / parser for a given formal language.

iii.    Explain the semantic analyzer for a given context free grammar of a language construct.

iv.    Build and optimize the intermediate code for given programming construct.

v.     Implement the algorithms required for compiler front end construction.