School of Computer Science Engineering & Technology

Unit-I: Water Technology & Electrochemistry

Unit-II: Corrosion Science & Spectroscopy

Unit-III: Fuels & Chemistry in ICT

Unit-IV: Engineering Materials

Unit-I: Introduction to C++

Unit-II: Array, Structure and Class

One Dimensional Array: Declaration/initialization of One-dimensional array, inputting array elements, accessing array elements, Two dimensional Array: Declaration/initialization of a two-dimensional array, inputting array elements accessing array elements, Defining a Structure, declaring structure variables, accessing members of structure, Defining a class, declaring object and accessing class members.

Unit-III: Constructor, Destructor & Inheritance

Unit-IV: Polymorphism, File Handling & Exceptions

Unit-I: Semiconductors & Diodes

Unit-II: Transistors (BJT & FET)

Unit-III: Oscillators & Operational Amplifiers

Unit-IV: Digital Logic & Instruments

Unit-I: Ordinary Differential Equations

Review of first order linear differential equations, Exact differential equations, Second and higher order linear differential equations with constant coefficients. Cauchy's & Legendre ‘s homogeneous differential equations, method of variation of parameters, Cauchy - Euler equation.

Unit-II: Partial Differential Equations & Applications

Unit-III: Laplace Transforms & Fourier Series

Unit-IV: Vector Calculus

Introduction to vectors, vector algebra, directional derivatives, gradient, divergence & curl, Scalar line integrals, line integrals, surface integrals, Green, Stokes and Gauss divergence theorem (without proof).

Unit-I: Introduction to Value Education

Difference between moral and human values. Five core human values: Truth, Righteous conduct, Peace, Love and Non-violence. Classification of moral values, Value crisis in contemporary Indian society at different levels: Individual, family, Society and culture. Values in Indian constitution: Justice, liberty, equality and fraternity, Fundamental Rights under Indian constitution; Fundamental duties of Indian citizens.

Unit-II: Harmony with the self, family & society

Understanding Human being as the Co-existence of the Self and the Body, Program to ensure the health of the body Distinguishing between the Needs of the Self and the Body, living in harmony with the self, family & society, steps to achieve self-discipline. Noble Eightfold Path: Right Understanding, Thought, Speech, Action, Livelihood, Effort, Mindfulness, and Concentration.

Unit-III: Understanding Mental health & emotional well-being

Characteristics of a mentally healthy person, causes of mental-health issues in contemporary society, possible solutions to improve mental health. Emotional intelligence: elements of emotional intelligence, Advantages of higher emotional intelligence & improving emotional intelligence, Maslow's hierarchy of needs & self-actualization.

Unit-IV: Awareness about Himachal Pradesh

General knowledge including the knowledge of different places of historic, national and cultural importance & tourist attraction, hydro power projects, industries, highways, educational and other institutions of the state, knowledge about the famous personalities from the state, currents affairs of Himachal Pradesh, history of Himachal- from medieval to present time, Geography-including the weather, borders, rivers, mountain-ranges , passes, peaks , knowledge of customs and culture of HP : including the costumes, customs, fairs and festivals etc.

Laboratory Work:

1. To determine the pH and conductivity of five different water samples.
2. To determine total alkalinity in a given sample of water using standard acid.
3. To determine total hardness of water using complexometric titration method.
4. To determine the amount of Chlorine (residual) in given sample of water using N/20 Sodium thiosulphatesolution.
5. To determine the percentage of Chlorine in sample of bleaching powder, 10 g of which are dissolved in 500ml of water.
6. To determine the amount of Chromium in given sample of water.
7. To determine dissolved oxygen in given sample of water.
8. To determine the coefficient of viscosity of the given unknown liquids by using Ostwald’s Viscometer.
9. To determine the coefficient of viscosity of the given lubricating oil using Red Wood Viscometer.
10. To determine surface tension of given liquid by drop number method using Stalagmometer.
11. To determine % age of moisture, volatile matter, ash and fixed carbon in given sample of coal by proximateanalysis method.
12. To verify Beer's Law and apply it to find the concentration of given unknown solution by using UV-visiblespectra-photometer.
13. Estimation of Copper/Iron.
14. Preparation of any of the following polymers: Phenol formaldehyde resins/Urea formaldehyde resins /Biodegradable /conducting polymer.
15. To synthesize a polymer using synthetic monomer via free radical polymerization and characterize thepolymer using FTIR spectra-photometer.
16. To synthesize a semisynthetic polymer via grafting of monomer on polymeric backbone and characterize thepolymer using FTIR spectra-photometer.
17. Synthesis of nano-particles of Au/Ag/NiO/ZnO/Iron Oxide

Laboratory Work:

1. WAP for basic input/output statement and various control statements.
2. WAP to create for function and function calling methods
3. WAP to take input and display elements of 1D and 2D array.
4. WAP for structures and display the values of structure members using structure variable.
5. WAP for creating class, defining member in class and accessing member.
6. WAP using various string functions in C++.
7. WAP for constructor and Destructor.
8. WAP for inheritance.
9. WAP for friend function and friend class.
10. WAP for polymorphism.
11. WAP for exception handling in C++.
12. WAP using template concept.
13. WAP to create function and use function calling methods.

Laboratory Work:

1. Familiarization with electronics equipment (multimeters, CROs, power supply and function generators)
2. Study of the characteristics of P-N junction diode.
3. Study of the characteristics of Zener diode
4. Study of truth tables of different logic gates (AND, OR, NAND, NOR, XOR, XNOR).
5. Familiarization with CRO.
6. DSO and Electronic Components.
7. Diodes characteristics - Input- Output and Switching.
8. BJT and MOSFET Characteristics.
9. Zener diode as voltage regulator, Rectifiers.
10. Construction of an un regulated DC power supply (using a transformer, a full wave rectifier and a capacitor filter) and study of its output waveform by CRO.
11. Study of inverting and non-inverting amplifiers using op-amp
12. Study of the frequency response of any one oscillator.

List of Experiments:

1. Introduction of Yoga, Different Definitions of Yoga. General Guidelines for Yogic Practices.
2. Traditional Schools of Yoga: Bhakti yoga, karma yoga, Gyana yoga, Hatha yoga, Mantra yoga, Laya yoga, Raja yoga) Ashtanga Yoga of Sage Patanjali.
3. Concept of Shatkriyas: Dhauti, Basti, Neti, Nauli, Trataka and Kapalbhati. Shatkriyas (Cleansing Process): Jala neti, Sutra neti. Kunjala, Vastra Dhauti, Danda Dhauti, kapalbhati, Surya namaskar.
4. Concept of Surya namaskar: Introduction, Technique, benefit, precaution.
5. Concept of Asanas Introduction, Types, Technique, benefit, precaution, Asanas: Standing Poses: Tadasana, Kati chakrasana, tiryak tadasana, vrikshasana, veer bhadrasana, garudasana, trikonsana, Sitting Poses: Padmasana, Swastikasana, Vajrasana, Bhadrasana, Gomukhasana, Mandukasana, Singhasana.
6. Concept of Pranayama: Introduction, Types, Technique, benefit, precaution.
7. Meditation: Concept, technique, benefit, and precaution. Dhyana: Sthoola Dhyana, Jyoti Dhyana, Sukshama Dhyana, (According to Gheranda Samhita). Mantra Chanting- Omkar (Pranav Jaap), Gayatri Mantra, Maha Mrityunjaya Mantra, Shanti Mantr.
8. Lying Down Poses: Spine Position: uttanpadasana, Pawan muktasana, Naukasana, markatasana, halasana, sarvangasana, matsyasana, setubandhasana, chakarasana and shavasana. Prone Position: Bhujangasana, Shalabhasana, Dhanurasana, Vipreet naukasana.

List of Experiments:

1. Introduction to different types of lines, lettering, dimensioning and scales.
2. To draw the projection of points and lines.
3. To draw the projection of planes.
4. To draw the projection of solids and section of solids.
5. To draw the projection of development of surfaces.
6. To draw the isometric projections.
7. Introduction to Auto CAD (History, exploring GUI, Workspace, Coordinate System, Snap, Grid and Ortho modes) and basic commands for 2D drawings.
8. Introduction to file management, drawing & drafting settings.
9. Perform dimensioning and annotations in drawing arc, lines, angle etc.
10. Use of drawing & modify tools to make simple shapes of different 2D-drawings of projection of points, line, plane, solids, section of solid, development of surfaces and isometric projections.

Unit-I: Sets, Relations and Functions

Operations on Set, Inclusion-Exclusion principle, Representation of Discrete Structures, Fuzzy Set, Multi-set, Bijective function, Inverse and Composition of functions, Floor and Ceiling functions, Growth of functions: Big-O notation, functions, Recursive function, Functions applications.

Unit-II: Relations

Reflexivity, Symmetry, Transitivity, Equivalence, and partial ordered relations, Asymmetric, Irreflexivity relation, Inverse and Complementary relations, partitions and Covering of a set, N-ary Relations and database, Representation relation using matrices and digraph, Closure of relations, Warshall’s algorithms, Lexicographic Ordering, Hasse diagram, Lattices, Boolean algebra, Application of transitive Closure in medicine and engineering. Application: Embedding a partial order.

Unit-III: Graph Theory & Basic Logic

Unit-IV: Proof Techniques and Algebraic Structure

Unit-I: Introduction and System Structures

Unit-II: Process Scheduling & Deadlock

Unit-III: Memory & File Management

Unit-IV: Disk Management & Security

Course Learning Outcomes (CLOs)

• Explain the basic of an operating system viz. system programs, system calls, user mode and kernel mode.
• Select particular CPU scheduling algorithms for specific situation and analyses the environment leading to deadlock and its rectification.
• Explicate memory management techniques viz. caching, paging, segmentation, virtual memory, and thrashing.
• Understand the concepts related to file systems, disk scheduling and security, protection.
• Comprehend the concepts related to concurrency.

Unit-I: Introduction & Divide and Conquer

Algorithm Introduction; Algorithm Design paradigms- motivation, concept of algorithmic efficiency, run time analysis of algorithm, Asymptotic Notations. Divide and Conquer Approach: Structure of divide-and-conquer algorithms; sets and disjoint sets: Union and Find algorithms; quick sort, Finding the maximum and minimum, Quick Sort, Merge sort, Heap and heap sort.

Unit-II: Greedy & Graph Algorithms

Unit-III: Dynamic Programming & Backtracking

Dynamic Programming: Overview, difference between dynamic programming and divide and conquer, Matrix chain multiplication, Traveling salesman Problem, longest Common sequence, 0/1 knapsack. Backtracking: 8-Queen Problem, Sum of subsets, graph colouring, Hamiltonian cycles.

Unit-IV: Branch and Bound & Complexity

Branch and Bound: LC searching Bounding, FIFO branch and bound, LC branch and bound application: 0/1 Knapsack problem, Traveling Salesman Problem. Computational Complexity: Complexity measures, Polynomial vs. non-polynomial time complexity; NP-hard and NP-complete classes, examples.

Unit-I: Fundamentals of AI & Social Implications

Unit-II: Fundamentals of Machine Learning (ML)

Unit-III: Artificial Neural Networks (ANNs)

Introduction to Artificial Neural Networks (ANNs): Definition and history of ANNs, Types of ANNs architectures, Basic architecture of ANNs, Activation functions, Singled-Layered and Multi-Layered Perceptron, Backpropagation algorithms, Applications of ANNs in Engineering.

Unit-IV: Fuzzy Logic and Genetic Algorithms

Unit-I: Introduction & Data Modeling

Database Management System: Introduction, Applications, Purpose of Database Systems, View of Data – Data Abstraction – Instances and Schemas – data Models – the ER Model – Relational Model – Other Models – Database Languages – DDL – DML – database Access for applications Programs – database Users and Administrator – Transaction Management – data base Architecture – Storage Manager – the Query Processor Data base design and ER diagrams – ER Model - Entities, Attributes and Entity sets – Relationships and Relationship sets – ER Design Issues – Concept Design – Conceptual Design for University Enterprise. Introduction to the Relational Model – Structure – Database Schema, Keys – Schema Diagrams.

Unit-II: Relational Languages & SQL

Relational Query Languages, Relational Operations. Relational Algebra – Selection and projection set operations – renaming – Joins – Division – Examples of Algebra overviews – Relational calculus – Tuple relational Calculus – Domain relational calculus. Overview of the SQL Query Language – Basic Structure of SQL Queries, Set Operations, Aggregate Functions – GROUPBY – HAVING, Nested Sub queries, Views, Triggers.

Unit-III: Normalization

Normalization – Introduction, Non loss decomposition and functional dependencies, First, Second, and third normal forms – dependency preservation, Boyce Codd normal form. Higher Normal Forms - Introduction, Multi-valued dependencies and Fourth normal form, Join dependencies and Fifth normal form.

Unit-IV: Transaction Management & NoSQL

Transaction Concept- Transaction State- Implementation of Atomicity and Durability – Concurrent Executions – Serializability- Recoverability – Implementation of Isolation – Testing for serializability- Lock -Based Protocols – Timestamp Based Protocols- Validation- Based Protocols – Multiple Granularity. Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions, Introduction to NOSQL.

Course Learning Outcomes (CLOs)

• Explain the features of database management systems and Relational database.
• Create and populate a RDBMS for a real-life application, with constraints and keys, using SQL and retrieve any type of information from a data base by formulating complex queries in SQL.
• Analyze the existing design of a database schema and apply concepts of normalization to design an optimal database and build indexing mechanisms for efficient retrieval of information from a database.

Unit-I: 8085 Architecture and Organization

Introduction to Microprocessor, Microcomputer system, Microprocessor operations, Internal Architecture of 8085, System Bus, Pin description of 8085, Need and generation of control signals, types of Registers & Timing and Control Unit. Instruction set of 8085: Instruction formats, addressing Modes, Timing effect of Addressing modes, Instruction set classification, Instruction Cycle, Machine cycles, Timing diagram, Stack and Subroutine, Interrupt types, interrupt systems and polling, Interrupt control logic, Assembly language programming.

Unit-II: Memory and I/O devices interface

Serial and Parallel communication interface, Hardware (Circuit level) description of Registers, RAM, ROM and Secondary memories, DMA controller, memory mapped I/O & I/O mapped I/O, Generating Control Signals, Interfacing 2KX8 EPROM, 2KX8 RAM, Interfacing I/O ports to 8085, Hand shake Signals, Block diagram and working of PPI-8255, Interfacing 8255 to 8085 and LED Interface.

Unit-III: Microcontroller 8051 - Building Blocks

Microprocessor vs microcontroller; RISC vs CISC architectures, 8051 Architecture, Internal memory organization, Internal RAM structure, Processor status word, Types of Special Function Registers and their uses in 8051 architecture, pin configuration, flag-bits and PSW register, input-output ports, register banks and stack. Instruction set of 8051: Addressing modes, Data transfer instructions, Arithmetic instructions, Logic instructions, branching instructions and Bit manipulation instructions.

Unit-IV: Programming & Advance Microcontrollers

Programming concept of 8051: Introduction to 8051 assembly programming, Jump, loop and call instructions programming, Programming 8051 Timers, Interrupts Programming, Serial communication programming. Advance Microcontroller: Introduction features and block diagram of PIC and ARM microcontroller.

Course Outcomes

At the end of this course students will demonstrate the ability to:

• Understand the architecture of microprocessors and microcontrollers.
• Develop programmes for various microcontrollers.
• Interface various peripherals with microcontrollers and programmes it for various systems.
• Design and implement real-life engineering applications.

List of Experiments

* Minimum 08 experiments must be performed.

1. Perform Insertion sort for any given list of numbers.
2. Perform Quick Sort for the given list of integer values.
3. Find Maximum and Minimum of the given set of integer values.
4. Perform Merge Sort on the given two lists of integer values.
5. Perform Binary Search recursively and non-recursively.
6. Find solution for knapsack problem using greedy method.
7. Find minimum cost spanning tree using Prim’s Algorithm.
8. Find minimum cost spanning tree using Kruskal’s Algorithm.
9. Perform Single source shortest path problem for a given graph.
10. Find solution for job sequencing with deadlines problem.
11. Solve all pairs shortest path problem.
12. Solve N-QUEENS problem.

List of Experiments

* Minimum 08 experiments must be performed.

1. Write a program to implement breadth first search algorithm.
2. Write a program to implement depth first search algorithm.
3. Write a program to implement the Hill Climbing algorithm.
4. Write a program to build and display Neural network using Tensor flow Keres.
5. Write a program to implement Genetic algorithm.
6. Study of expert system tools and its applications.
7. Write a program to implement Traveling salesman problem.
8. Write a program to implement four queen problem.
9. Write a program to solve monkey banana problem.
10. Write a program to implement Tower of Hanoi.
11. Case study related to implementation of algorithms in respective discipline for which lab is being run.

List of Experiments

* Minimum 08 experiments must be performed.

1. Design a Database and create required tables. For e.g. Bank, College Database
2. Apply the constraints like Primary Key, Foreign key, NOT NULL to the tables.
3. Write a SQL statement for implementing ALTER, UPDATE and DELETE
4. Write the queries to implement the joins
5. Write the query for implementing the following functions: MAX(), MIN (), AVG (), COUNT().
6. Write the query to implement the concept of Integrity constraints.
7. Write the query to create the views.
8. Perform the queries for triggers.
9. Perform the following operation for demonstrating the insertion, updation and deletion using the referential integrity constraints.
10. Write the query for creating the users and their roles.

Unit-I: Introduction to Compilers

Definition of compiler, interpreter and its differences, Structure of a compiler, pass and phases of translation, bootstrapping, Lexical Analysis, Role of Lexical Analyzer, Input Buffering, Specification of Tokens, Recognition of Tokens, Lex, Finite Automata, Regular Expressions to Automata, Minimizing DFA.

Unit-II: Syntax Analysis

Parsing, Role of Parser, Grammars, Context-free grammars, derivations, ambiguity, classes of parsing, Top Down Parsing: Recursive Descent Parser, Predictive Parser-LL(1), Bottom Up Parsing: Shift Reduce Parser-LR Parser-LR(0), Introduction to SLR Parser, CLR Parser and LALR Parser, Error Handling and Recovery in Syntax Analyzer, YACC, Precedence Parser.

Unit-III: Intermediate Code Generation

Syntax Directed Definitions, Evaluation Orders for Syntax Directed Definitions, Intermediate Languages: Syntax Tree, Three Address Code, Types and Declarations, Translation of Expressions, Type Checking.

Unit-IV: Run-Time & Optimization

Course Learning Outcomes (CLOs)

• Describe the structure, phases, and working of a compiler and finite automata generation.
• Construct lexical analyzers and parsers using grammar rules and parsing techniques.
• Develop intermediate representations such as syntax trees and three-address code from source language constructs.
• Analyze runtime memory organization and address resolution techniques used during program execution.
• Apply code generation and code optimization techniques to improve program performance.

Unit-I: Network Fundamentals

What is the Internet, the Network edge, the Network core, Access Networks and Physical media, ISPs and Internet Backbones, Packet-Switched Networks. Foundation of Networking Protocols: 5-layer TCP/IP Model, 7-Layer OSI Model, Internet Protocols and Addressing. Networking Devices: Multiplexers, Modems and Internet Access Devices.

Unit-II: Logical Addressing & Routing

Logical Addressing: IPv4 Addresses, IPv6 Addresses. Internet Protocol: Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6 – Multicasting Techniques and Protocols: Basic Definitions and Techniques, Intradomain Multicast Protocols, Interdomain Multicast Protocols.

Unit-III: VPNs & Multimedia Networking

VPNs, Tunneling and Overlay Networks: Virtual Private Networks (VPNs), Multiprotocol Label Switching (MPLS), Overlay Networks – VoIP and Multimedia Networking: Overview of IP Telephony, VoIP Signaling Protocols, Real-Time Media Transport Protocols.

Unit-IV: Wireless & Mobile Networks

Mobile A-Hoc Networks: Overview of Wireless Ad-Hoc Networks, Routing in Ad-Hoc Networks, Routing Protocols for Ad-Hoc Networks – Wireless Networks and Mobile IP: Infrastructure of Wireless Networks, Wireless LAN Technologies, IEEE 802.11 Wireless Standard, Cellular Networks, Mobile IP, Wireless Mesh Networks (WMNs).

Course Learning Outcomes (CLOs)

• Explain Internet architecture, networking models, protocols, and addressing schemes.
• Analyze link, network, transport, and application layer functionalities and protocols.
• Apply routing, congestion control, and multicast techniques in different network environments.
• Evaluate wireless, optical, VPN, multimedia, ad-hoc, and sensor network technologies and their applications.

Unit-I: Graphics Systems and Input Devices

Unit-II: Output Primitives and 2D Transformations

Unit-III: 2D Viewing and 3D Concepts

Unit-IV: Curves and Visible Surface Detection

Course Outcomes (CLOs):

• Identify and describe the operation of various display and input devices.
• Implement and analyze algorithms for scan conversion and character generation.
• Perform complex 2D and 3D transformations including composite operations.
• Execute clipping algorithms for lines and polygons in a viewing pipeline.
• Apply mathematical models for curves and determine surface visibility in 3D space.

Unit-I: Concept of Entrepreneur

Evolution of the Concept of Entrepreneur, Characteristics of Entrepreneur, Entrepreneur vs. Intrapreneur, Classification of entrepreneurs, classification by Clarence Danhof, Entrepreneurial Competency and its types, Entrepreneurial Functions, Role of Entrepreneurs in the Economic Development, Factors Affecting Entrepreneurial Growth- Economic, Social, Personality, Psychological, Cultural. Recent Developments in Women Entrepreneurship (Empowerment).

Unit-II: Institutional Support and Framework

Unit-III: MSMEs and Startups

Unit-IV: Insurance, Funding and Sickness

Insurance, Recruitment of manpower, Procurement of raw materials, Production, Marketing, Quality Assurance, Permanent Registration, Continuous Market Research, Monitoring. National Single Window System, Creation of a Project Report (activity for students), Loan and Funding schemes of India and State/H.P. Sickness, Insolvency and Bankruptcy of Industrial Units: Reasons of sickness of industries, and types of sickness/failures, Valuation and Insurance, The Insolvency and Bankruptcy Board of India (IBBI), Insolvency Professionals, Insolvency Professional Entities, Registered Valuer Organizations (RVOs), Registered Valuers, Registered Valuers Entities.

Course Learning Outcomes (CLOs)

• Describe the concept, characteristics, and types of entrepreneurs and their role in economic development.
• Explain the institutional and financial support systems available for entrepreneurs.
• Classify MSMEs and discuss their significance and supporting policies.
• Outline key features and benefits of startup schemes and initiatives.
• Apply basic concepts of business operations and project planning.
• Identify causes of business failure and understand the insolvency framework.

Unit-I: Internet of Things (IoT)

Introduction, Definitions & Characteristics of IoT, IoT Architectures, Physical & Logical Design of IoT, Enabling Technologies in IoT, History of IoT, About Things in IoT, The Identifiers in IoT, About the Internet in IoT, IoT frameworks, IoT and M2M.

Unit-II: Hardware for IoT

Definition, Types of Sensors, Types of Actuators, Examples and Working, IoT Development Boards: Arduino IDE and Board Types.

Unit-III: Programming the Arduino

Arduino Platform Boards Anatomy, Arduino IDE, coding, additions in Arduino, programming the Arduino for IoT.

Unit-IV: Domain Specific IoTs

Home Automation, Smart Cities, Energy, Retail Management, Logistics, Agriculture, Health and Lifestyle, Industrial IoT.

Course Learning Outcomes (CLOs)

• Understand the definition and usage of the term "Internet of Things" in different contexts.
• Understand the key components that make up an IoT system.
• Build simple IoT systems using Arduino.
• Understand where the IoT concept fits into the broader ICT industry.

Project Guidelines

• Group Formation: Each group will consist of 4-5 students.
• Leadership: Each group should select a team leader and maintain a daily diary.
• Mentorship: Groups work under the mentorship of a faculty supervisor.
• Attendance: Mandatory 2 hours per week/slot to be recorded by the supervisor.

Submission Requirements

Course Learning Outcomes (CLOs)

• Develop skills necessary for structuring, managing, and executing projects.
• Design, develop, debug, document, and deliver a project in a team environment.
• Develop written and oral communication skills through reports and presentations.
• Become proficient with software development tools and environments.
• Apply interdisciplinary knowledge to engineering design solutions considering ethics.

List of Experiments

* Minimum 08 experiments must be performed.

1. To study the structure of a compiler and its different phases.
2. To design a lexical analyzer using C to identify keywords, identifiers, operators, and numbers.
3. To implement a lexical analyzer using Flex.
4. To implement a recursive descent parser.
5. To implement syntax analyzer using YACC.
6. To construct parse tree for expression grammar.
7. To implement symbol table.
8. To generate three-address code.
9. To apply code optimization techniques.
10. To generate target code.
11. Write a C Program to implement DFAs that recognize identifiers, constants, and operators of the mini language.
12. Write a lex program to implement simple calculator.
13. Design a Lexical analyzer for the given language (ignoring redundant spaces, tabs, and newlines).
14. Implement the lexical analyzer using JLex, flex, or other lexical analyzer generation tools.
15. Write a program to accept given Grammar s->aA|a, A->a.
16. Write a Program for construction of LR Parsing table using C.
17. Design a Predictive Parser for a specific grammar G.
18. Design LALR bottom-up parser for the language using tools.
19. Write program to generate machine code from the abstract syntax tree generated by the parser.

List of Experiments

* Minimum 08 experiments must be performed.

1. Write a program to draw a pixel (x, y) and display the color in which the pixel (x, y) is illuminated on the screen.
2. Write a program to implement the DDA line drawing algorithm.
3. Write a program to implement Bresenham’s Line Drawing Algorithm.
4. Write a program to implement Bresenham’s Circle Drawing Algorithm.
5. Write a program to implement Bresenham’s Ellipse Drawing Algorithm.
6. Write a program to draw a rectangle from pixel (100, 200) to pixel (400, 500).
7. Write a program to draw a circle with center (150, 150) and radius 25.
8. Write a program to implement Composite Transformations.
9. Write a program to implement Basic Transformations (translation, rotation, and scaling on a rectangle).
10. Write a program to implement animation using C functions.
11. Write a program to implement a cartoon using C functions.