PART A: Introduction Program: Certificate Class: B.Sc. Year: 1 Year Session: 2021-22 Subject: Computer Science | [1 [Course Code SI-COSC IT | | 2. | Course Title Computer System Architecture | (Paper J) | | Course Type (Core ‘Core Course | 3. | Course/Elective/Generic Elective/ Vocational To study this course, a student must have had the subject > | Ere Reaulste (Lfany) Physics/Maths in 12" class 3. | Course Learning Outcomes(CLO) ‘On completion of this course, learners will be able to: 1. Understand the basie structure, operation and characteristics of digital computer. 2. Be able to design simple combinational digital circuits based on given parameters Familiarity with working of arithmetic and logic unit as well as the concept of pipelining. 4. Know about hierarchical memory system including cache memories and virtual memory. | 5, Understand concept and advantages of parallelism, threading, multiprocessors and multicore processors. 6. Know the contributions of Indians in the field of computer architecture and related technologies. Credit Value Theory — 4 Credits 7._| Total Marks ‘Max. Marks : 25+75 | Min. Passing Marks: 33 PART B: Content of the Course | No. of Lectures (in hours per week): 2 Hrs. per week | Total No. of Lectures: 60 Hrs. Module % Topies | No. of Lectures 1 Fundamentals of Digital Electronics: Data Types, Complements, 10 Fixed-Point Representation, Floating-Point Representation, Binary and other Codes, Error Detection Codes. Logie Gates, Boolean Algebra, Map Simplification, Combinational Circuits, Sequential Circuit, simple combinational circuit design problems ireuits- Adder- Subtractor, Multiplexer, Demultiplexer, Decoders, Encoders Flip - Flops, Registers, Counters Abilasha KumarI | Basie Computer Organization: Instruction codes, Computer Registers, 10 | Computer Instructions, Timing & Control, Instruction Cycles, Memory | Reference Instruction, Input - Output & Interrupts, Complete Computer | Description & Design of Basic Computer. ill Tnstructions - Instruction formats, Addressing modes, Instruction codes, 10 Machine language, Assembly language. Register Transfer and Miero operations - Register Transfer Language, Register Transfer, Bus & Memory Transfer, Arithmetic Micro- operations, Logic Micro-operations, Shift Micro-operations. Vv Processor and Control Unit - Hardwired vs. Micro programmed 10 Control Unit, General Register Organization, Stack Organization, Instruction Format, Data Transfer & Manipulation, Program Control, Introductory concept of RISC, CISC, advantages and disadvantages of both. Pipelining ~ concept of pipelining, introduction to Pipelined data path and control ~ Handling Data hazards & Control hazards. V Memory and 1/0 Systems - Peripheral Devices, 1/0 Interface, 10 Data Transfer Schemes - Program Control, Interrupt, DMA Transfer. VO Processor, Memory Hierarchy, Processor vs. Memory Speed, High-Speed Memories, Main memory, Auxiliary memory. Cache Memory, Associative Memory, Interleaving, Virtual Memory, Memory Management. Vi Parallelism — meaning, types of parallelism, introduction to Instruetion- 8 level-parallelism, Parallel processing challenges, Applications. Flynn’s classification — Introduction to SISD, SIMD, MISD, MIMD Hardware multithreading — Introduction, types, advantages and applications. Multicore processors ~ Introduction, advantages, difference from multiprocessor. Vil | Indian contribution to the field — Contributions of reputed scientists of 2 Indian origin - like - Dr. Vinod Dham — Father of Intel Pentium Processor, Dr. Ajay Bhat ~ Co-Inventor of USB Technology, Dr. Vinod Khosla- co-founder of Sun Microsystems, Dr. Vijay P Bhatkar - architect, | of India's national initiative in supercomputing, and many others. Parallel Computing projects of India — PARAM, ANUPAM, FLOSOLVER, CHIPPS etc. Other relevant contributors and contributions, duo ‘Abhilasha KumarKeywords/Tag: ital Electronics, Logic Gates, Circuits. Instruction formats, Addressing Modes, Parallelism, Pipelining, Memory Hierarchy, Multicore, Multithreading, SISD, SIMD, MISD, MIMD, PARAM, ANUPAM, FLOSOLVER, CHIPPS PART C: Learning Resources Textbooks, Reference Books, Other Resources ‘Suggested Readings: ‘¢ MMorris Mano, “Computer System Architecture”, PHI. ‘¢ Heuring Jordan , “Computer System Design & Architecture” (A.W.L.) ‘* William Stalling, “Computer Organization & Architecture”, Pearson Education Asia. © V. Carl Hamacher , “Computer Organization”, TMH, ‘* Tannenbaum, “Structured Computer Organization”, PHI Suggestive digital platform web links : hups://vww, youtube,.com/watch?v=4TzMyXmz1.8M hhtips://nptel.ac.in/courses/106/106/106106166/ hups://nptel,ac.in/courses/106/106/106106134/ Suggested equivalent online courses hhtips://npiel.ac.infeourses/106/105/106105163/ PART D: Assessment and Evaluation Internal Assessment : Continuous Comprehensive Evaluation (CCE) : 25 Marks Shall be based on allotted assignments and Class ‘Tests. The marks shall be as follows: External Assessment: University Exam (UE) : 75 Marks Time : 02.00 Hours “Assessment and Section (A): Three Very ] 03 x 03 = 09 Marks presentation of 10 Marks Short Questions (50 Words assignment Each ) oR Class Test I ( Objective Wiad OR Questions) Nine MCQ Questions 09x 01 = 09 Marks Class Test 11 5 Marks Section (B) : Four Short Descriptive Questiows):| | Questions (200 Words | 04 x 09= 36 Marks. Class Test II (Based on jam | solving circuit design | 5 Marks Section (C): Two Long | problems) Questions (500 Words | 02x 15= 30 Marks Each) Total 25 Marks Total 75 Marks “Any remarks/suggestions: Learnings in the course should be emphasised more on practical aspects and real world problems and their solutions. Yaw Abhilasha KumarPART A: Introduction Program: Certificate Class: B.Se. ~ | Year: 1 Year Session: 2021-22 Subject: Computer Seience T. [Course Code SL-COSCIP, 7 ae ‘Computer Architecture Lab | (Paper 1) : a Course Type (Core Core Course 3. | Course/Elective/Generic Elective/ Vocational To study this course, a student must have had the subject 4, | Pre-Requisite (if any) Physies/Maths in 12" class. 3. | Course Learning Outcomes(CLO) On completion of this course, learners will be able to: 1. Realization of the basic logic and universal gates. 2. Verify the behavior of logic gates using truth tables, 3. Implement Binary-to -Gray, Gray-to -Binary code conversions 4. Design half and full adder circuit using basic gates. 5. Design and construct flip flops and verify the excitation tables. 6._| Credit Value Practical - 2 Credits 7._[ Total Marks Max. Marks :25+75 __| Min. Passing Marks: 33 PART B: Content of the Course No. of Lab, Practicals (in hours pet week): 2 Hrs. per week Total No. of Labs: SoH Suggestive list of Practicals No. of Labs. To study basic gates (AND, OR, NOT) and verify their truth tables. To convert a given binary number to Gray code using IC 7486. To study and verify NAND as Universal gate using IC 7400. To study half adder using basic gates and verify its truth table, To study Full Adder using basic gates and verify its truth table, To realize basic gates (AND, OR, NOT) from Universal gates (NAND and NOR). To verify truth table of 4-bit adder using IC 7483. 8. To design and construct RS flip Flop using gates and verify the truth table. 9. To design and construct JK flip Flop using gates and verify the truth table. 10, To verify DeMorgan’s Theorem. | dour Abbilasha KumarKeywords/Tags: Digital Electronics, Logie Gates, AND, OR, NOT, IC 7486, IC 7400, NAND, NOR, IC 7483, Circuits, Flip Flop, DeMorgan’s Theorem PART C: Learning Resources i Textbooks, Reference Books, Other Resources Suggested Readings: ‘¢-M.Morris Mano, “Computer System Architecture” © Heuring Jordan , “Computer System Design & Architecture” (A.W.L.) © William Stalling, “Computer Organization & Architecture”, Pearson Education Asia, ¢V.Carl Hamacher , “Computer Organization”, TMH ‘© Tannenbaum, “Structured Computer Organization”, PHI. PHI, Suggestive digital platform web links : | hutps:/www.youtube.com/wateh?v=4TzMyXmzL8M dh in/courses/106/106/106106 166! htips://nptel.ac.in/courses/106/106/106106134/ Suggested equivalent online courses m ink 10671057106105 1637 PART D: Assessment and Evaluation Internal Assessment : Continuous External Assessment: University Exam (UE) : 75 ‘Comprehensive Evaluation (CCE) : 25 Marks | Marks _ : Time : 02.00 Hours Internal Assessment Marks | External Assessment Hands-on Lab Practice 3 Marks Practical record file Tab Test from practical 12 Marks Viva voce on practical list & internal viva | ‘Assignments (Charts/ 8 Marks Table works/ Experiments 50 Marks Model/ Seminar / Rural Service/ Technology Dissemination’ Report of Excursion/ Lab Visits! Survey / Industrial visit) Total 25 Marks Total 73 Marks ‘Any remarks/suggestions: Learnings in the course should be emphasised more on real world Jou ‘Abhilasha KumarPART : Introduction Program: Certificate Class: B.Se. Year: Tear | Session: 2021-22 Subject: Computer Science Course Code si-coscgr Course Title Programming Methodologies & Data Structures (Paper Z) _ Course Type (Core Course/Elective/Generie Elective/ Vocational Core Course Pre-Requisite (if any) To study this course, a student must have had the subject Physies/Maths in 12 class. | Course Learning Outcomes(CLO) On completion of this course, learners will be able to: 1. Develop simple algorithms and flow charts to solve a problem with programming using top down design principles. 2. Writing efficient and well-structured computer algorithms/programs. 3. Leam to formulate iterative solutions and array processing algorithms for problems, 44. Use recursive techniques, pointers and searching methods in programming. 5. Will be familiar with fundamental data structures , their implementation; become accustomed to the description of algorithms in both functional and procedural styles 6. Have knowledge of complexity of basie operations like insert, delete, search on these data structures. 7. Possess ability to choose a data structure to suitably model any data used in computer applications. 8. Design programs using various data structures including hash tables, Binary and general search trees, heaps, graphs ete. 9. Assess efficiency tradeoffs among different data structure implementations. 10. Implement and know the applications of algorithms for searching and sorting etc. 11. Know the contributions of Indians in the field of programming and data structures. Credit Value Theory — 4 Credits ‘Total Marks Max. Marks : 25+75 Min, Passing Marks: 33 a fasha KumarPART B: Content of the Course No. of Lectures (in hours per week): 2 Hrs. per week Total No. of Lectures: 60 Hrs. Module I Topics No. of Lectures Introduction to Programming - Program Concept, Characteristics of | Programming, Stages in Program Development, Algorithms, Notations, Design, Flowcharts, Types of Programming Methodologies. Introduction to C++ Programming - Basic Program Structure In C++, Data Types, Variables, Constants, Operators and Basic 1/0 Variables - Declaring, Defining and Initializing Variables, Scope of | Variables, Using Named Constants, Keywords, Casting of Data Types, | Operators (Arithmetic, Logical and Bitwise), Using Comments in | programs, Character I/O (getc, getchar, pute, putchar etc.), Formatted | and Console 1/0 (printf), scanf{), cin, cout), Using Basic Header Files (Gtdio.h, iostream.h, conio.h etc.) ‘Simple Expressions in C++ (including Unary Operator Expressions, Binary Operator Expressions), Understanding Operators Precedence in | Expressions Conditional Statements if construct, switch-case construct. 1 Tterative Statements while, do-while, and for loops, Use of break and | continue in Loops, Using Nested Statements (Conditional as well as | Iterative) Functions Top-Down Design, Pre-defined Functions, Programmer ~ defined Functions, Local Variables and Global variables, Functions | with Default Arguments, Call-By-Value and Call-By-Reference | Parameters, Recursion. Introduction to Arrays - Declaration and Referring Arrays, Arrays in Memory, Initializing Arrays. Arrays in Functions, Multi-Dimensional | Arrays i | Structures - Member Accessing, Pointers to Structures, Structures and | Functions, Arrays of Structures. | Unions - Declaration and Initialization, | Strings - Reading and Writing Strings, Arrays of Strings, String and | Function, Strings and Structure, Standard String Library Functions. | Searching Algorithms - Linear Search, Binary Search. File Handling - Use of files for data input and output, merging and copying files Data Structure - Basic concepts, Linear and Non-Linear data structures: 12 Abhilasha Kumar‘Algorithm Specification-Introduction, Recursive algorithms, Data Abstraction, Performance analysis. Linked List - Singly Linked Lists, Operations, Coneatenating, | scaly inked Tit-Opertions fir Sina Vine, oy Linked Lists- Operations. Array - Representation of single, two dimensional arrays, sparse matrices-atray and linked representations. Stack- Operations, Array and Linked Implementations, Applications- Infix to Postfix Conversion, Postfix Expression Evaluation, Recursion Implementation. ‘Queue- Definition, Operations, Array and Linked Implementations. 0 Circular Queue-Insertion and Deletion Operations, Dequeue (Double | Ended Queue), Priority Queue- Implementation. Trees - Representation of Trees, Binary tre, Properties of Binary Trees, Binary Tree Representations- Array and Linked Representations, Binary Tree Traversals, Threaded Binary Trees. | Heap- Definition, Insertion, Deletion, VI] Graphs - Graph ADT, Graph Representations, Graph Traversals, 10 | Searching Hashing- Introduction, Hash tables, Hash functions, Overflow Handling | | Sorting Methods, Comparison of Sorting Methods, Search Trees - Binary Search Trees, AVL Trees- Definition and | Examples VII Indian Contribution fo the field: Innovations in India, origin of Sulla Programming Language. Indian Engineers who designed new programming languages, open source languages, Dr. Sartaj Sahni — ‘computer scientist - pioneer of data structures, Other relevant contributors and contributions. | Keywords/Tags: Programming. C++, Data Structures, Expressions, Control, File Handling, Arrays, Stack, Queue, Linked List, Tree, Graph, Structure, Union, Hash, Search, Sort, Algorithm i PART C: Learning Resources I Textbooks, Reference Books, Other Resources /‘Suggested Readings: « Lipschutz: Schaum's outline series Data structures, Tata McGraw-Hill | © Problem Solving and Program Design in C, J. R. Hanly and E. B. Koffman, Pearson, 2015 ‘© E, Balguruswamy, "C++ " TMH Publication ISBN 0-07-462038-X | # Herbertz Shield, "C++ The Complete Reference "TMH Publication ISBN 0-07-463880-7 © R. Lafore, ‘Object Oriented Programming C++" Jue Abhilasha Kumar'N. Dale and C. Weems, Programming and problem solving with C++: brief edition, Jones & Bartlett Learning. ‘Adam Drozdek, "Data Structures and algorithm in C++", Third Edition, Cengage Learning Sartaj Sahani, Data Structures, Algorithms and Applications with C++, McGraw Hill Robert L. Kruse, "Data Structures and Program Design in C++", Pearson DS. Malik, Data Structure using C++, Second edition, Cengage Learning. M. A. Weiss, Data structures and Algorithm Analysis in C, 2nd edition, Pearson Suggestive digital platform web links https:/Awww.youtube.com/watch?2v=BCIS40yzssA hups://www.youtube.com/watch?v=vLnPwxZdWaY &vi=en hhttps://www.youtube.com/wateh?v=Umm 1ZQSIZw hups://vww.youtube.com/watch?v=A T14ICXuMK L&list=PLdoS W4Nhv31bbKJzrskMpo_grxul.I8LU Suggested equivalent online courses hhttps://nptelac.in/courses/106/105/1061051517 hutps://nptel,ac.in/courses/106/106/106106133/ PART D: Assess ‘and Evaluation Internal Assessment : Continuous | Comprehensive Evaluation (CCE) : 25 Marks | Shall be based on allotted assignments and Class ‘Tests. The marks shall be as follows: External Assessment: University Exam (UE) : 75 Marks Time : 02.00 Hours Assessment and Section (A): Three Very 93x 03 = 09 Marks presentation of 10 Marks Short Questions (50 Words assignment Each ) oR Class Test I(ObjestIVE |S a oR i Questions) “x | Nine MCQ Questions | 01 x 09=09 Marks Class Test Il sdks | Seetion (B) : Four Short (Descriptive Questions) | Questions (200 Words | 04 x 09 = 36 Marks Each) ee eee | sharks Seetion (C): Two Long co e Questions (500 Words bia | Each) | Total 25 Marks: Total ‘Any remarks/suggestions: Focus of the course/teaching should be on developing ability of the student in analyzing a problem, building the logic and efficient code for the problem. Aine Abhilasha KumarPART A; Introduetion Program: Certificate Class: B.Se. ‘Year: I Year Session: 2021-22 Subject: Computer Science 1. | Course Code s1-cosc ey . i al ae Office Tools & Programming Methodology Lab (Paper 2) 3. | Course Type (Core Core Course Course/Elective/Generic Elective/ Vocational © preRequiste Granyy | 1 Ud this course a student must have had the subject ‘a ” Physics/Maths in 12" class. 3. | Course Learning ‘Outeomes(CLO) On completion of this course, learners will be able to: 1. Develop simple algorithms and flow charts to solve a problem with programming using top down design principles, 2. Writing efficient and well-structured computer algorithms/programs. 3. Learn to formulate iterative solutions and array processing | algorithms for problems. 4, Use recursive techniques, pointers and searching methods in programming 5, Possess ability to choose a data structure to suitably model any data used in computer applications. 6._ Implementation of algorithms for searching and sorting. 6 | Credit Value Practical -2 Credits 7. | Total Marks Max. Marks : 25+75 Min, Passing Marks: 33 PART B: Content of the Course ‘No. of Lab Practicals (in hours per week): 2 Ha per week | Total No. of Lab.: Bd Het Suggestive list of Practicals No. of Labs. 1 Office Tools Bo His. ‘a, Using a Text Editor Tool Create a document and apply different Editing options. Create Banner for your college Design a Greeting Card using Word Art for different festivals. Design your Bio data and use page borders and shading.5. Create a document and insert header and footer, page title, date, time, apply various page formatting features etc. 6. Implement Mail Merge. 7. Insert a table into a document and try different formatting options for the table. Using a Spreadsheet Tool Design your class Time Table. Prepare a Mark Sheet of your class result. Prepare a Salary Slip of an employee of an organization, Prepare a bar chart & pie chart for analysis of Election Results. Prepare a generic Bill of a Super Market. Work on the following exercises on a Workbook: av eee a. Copy an existing Sheet b, Rename the old Sheet cc. Insert a new Sheet into an existing Workbook d. Delete the renamed Sheet. 7. Prepare an Attendance sheet of 10 students for any 6 subjects of your syllabus. Calculate their total attendance, total percentage of attendance of each student & average of attendance. 8. Create a worksheet of Students list of any 4 faculties and perform following database functions on it. a. Sort data by Name b. Filter data by Class c, Subtotal of no. of students by Class. ¢. Using a Presentation Tool Design a presentation of your institute using auto content wizard, design template and blank presentation, Design a presentation illustrating insertion of pictures, Word Art and Clipart, Design a presentation, lear how to save it in different formats, copying and opening an existing presentation. Design a presentation illustrating insertion of movie, animation and sound. Ilustrate use of custom animation and slide transition (us effects). 12 different Abhilasha Kumar6. Design a presentation using charts and tables of the marks obtained in class, Il. Given the problem statement, students are required to formulate problem, develop flowchart/algorithm, write code in C++, execute and test it. Students should be given assignments on following : 1. a, To lear elementary techniques involving arithmetic operators ‘and mathematical expressions, appropriate use of selection (i switch, conditional operators) and control structures; b. Leam how to use funetions and parameter passing in functions, writing recursive programs. 2. Write a program to swap the contents of two variables. Write a program for finding the roots of a Quadratic Equation. 4, Write a program to find area of a circle, rectangle, square using switch case. 5. Write a program to check whether a odd Write a program to print table of any number. Write a program to print Fibonacci series. Write 2 program to find factorial of a given number. Write a program to convert decimal (integer) number into equivalent binary number. 10. Write a program to check given string is palindrome or not LL. Write a program to perform multiplications of two matrices. 12. Write a program to print digits of entered number in reverse order. iven number is even or 13, Write a program to print sum of two matrices. 14. Write a program to print multiplication of two matrices. 15. Write a program to generate even/odd series from 1 to 100. 16. Write a program whether a given number is prime or not 17. Write a program for call by value and call by reference. 18, Write a program to generate a series 1+1/1!+2/21+3/3!+—- thin! 19, Write a program to create a pyramid structure | 20. Write a program to create a pyramid structure Abhilasha Kumar1 12 123 1234 21, Write a program to check entered number is Armstrong or not, | 22. Write a program for traversing an Array. 23. Write a program to input N numbers, add them and find average. 24. Write a program to find largest element from an array, 25. Write a program for Linear search. 26. Write a program for Binary search. 27. Write a program for Bubble sor. 28. Write a program for Selection sort. ~ Keywords/Tags: Programming. C++, Data Structures, if, else, for, while, do, File Handling, call by value, call by reference, recursion, Arrays, Union, Hash, Linear search, Binary search, Bubble sort, Selection sort. PART C: Learning Resources Textbooks, Reference Books, Other Resources Suggested Readings: ‘© Problem Solving and Program Design in C, J. R. Hanly and E. B. Koffiman, Pearson, 2015 E. Balguruswamy, "C++" TMH Publication ISBN 0-07-462038-X ation ISBN 0-07-463880-7 ‘© Herbertz Shield, "C++ The Complete Reference "TMH Publi ‘© R. Lafore, ‘Object Oriented Programming C++" ‘© N. Dale and C. Weems, Programming and problem solving with C++: brief edition, Jones & Bartlett Leaming. ‘Adam Drozdek, "Data Structures and algorithm in C++", Third Edition, Cengage Learning, Sartaj Sahani, Data Structures, Algorithms and Applications with C++, McGraw Hill. Robert L. Kruse, "Data Structures and Program Design in C++", Pearson, DS. Malik, Data Structure using C++, Second edition, Cengage Learning. M.A. Weiss, Data structures and Algorithm Analysis in C, 2nd edition, Pearson. ¢ Lipschutz: Schaum’s outline series Data structures, Tata McGraw-Hill Suggestive digital platform web links : hitps:/www.youtube.com/watch?v=BCI hitps://www.youtube.com/watch?v=vLnPwxZdW4Y &vi= https:/www.youtube.com/watch2v=UmmZQSItZw |ttps://nptel.ac.in/courses/106/106/1061061. al ‘Suggested equivalent online courses hitps://nptelac.in/eourses/ 106/105/10610515 17 hutps://nptel.ac.in/courses/106/105/106105 171/ huips:/onlinecourses.swayam2,ac.in/cecL9_mg3S/preview dow. Abhilasha KumarPART D: Assessment and Evaluation Internal Assessment : Continuous ‘Comprehensive Evaluation (CCE) : 25 Marks External Assessment: University Exam (UE) : 75 Marks Time : 02.00 Hours Tnternal Assessment Marks External Assessment Marks Hands-on Lab Practice | 5 Marks Practical record file | 10 Marks Lab Test from practical 12 Marks Viva voce on practical 15 Marks list & internal viva | ‘Assignments (Charts 8 Marks Table works/ Experiments 50 Marks | Model/ Seminar / Rural Service/ Technology Dissemination’ Report | of Excursion/ Lab Visits/ | Survey / Industral visit) Total 25 Marks Total [75 Marks ‘Any remarks/Suggestions: Foeus of the course/teaching should be on developing ability of the student in analyzing a problem, building the logic and efficient code for the problem. jouw ‘Abhilasha Kumar