Kumaun University Nainital Proposed Syllabus for B. Sc. Semester program to be implemented from session Subject: Computer Science

Size: px

Start display at page:

Download "Kumaun University Nainital Proposed Syllabus for B. Sc. Semester program to be implemented from session Subject: Computer Science"

Michael Edwards
5 years ago
Views:

1 Kumaun University Nainital Proposed Syllabus for B. Sc. Semester program to be implemented from session Subject: Computer Science Semester system course structure: 1. The course work shall be divided into six semesters with three papers in each semester. 2. Each paper in a semester will be of 80 marks out of which 60 marks for theory and 20 marks are allotted for internal assessment (written test or assignments or both) 3. Each theory paper shall consists of section A: 20% of total marks (12 marks; one question of 12 parts; multiple choice, one word/one sentence answer, fill in the blanks, true- false; all parts will be compulsory), section B: 40% of total marks (24 marks, one question of 06 parts; any 04 have to be attempted with short answer) and section C: 40% of total marks; (24 marks, 04 questions, any two have to be attempted with long answer). 4. Question paper shall cover the whole syllabus. 5. Practical in each semester will be of total 60 marks, out of which 15 marks are assigned for internal assessment (attendance, practical records etc.). 6. Practical examination will be evaluated by both external and internal examiner. Semester I BCS 101 Computer Fundamentals MM 60 UNIT I: Evolution of Computers: Basic components of a Digital Computer- Control unit, ALU, Input/Output functions and memory, Generations, Computer Classification: Micro, Mini, Mainframe, Super Computer, PC, Server, Workstations. UNIT II: Input/Output Units: Keyboard, Mouse, Trackball, Joystick, Digitizing tablet, Scanners, Digital Camera, MICR, OCR, OMR, Bar-code Reader, Voice Recognition, Light pen, Touch Screen, Monitors, Printers & types-daisy wheel, Dot Matrix, Inkjet, Laser, Line Printer, Plotter, Sound Card and Speaker. UNIT III: Memory: RAM, ROM, EPROM, PROM and other types of memory, Storage fundamentals- Primary Vs Secondary Data Storage, Various Storage Devices- Magnetic Tape, Magnetic Disks, Cartridge Tape, Hard Disk Drives, Floppy Disks, Optical Disks, CD, CD-R, CD-RW, DVD, DVD-RW Zip Drive, Flash drives Video Disk, Blue Ray Disc, USB Pen drive. UNIT IV: Software and its Need, Types of Software-System software, Application software, System Software- Operating System, Utility Program, Assemblers, Compilers and Interpreter, DOS- Files and Directory, Study of all Internal & External commands, Types of files, Programming languages. UNIT V:

2 Data Representation within Computer: BIT, BYTE, WORD, ASCII, EBCDIC, BCD Code. Introduction to Number system: Binary, Octal, Decimal and Hexadecimal, Conversation from one number system to another number system. 1. Fundamentals of Computers- V. Rajaraman 2. Fundamentals of Computers- P. K. Sinha 3. Introduction to Computers and C Programming- S. K. Bajpai and D. S. Yadav

3 BCS 102 Introduction to C Programming MM 60 Programming in C: History, Introduction to C Programming Languages, Structure of C programs, compilation and execution of C programs, Debugging Techniques, Algorithms, Flow Charts. Data Types and Sizes, Declaration of variables, Modifiers, Identifiers and keywords, Symbolic constants. Operators: Unary operators, Arithmetic & logical operators, Bit wise operators, Assignment operators and expressions, Conditional expressions, Precedence and order of evaluation. Control statements: if-else, else-if clause, switch, goto statement. Loops: for, while, do-while, break, continue. Pointer: Pointer notation, value at (*) and address of (&) operator, pointer to pointer. Unit IV: Functions: built-in and user-defined, function declaration and prototype, parameter passing: call by value, call by reference, recursive functions. Dynamic Memory allocation (malloc, calloc, free function) Arrays: linear arrays, multidimensional arrays, passing arrays to functions, Strings-Declaration and initialization, Standard library functions, Array of strings. File Handling in C: opening and closing a data file, file operations, File I/O, Read, Write and Other file function. 1. Let Us C- Yashavant Kanetkar 2. C Programming Language- B. W. Kernighan and D. M. Ritchie 3. C Programming- Balagurusamy

4 BCS 103 Discrete Mathematics MM 60 Set theory: Sets and Elements, Subsets, Venn Diagrams, Operations, Algebra of Sets, Duality, Finite Sets, Counting Principle, Classes of Sets, Power Sets, Partitions Relation: Introduction, Product Sets, Relations, Pictorial Representatives of Relations, Composition of Relations, Types of Relations, Equivalence Relations, Partial Ordering Relations. Function: Functions defined as relations, One-to-One, Onto, and Invertible Functions Logic and Propositional Calculus: Introduction, Propositions and Compound Statements, Basic Logical Operations, Propositions and Truth Tables, Tautologies and Contradictions, Logical Equivalence, Algebra of Propositions, Conditional and Biconditional Statements Unit-IV Techniques of Counting: Basic Counting Principles, Mathematical Functions, Permutations, Combinations, Pigeonhole Principle, Inclusion Exclusion Principle. Mathematical Induction. Ordered Sets and Lattices: Introduction, Ordered Sets, Hasse Diagrams of Partially Ordered Sets, Supremum and Infimum, Isomorphic (Similar) Ordered Sets. Lattices, Bounded Lattices, Distributive Lattices, Complements, Complemented Lattices 1. Discrete Mathematics- Seymour Lipschutz 2. Discrete Mathematics and its Applications- Kenneth Rosen 3. Discrete Mathematics for Computer- Peter Grossman

5 SEMESTER II

6 BCS 201 Data Structures using C MM 60 Introduction: Basic Terminology, Data type, Data object, Need of Data Structure, Types of Data Structure, Elementary Data Organization, Data Structure operations, Algorithm Complexity and Time-Space trade-off. Arrays, Single and Multidimensional Arrays, address calculation, application of arrays, Character String in C. Searching- Sequential search, binary search. Sorting algorithms with efficiency- Bubble sort, Insertion sort, Merge sort, Quick Sort Stacks: Array and linked representation and implementation of stack, Operations on Stacks: Push & Pop, Applications of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack. Recursion: Introduction, recursion in C, example of recursion, recursive functions. Unit IV: Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Insert, Delete, Full and Empty. Circular queue, Deques, and Priority Queues. Linked list: Representation and implementation of Singly Linked Lists, Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to and from Linked Lists, Doubly linked list. Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic expressions, Complete Binary Tree. Extended Binary Trees, Traversing Binary trees, Binary Search Tree, searching BST, insertion and deletion in BST. References : 1. Data Structures- Seymour Lipschutz 2. Data Structures using C and C++- Tanenbaum 3. Data Structure through C- Yashavant Kanetkar

7 BCS 202 Digital Electronics MM 60 Digital Systems and binary numbers, Number base conversions, Octal and Hexadecimal numbers, complements of numbers, Signed binary numbers, Binary Fixed- Point Representation, Arithmetic operation on binary numbers, Overflow & underflow. Binary codes Digital logic gates, Boolean Algebra-Axiomatic definition, truth tables, theorems and properties, Boolean functions, canonical and standard forms. Gate level minimization- K-Map method, 2, 3 and 4 variables map, POS and SOP simplification, Don t care conditions, NAND and NOR Implementations Combinational Logic: Combinational circuits, analysis and design procedure, binary adder-subtractor, binary multiplier, magnitude comparator, Decoders, Encoders, Multiplexres, Parity Generation and Checking Unit IV: Sequential Logic: Sequential circuits, Storage elements-latches and Flip-Flops (SK, D, JK, T), Analysis of clocked sequential circuits- state equations, state tables, state diagrams, Flip-Flop input equations, Design procedure, excitation tables. Registers, shift registers, Counters, ripple counters, synchronous counters, Memory- RAM, ROM, Programmable Logic Array (PLA) 1. Digital Logic and Computer design- M. Morris Mano 2. Modern Digital Electronics- R. P. Jain 3. Digital Electronics Principals and Integrated circuits- Anil K. Maini

8 BCS 203 Introduction to UNIX MM 60 Concepts in Operating System: Introduction, Functions of OS, Management of resources, OS classification- Batch, Multiprogramming, Multitasking, Multiprocessing, Multiuser, Time sharing, Real time. Basic knowledge of DOS, UNIX, Windows, Linux, UBUNTU, Android and ios. Introduction to UNIX, Hardware requirements for UNIX, Features of UNIX, UNIX System Organization- Kernel and Shell, types of Shell- Bourne, Korn and C Shells. System calls. Logging in UNIX system, UNIX commands and command switches. General purpose utilities: cal, date, echo, bc, who, who am i, tty, banner, wall, tput, bc. Filters- pr, head, tail, tee, combining commands with pipes. I/O redirection. Process, ps, kill and nice. Unit IV: UNIX File System: The File, blocks, Parent-Child relationship, file system hierarchy, file types, directory and device files, File and Directory permissions. File and directory related commands- touch, cat, cp, rm, mv, cmp, comm, diff, wc, sort, cut, paste, grep, pwd, ls, mkdir, rmdir, cd, chmod. vi Editor: Modes of operation, Entering, add and delete text, search, find and replace, delete and paste, quit vi. Shell Programming: Shell scripts, read, shell variables, shell keywords, positional parameter, command line arguments. Decision control, logical operator, loop control- while, until, for, break and continue 1. Unix Shell Programming- Yashwant Kanitkar 2. Unix Concepts and applications- Sumitabha Das 3. Advanced Unix programming guide- Parata

ST. MARY S COLLEGE FORM 4

ST. MARY S COLLEGE FORM 4 Term 1 Week 1 Week 2 FUNDAMENTALS OF HARDWARE AND SOFTWARE 1. The generalpurpose computer system 2. Functions of the major hardware components of a computer system 3. Functions and uses of primary storage