Friday, 19 August 2022

CS3353 FOUNDATIONS OF DATA SCIENCE L T P C 3 0 0 3

 CS3353 FOUNDATIONS OF DATA SCIENCE L T P C 3 0 0 3

COURSE OBJECTIVES:

· To understand the data science fundamentals and process.

· To learn to describe the data for the data science process.

· To learn to describe the relationship between data.

· To utilize the Python libraries for Data Wrangling.

· To present and interpret data using visualization libraries in Python

UNIT I INTRODUCTION 9

Data Science: Benefits and uses – facets of data - Data Science Process: Overview – Defining research goals – Retrieving data – Data preparation - Exploratory Data analysis – build the model– presenting findings and building applications - Data Mining - Data Warehousing – Basic Statistical descriptions of Data

UNIT II DESCRIBING DATA 9

Types of Data - Types of Variables -Describing Data with Tables and Graphs –Describing Data with Averages - Describing Variability - Normal Distributions and Standard (z) Scores

 UNIT III DESCRIBING RELATIONSHIPS 9

Correlation –Scatter plots –correlation coefficient for quantitative data –computational formula for correlation coefficient – Regression –regression line –least squares regression line – Standard error of estimate – interpretation of r2 –multiple regression equations –regression towards the mean

UNIT IV PYTHON LIBRARIES FOR DATA WRANGLING 9

Basics of Numpy arrays –aggregations –computations on arrays –comparisons, masks, boolean logic – fancy indexing – structured arrays – Data manipulation with Pandas – data indexing and selection – operating on data – missing data – Hierarchical indexing – combining datasets – aggregation and grouping – pivot tables

UNIT V DATA VISUALIZATION 9

Importing Matplotlib – Line plots – Scatter plots – visualizing errors – density and contour plots – Histograms – legends – colors – subplots – text and annotation – customization – three dimensional plotting - Geographic Data with Basemap - Visualization with Seaborn.

 COURSE OUTCOMES: At the end of this course, the students will be able to:

CO1: Define the data science process

CO2: Understand different types of data description for data science process

CO3: Gain knowledge on relationships between data

CO4: Use the Python Libraries for Data Wrangling

 CO5: Apply visualization Libraries in Python to interpret and explore data

 TOTAL:45 PERIODS

TEXTBOOKS:

1. David Cielen, Arno D. B. Meysman, and Mohamed Ali, “Introducing Data Science”, Manning Publications, 2016. (Unit I)

2. Robert S. Witte and John S. Witte, “Statistics”, Eleventh Edition, Wiley Publications, 2017. (Units II and III)

3. Jake VanderPlas, “Python Data Science Handbook”, O’Reilly, 2016. (Units IV and V)

REFERENCE:

1. Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea Press,2014

CS3352 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION L T P C 3 0 2 4

 CS3352 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION L T P C 3 0 2 4

COURSE OBJECTIVES:

· To analyze and design combinational circuits.

· To analyze and design sequential circuits

· To understand the basic structure and operation of a digital computer.

· To study the design of data path unit, control unit for processor and to familiarize with the hazards.

· To understand the concept of various memories and I/O interfacing.

UNIT I COMBINATIONAL LOGIC 9

Combinational Circuits – Karnaugh Map - Analysis and Design Procedures – Binary Adder – Subtractor – Decimal Adder - Magnitude Comparator – Decoder – Encoder – Multiplexers - Demultiplexers

UNIT II SYNCHRONOUS SEQUENTIAL LOGIC 9

 Introduction to Sequential Circuits – Flip-Flops – operation and excitation tables, Triggering of FF, Analysis and design of clocked sequential circuits – Design – Moore/Mealy models, state minimization, state assignment, circuit implementation - Registers – Counters.

UNIT III COMPUTER FUNDAMENTALS 9

Functional Units of a Digital Computer: Von Neumann Architecture – Operation and Operands of Computer Hardware Instruction – Instruction Set Architecture (ISA): Memory Location, Address and Operation – Instruction and Instruction Sequencing – Addressing Modes, Encoding of Machine Instruction – Interaction between Assembly and High Level Language.

UNIT IV PROCESSOR 9

Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control, Microprogrammed Control – Pipelining – Data Hazard – Control Hazards.

UNIT V MEMORY AND I/O 9 Memory Concepts and Hierarchy – Memory Management – Cache Memories: Mapping and Replacement Techniques – Virtual Memory – DMA – I/O – Accessing I/O: Parallel and Serial Interface – Interrupt I/O – Interconnection Standards: USB, SATA

 45 PERIODS

PRACTICAL EXERCISES: 30 PERIODS

1. Verification of Boolean theorems using logic gates.

2. Design and implementation of combinational circuits using gates for arbitrary functions.

3. Implementation of 4-bit binary adder/subtractor circuits.

4. Implementation of code converters.

5. Implementation of BCD adder, encoder and decoder circuits

6. Implementation of functions using Multiplexers.

7. Implementation of the synchronous counters

8. Implementation of a Universal Shift register.

 9. Simulator based study of Computer Architecture

COURSE OUTCOMES: At the end of this course, the students will be able to:

CO1 : Design various combinational digital circuits using logic gates

CO2 : Design sequential circuits and analyze the design procedures

CO3 : State the fundamentals of computer systems and analyze the execution of an instruction

CO4 : Analyze different types of control design and identify hazards

CO5 : Identify the characteristics of various memory systems and I/O communication

TOTAL:75 PERIODS

TEXT BOOKS

1. M. Morris Mano, Michael D. Ciletti, “Digital Design : With an Introduction to the Verilog HDL, VHDL, and System Verilog”, Sixth Edition, Pearson Education, 2018.

2. David A. Patterson, John L. Hennessy, “Computer Organization and Design, The Hardware/Software Interface”, Sixth Edition, Morgan Kaufmann/Elsevier, 2020.

REFERENCES

1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Naraig Manjikian, “Computer Organization and Embedded Systems”, Sixth Edition, Tata McGraw-Hill, 2012.

2. William Stallings, “Computer Organization and Architecture – Designing for Performance”, Tenth Edition, Pearson Education, 2016.

3. M. Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 2016

 

MA3354 DISCRETE MATHEMATICS

 MA3354 DISCRETE MATHEMATICS                         L T P C 3 1 0 4 

 COURSE OBJECTIVES: 

 To extend student’s logical and mathematical maturity and ability to deal with abstraction. 

 To introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems. 

 To understand the basic concepts of combinatorics and graph theory. 

 To familiarize the applications of algebraic structures. 

 To understand the concepts and significance of lattices and boolean algebra which are widely used in computer science and engineering. 

UNIT I LOGIC AND PROOFS 9+3 

Propositional logic – Propositional equivalences - Predicates and quantifiers – Nested quantifiers – Rules of inference - Introduction to proofs – Proof methods and strategy. 

 UNIT II COMBINATORICS 9+3 

Mathematical induction – Strong induction and well ordering – The basics of counting – The pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications. UNIT III GRAPHS 9+3 

Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths. 

UNIT IV ALGEBRAIC STRUCTURES 9+3 

 Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields. 

UNIT V LATTICES AND BOOLEAN ALGEBRA 9+3 

 Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra – Sub Boolean Algebra – Boolean Homomorphism. 

 TOTAL: 60 PERIODS 

 COURSE OUTCOMES: At the end of the course, students would : 

CO1:Have knowledge of the concepts needed to test the logic of a program. 

CO2:Have an understanding in identifying structures on many levels. 

CO3:Be aware of a class of functions which transform a finite set into another finite set which relates to input and output functions in computer science. 

 CO4:Be aware of the counting principles. 

CO5:Be exposed to concepts and properties of algebraic structures such as groups, rings and fields. 

23 TEXT BOOKS: 

1. Rosen. K.H., "Discrete Mathematics and its Applications", 7th Edition, Tata McGraw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2017. 

 2. Tremblay. J.P. and Manohar. R, "Discrete Mathematical Structures with Applications to Computer Science", Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011. 

REFERENCES: 1. Grimaldi. R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction", 5 thEdition, Pearson Education Asia, Delhi, 2013. 

2. Koshy. T. "Discrete Mathematics with Applications", Elsevier Publications, 2006. 

3. Lipschutz. S. and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata McGraw Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.

Anna University Syllabus Regulation 2021 UG R21 CSE IT MECH BIOMED ECE AIDS

 

Anna University Syllabus Regulation 2021 UG/PG

Anna University R2021 UG/PG Degree Program Syllabus for Affiliated Colleges of Anna University. Students are requested to download the Syllabus and prepare according to the Syllabus. The questions in the Semester Examinations will be only from the Syllabus.

DEPARTMENT OF UG COURSES

BE BIO MEDICALDOWNLOAD
B.Tech AIDSDOWNLOAD
Mechanical DOWNLOAD
B.E RoboticsDOWNLOAD
B.E CSEDOWNLOAD
B.Tech ITDOWNLOAD
B.E ECEDOWNLOAD

Sunday, 3 April 2022

CS8491 COMPUTER ARCHITECTURE LESSON PLAN

 Sub. Code: CS8491                                                                Branch / Year / SEM: IT/II/ IV

Sub. Name: COMPUTER ARCHITECTURE                       Batch: 2019-2023

                         Academic Year: 2021-2022(EVEN SEM)

 

COURSE OBJECTIVES:

    To learn the basic structure and operations of a computer.
• To learn arithmetic and logic unit and implementation of fixed-point and floating-point arithmetic units.

• To learn the basics of pipelined execution.
• To understand parallelism and multi-core processors.
• To understand the memory hierarchies, cache memories, and virtual memories.

• To learn the different ways of communication with I/O devices.

Friday, 1 April 2022

CS8491 Computer Architecture

 

Kings Engineering College

Department of Information Technology

Semester IV – II year

CS8491  Computer Architecture – SYLLABUS

UNIT I BASIC STRUCTURE OF A COMPUTER SYSTEM 

Functional Units — Basic Operational Concepts — Performance — Instructions: Language of the Computer — Operations, Operands — Instruction representation — Logical operations — decision making — MIPS Addressing.

UNIT II ARITHMETIC FOR COMPUTERS 

Addition and Subtraction — Multiplication — Division — Floating Point Representation — Floating Point Operations — Subword Parallelism

UNIT III PROCESSOR AND CONTROL UNIT 

A Basic MIPS implementation — Building a Datapath — Control Implementation Scheme — Pipelining — Pipelined datapath and control — Handling Data Hazards & Control Hazards — Exceptions.

UNIT IV PARALLELISIM 

Parallel processing challenges — Flynn?s classification — SISD, MIMD, SIMD, SPMD, and Vector Architectures — Hardware multithreading — Multi-core processors and other Shared Memory Multiprocessors — Introduction to Graphics Processing Units, Clusters, Warehouse Scale Computers and other Message-Passing Multiprocessors.

UNIT V MEMORY & I/O SYSTEMS 

Memory Hierarchy — memory technologies — cache memory — measuring and improving cache performance — virtual memory, TLB?s — Accessing I/O Devices — Interrupts — Direct Memory Access — Bus structure — Bus operation — Arbitration — Interface circuits — USB.


Wednesday, 14 October 2020

Madras University to declare final semester result today

 

Due to the pandemic, the university had held the final semester exams online. Students could appear for the exam from their respective homes.  

visit this site address: results.unom.ac.in

Madras University’s final result 2020: The University of Madras will declare the result of final term examinations today evening. Students who had appeared for the exam will be able to check their results at unom.ac.in by using their roll number. Due to the pandemic, the university had held the final semester exams online. Students could appear for the exam from their respective homes.

A total of 12 universities and the Directorate of Technical Education had opted for online examinations. Students who have appeared for the final semester exam can check their result by following these steps –

Step 1: Visit the official website
Step 2: Click on ‘examination’ in the main tab
Step 3: Please on the exam you appeared for
Step 4: Log-in using credentials
Step 5: Result will appear, download

Meanwhile, the admission process for 2020-21 session is on at the varsity. Those aspiring for admission to MPhil courses can apply till October 31. Reportedly, Anna University is also expected to declare its result this week, however, there is no official confirmation on the same yet.


Source: Indian Express

https://indianexpress.com/article/education/madras-university-final-semester-ug-pg-exam-result-2020-live-declared-direct-link-unom-ac-in-6724815/

CCS 365 Software Defined Network Lab Manual

 CCS 365 Software Defined Network Lab Manual 1) Setup your own virtual SDN lab i) Virtualbox/Mininet Environment for SDN - http://mininet.or...