Syllabus For B. Sc. Computer Science (Hons) Under CBCS W.e .

2y ago
42 Views
2 Downloads
547.12 KB
26 Pages
Last View : 1m ago
Last Download : 2m ago
Upload by : Josiah Pursley
Transcription

Syllabus for B. Sc. Computer Science (Hons) under CBCSw.e.f. the Academic Year 2016-2017Semester - ICore-1Programming Fundamentals usingCC Programming LabCore-2Computer System ArchitectureGE-1(Generic Elective) From other subject AECC(Ability Enhancement Environmental StudiesCompulsory Course)Semester - IICore-3 Data StructuresCore-4Computer Oriented NumericalMethodsData Structure & Numerical LabGE-2(Generic Elective) From other subject AECC-2(AbilityMIL CommunicationEnhancement CompulsoryCourse)Semester - IIICore-5Object Oriented Programming inC C Programming LabCore-6Operating SystemsCore-7Computer NetworksGE-3(Generic Elective) From other subject SEC-1(Skill EnhancementCommunicative EnglishCourse)Semester - IVCore-8Discrete StructuresCore-9Software EngineeringCore-10Database Management SystemsDatabase LabGE-4(Generic Elective) From other subject SEC-2(Skill Enhancement From the pool of SEC courses Course)Semester - VCore-11Internet TechnologiesCore-12Java ProgrammingJava Programming LabInformation SecurityDSE-1 (Discipline Specific/MicroprocessorElective) Any oneCredits4262442 2242662664226426DSE-2(Discipline SpecificElective) Any one6Core-136Artificial Intelligence /Introduction to Data SciencesSemester - VIComputer GraphicsPage 1 of 26

Core-14DSE-3(Discipline SpecificElective) Any oneDSE-4(Discipline SpecificElective)Data Warehousing and DataMiningCloud Computing / Digital ImageProcessingSoftware Development ProjectWorkTotal666140SEMESTER - ICore – 1Programming Fundamentals using CUnit -1Overview of Procedure oriented programming, Data types, Defining and Initializing Variables, Scopeof Variables,Keywords, Casting of Data Types, Operators (Arithmetic, Relational, and Logical),main() function, Compiling and Executing a program, Using Comments in programs, Character I/O(getc, getchar, putc), printf(), scanf(), Basic Header Files (stdio.h, conio.h, math.h, string.h, etc).Unit -2Simple Expressions in C, Understanding precedence of Operators in Expressions, ConditionalStatements (IF, IF ELSE, Nested IF, Switch-Case), Iterative Statements(FOR, WHILE, and DOWHILE), Use of BREAK and CONTINUE in Loops, Nested loops.Unit -3Use of functions, Call by Value, Call by Reference, Functions returning value, Void function,OneDimensional Arrays (Declaring an Array, Initializingan Array, Accessing individual elements in anArray, Manipulating array elements usingloops), Use Various types of arrays (integer, float andcharacter arrays / Strings), Two-dimensional Arrays, Workingwith Rows and Columns of a matrix.Unit -4Understanding use of structures, Declaring, initializing and using simplestructures, Manipulatingindividual members of structures, Array ofStructures, Understanding Pointer Variable, Simple use ofPointers, Pointer arithmetic, Differentiating between static and dynamic memory allocation, use ofmalloc and calloc functions, Simple file handling operations.Books:1. Programming in ANSI C - E. Balguruswamy, TMH2. Let us C - Yaswant Kanitkar, BPBC Programming Lab1.2.3.4.5.Write a program to find the maximum among three numbers.Write a program to find factorial of a number.Write a program to print the Fibonacci series.Write a program to print the prime numbers between 1 to n.Write a program to check if it a Palindrome (e.g., madam).Page 2 of 26

6. Write a program to check if it is an Armstrong number. (An Armstrong number of three digitsis an integer such that the sum of the cubes of its digits is equal to the number itself)7. Write program to reverse the digits of an input number.8. Write a program to find the sum of digits of a number.9. Write a program to find the GCD and LCM of two numbers.10. Write a program to perform different arithmetic operations using switch .case.11. Write a program to count the number bits “1” in a given binary number.12. Write a program to find the factorial of a number using function.13. Write a program to perform the arithmetic operations using function.14. Write a program to find the largest element in an array.15. Write a program to add two matrices.16. Write a program to multiply two matrices.17. Write a program to find the position of a given character in a string.18. Write a program to count the number of times a character occurs in a string.19. Write a program to create records of 10 students using structure.20. Write a program to count the number of words, number of lines in a text file.Core – 2Computer System ArchitectureUnit -1Number systems – Decimal, Binary, Octal and Hexa-decimal number systems and their interconversion, 1's & 2's complement, Binary Fixed- Point Representation, Arithmetic operations onBinary numbers, Overflow & underflow. Logic Gates, AND, OR, NOT gates and their Truth tables,NOR, NAND & XOR gates, Boolean Algebra – Basic Operations and Boolean Law's, Demorgan'stheorem.Unit -2Sum of Product & Product of Sum, K-Map, Combinational & Sequential circuits, Half Adder & FullAdder, Adder & Subtractor, Multiplexer, De-multiplexer, Encoder, Decoder.Unit -3Flip-flops - RS, D, JK & T Flip-flops, Registers, Shift Registers, Counters.Unit -4Central Processing Unit: General register organisation, Stack organisation, Instruction Formats,Addressing modes, Memory: Main memory, Auxiliary memory, DMA- control signals for DMAtransfers, Block diagram of DMA controller, DMA transfer in a microcomputer system.Books:1.2.3.4.Computer System Architecture - M. Mano, Pearson EducationComputer Organization, Fifth edition - Carl Hamacher, McGrawHillDigital Design - M. M. Mano, Pearson Education AsiaComputer Fundamentals - B. Ram, New Age International PublishersPage 3 of 26

SEMESTER - IICore - 3Data StructuresUnit -1Primitive and non-primitive data types, Linear and non-linear data structures, Memory representationof Arrays (Single and Multi-dimensional Arrays), Representation of Stack, Queue, and CircularQueue, Insertion and deletion operations on these data structures, Applications of stack and Queue:Evaluation of recursive functions, Job Queues.Unit -2Limitations of Array representation, Linked List and its advantages, Representation of Singly, Doublyand Circularly linked Lists, Insertion and deletion operations on these data structures, Link listrepresentation for Stack and Queue, Applications of linked list: Representation of polynomials, SparseMatrix and its representation using Array and Linked list.Unit -3Introduction to Tree as a data structure, Binary Tree: Definition, related terminologies, Memoryrepresentation of Binary tree using array and linked list, Operations such as Inorder, Preorder, andPost order Traversals (recursive algorithms only), Binary Search Tree, Threaded Binary Tree(Representation only),Concept of Height-Balanced Tree.Unit -4Searching and Sorting techniques: Linear Search, Binary Search, Comparison of Linear and BinarySearch, Selection Sort, Bubble sort, Insertion Sort, Comparison of Sorting techniques. Merging ofarrays.Books:1. Data Structures, Schaume’s Outlines, By Lipschutz TMH Publications2. Data Structures, By Ellis Horowitz, SartajSahani, Galgotia Publications3. Data Structures using C & C By Aaron M. Tenenbaum, YedidyahLangsam PHICore - 4Computer Oriented Numerical MethodsUnit - 1Errors & Their Accuracy, Solutions of Algebraic and Transcendental Equations, Bisection Method,The method of false position, The iteration method, Newton Raphson method, Generalized Newton'smethod, Solutions of system of non-linear Equations: The method of iteration, Newton Raphsonmethod.Unit - 2Interpolation Errors in polynomial interpolation, Finite Differences Detection of errors by use ofdifference tables, Differences of a Polynomial, Newton’s formulae for interpolation, Centraldifference interpolation formulae, Guass’s Central difference formulae, Interpolation with unevenlyspaced points Lagrange's interpolation, Error in Lagrange's interpolation, Divided differences andtheir properties, Newton’s general interpolation formula-interpolation by iteration, inverseinterpolation.Page 4 of 26

Unit - 3Differentiation and Integration, Numerical Differentiation, Methods based on interpolation, Nonuniform nodal points-Linear interpolation, quadratic interpolation Uniform nodal points-Linearinterpolation, quadratic interpolation Methods based on finite differences Numerical IntegrationMethods based on interpolation-Newton’s Cotes methods, Trapezoidal method, Simpson's method,3/8Simpson's rule, open type integration rules. Methods based on undetermined coefficients - Newton'smethods, Trapezoidal rule, Simpson's rule.Unit - 4Solution of System of linear equation by iteration method, Gauss-Sidel method, Jacobi's method,Numerical solution of Ordinary Differential Equation. Solution by Taylor’s series, Euler’s method,Modified Euler’s method, Runge-Kutta method.Books:1. Introductory methods of Numerical Analysis - By S. S. Sastry, PHI2. Numerical Methods for Scientific and Engineering students - M.K.Jain, S.R.K.Iyengar, Newage international (P) Ltd.3. Computer Oriented Numerical Methods, - V. Rajaraman, PHIData Structure & Numerical Lab1. Write a program in C to search for an item in an array and display its position using Binarysearch.2. Write a program in C to arrange a set of numbers in ascending order of values using Selectionsort technique.3. Write a program in C to arrange a set of numbers in ascending order of values using Bubblesort technique.4. Write a program in C to perform Insertion and Deletion operations in a Stack represented asan array.5. Write a program in C to perform Insertion and Deletion operations in a Queue data structurerepresented as an array.6. To find out the root of the Algebraic and Transcendental equations using Bisection method.7. To find out the root of the Algebraic and Transcendental equations using Newton-Raphsonmethod.8. To implement Numerical Integration using Trapezoidal rule.9. To implement Numerical Integration using Simpson 1/3 rule.10. To implement Numerical Integration Simpson 3/8 rule.SEMESTER - IIICore - 5Object Oriented Programming in C Unit -1Object Oriented Programming concept, Procedural vs OOP programming, OOP terminology andfeatures, Tokens, Character set, Keywords, Data-types, Constants and variables, expressions, StandardPage 5 of 26

Library and header files. Operator and Expressions: Arithmetic Operator, Increment/DecrementOperator, Relational Operator, Logical Operator and conditional operators, library functions, LogicalExpressions.Unit - 2Control statements, IF, IF ELSE, Nested IF, Switch .Case, Looping statements, While, Do-while,For statements, nested loops.Classes and Objects: Need for Classes, Declaration of Classes, referencing class Members, Datamembers and member Functions, Inline Functions, Creation of objectsUnit -3Use of access specifiers, Public and Private, Function Overloading, use of Constructors andDestructors, Types of constructors: default, parameterized, and copy constructors, Operatoroverloading, Friend function, Arrays of objects.Unit - 4Concept of Inheritance, Types of inheritance: Single level, multi-level, multiple, hybrid, Use ofprotected access specifier, Function overriding, Exception handling, Simple file handling.Books:1.2.3.4.Object Oriented Programming with C -E. Balaguruswamy, TMHLet us C -YashavantKanetkar, BPBObject Oriented Programming with C -Sourav Sahay, Oxford University PressThe C Programming Language - Bjarne Stroustrup, Addison-WesleyC Programming Lab1. Define a class called STUDENT with the data members Roll No., Name, Marks secured infive subjects. Write member functions to do the following:i. Read dataii. Find the total mark and divisioniii. Display Roll No., Name, Total mark, and Division2. Define a class called SHAPE with appropriate data members. Find the area of differentgeometrical shapes using function overloading.3. Define a class called ACCOUNT with the data members Account no. Customer name,Amount and initialize with suitable constructor. Write member functions to do thefollowing:i. Deposit amountii. Withdraw amountiii. Check balance4. Using operator overloading add two given Lengths expressed as Feet and Inch.5. Using operator overloading add two given TIMEs expressed as Hour : Minute : Second.6. Concatenate two strings by overloading the ‘ ’ operator.7. Define a class called PLAYER with the data members Player ID, player name, highest runsscored, batting average, and number of wickets taken. Create 10 player instances (using arrayof objects) and initialize them with parameterized constructors. Write a member function todisplay the details of a player on inputting the player ID.Page 6 of 26

8. Define a class called PERSON with the data members Name, DOB, PAN #. Inherit twoclasses from it (i) CUSTOMER with A/C no. & Amount and (ii) EMPLOYEE withOrganization, Designation & Salary. Write suitable member functions to do the following:i. Input data for both base as well as derived class objectsii. Display customer details along with name, DOB and PAN #iii. Display employee details along with name, DOB and PAN #9. Define a class called STACK and implement the PUSH and POP operations on it.10. Define a class called QUEUE and implement the Insertion and Deletion operations on it.Core - 6Operating SystemsUnit -1Introduction, Basic OS functions, resource abstraction, types of operating systems–Batch,Multi programming, Time sharing, and Real time systems; operating systems for personalcomputers, Operating System Organization, Processor and user modes, kernels, system calls andsystem programs.Unit -2Process Management, Process State Transition diagram, Non-pre-emptiveandpre-emptivescheduling algorithms: FCFS, Shortest Job First, Round Robin, Priority Scheduling, Concurrentprocesses, concept of critical section, semaphores, Concept of Deadlock, Condition for deadlock.Concept of deadlock prevention, detection and recovery.Unit -3Memory Management, Physical and virtual address space, memory allocation strategies: fixed andvariable partitions, Paging, Segmentation, Demand paging, virtual memory, Page replacementtechniques (FIFO, LRU and Optimal).Unit -4File and I/O Management, Directory structures: Single level, multi-level, and tree structured directory,Concept of file, file operations, file allocation methods, Disk scheduling techniques(FCFS, ShortestSeek Time First, and Scan), File Protection and Security Policy, File Authentication andAccesscontrol.Books:1.2.3.4.Operating Systems Concepts -A. Silberschatz and P.B. Galvin, John WileyOperating Systems - A Concept based Approach – D M Dhamdhere, TMHModern Operating Systems - A.S. Tanenbaum, Pearson EducationOperating Systems - Concepts and design- M. Milenkovic, Tata McGraw HillPage 7 of 26

Core - 7Computer NetworksUnit -1Introduction to Computer Networks, Network Hardware, Network Software, Network Topologies(Star, Ring, Bus, Mesh), Network Classifications, Network Protocol, Layered Network Architecture,Overview of OSI Reference Model, Overview of TCP/IP protocol suite, DataUnit -2Communication Fundamentals and Techniques, Analog and Digital Signal, Data-rate limits,Multiplexing Techniques - FDM, TDM, Transmission Media, Networks Switching Techniques andAccess Mechanisms, Circuit Switching, Packet Switching- Connectionless Datagram Switching,Connection-Oriented, Virtual Circuit Switching.Unit -3Dial-up Modems, Digital Subscriber Line, Cable TV for data transfer, CSMA/CD protocols, EthernetLANs, Connecting LAN and Back-bone Networks - Repeaters, Hubs, Switches, Bridges, Routerand Gateways, Routing protocols, IP Addressing.Unit -4Transport Layer Functions and Protocols, Error and flow control, Connection establishment andrelease, Three-way handshaking, Overview of Application Layer Protocol, DNS, overview of WWW& HTTP Protocols, Electronic Mail.Books:1. Data Communications and Networking - B. A. Forouzan2. Computer Networks - A. S. TanenbaumSEMESTER - IVCore - 8Discrete StructuresUnit -1Sets - finite and Infinite sets, Functions, Relations, Properties of Binary Relations, Closure,Partial Ordering Relations, counting -Pigeonhole Principle, Permutation and Combination;Mathematical Induction, Principle of Inclusion and Exclusion.Unit -2Growth of Functions: Asymptotic Notations, Summation formulas and properties,BoundingSummations, Approximation by Integrals.Recurrences: Recurrence Relations, generating functions, Linear Recurrence Relations with constantcoefficients and their solution, Substitution Method.Page 8 of 26

Unit -3Graph Theory: Basic Terminology, Models and Types, multigraphs and weighted graphs, GraphRepresentation, Euler and Hamiltonian Paths and Circuits, Trees, Basic Terminology and propertiesof Trees, Introduction to Spanning Trees.Unit -4Prepositional Logic: Introduction, Use of propositions to represent simple sentences, LogicalConnectives, Well-formed Formulas, Tautologies, Equivalences, Inference Theory.Books:1. Elements of Discrete Mathematics - C.L. Liu, D.P. Mahopatra, TMH2. Discrete Mathematics and Its Applications - Kenneth Rosen, McGraw HillCore - 9Software EngineeringUnit -1The Evolving Role of Software, Software Characteristics, Software Engineering Approach, SoftwareProcess Framework, Framework and Umbrella Activities, Process Models, Capability MaturityModel Integration (CMMI).Unit -2Software Requirement Analysis: Requirement Analysis and Modelling Techniques, Flow OrientedComponents of SRS, Need for SRS, Software Project Management: Project Estimation, ProjectScheduling, Software Risks: Risk Management, Risk Identification, Risk Projection and RiskRefinement, RMMM.Unit -3Software Quality: Software Quality Assurance, Metrics for Process and Projects, Software Design:Design Concepts, Software Architecture, Data Design at the Architectural Level and ComponentLevel, Mapping of Data Flow into Software Architecture.Unit -4Software Testing: Strategic Approach to Software Testing, Test case generation, Validation Testing,System Testing, Black-Box Testing, White-Box Testing, Path Testing.Books:1. Fundamentals of Software Engineering - Rajiv Mall2. Software Engineering: A Practitioner’s Approach - R.S. PressmanPage 9 of 26

Core - 10Database Management SystemsUnit -1Concept of Database and DBMS, Characteristics of database approach, Role of DBMS, Data models(Relational, Hierarchical, network and Object-oriented), Layered architecture of DBMS, Dataindependence.Unit -2Entity Relationship(ER) Modeling, Entity types, relationships, constraints. Relational data model,relational constraints, Mapping ER models to relational database, Relational algebra, SQLqueries.Unit -3Database design, Data dependencies (functional transitive, and multi-valued), Normalforms(INF,2NF, and 3NF), Database transactions: Transaction Processing, ACID properties, concurrencycontrol.Unit -4File Structure and Indexing, overview of File organizations (Sequential, Indexed, and Direct Accessfiles), Indexing (Primary index, secondary index, clustering index), Concept of B and B trees.Books:1. Database Systems Concepts - A. Silberschatz, H. F. Korth, S. Sudarshan (McGraw Hill)2. Fundamentals of Database Systems - Elmsari and Navathe (Addision Wesley)3. Database Management Systems – Rajiv Chopra, S ChandDatabase LabCreate tables as indicated against each question and write SQL statements to answer the givenqueries:1. Student (roll no, name, department, marks), Attendance (roll no, department, attendance)a) Create the table with above schemab) Display the details of the studentsc) Display the details of the student with attendance less than 20d) Find the average mark of student having attendance less than 20e) Find the average mark.f) Display the details of the students whose name starts with ‘s’g) Display details of the student with mark greater than 70h) Display the details of the students whose name starts with ‘s’ or ‘c’i) Find subject wise average markj) Display details of the students whose age is between 20 and 232. Course (roll no, subject, mark) Attendance (roll no, name, attendance)a) Create the tabl

Syllabus for B. Sc. Computer Science (Hons) under CBCS w.e.f. the Academic Year 2016-2017 Semester - I Credits Core-1 Programming Fundamentals using C 4 C Programming Lab 2 Core-2 Computer System Architecture 6 GE-1(Generic Elective) AECC(Ability Enhancement Compulsory Course) Environmental Studies 2 Semester - II

Related Documents:

Bruksanvisning för bilstereo . Bruksanvisning for bilstereo . Instrukcja obsługi samochodowego odtwarzacza stereo . Operating Instructions for Car Stereo . 610-104 . SV . Bruksanvisning i original

10 tips och tricks för att lyckas med ert sap-projekt 20 SAPSANYTT 2/2015 De flesta projektledare känner säkert till Cobb’s paradox. Martin Cobb verkade som CIO för sekretariatet för Treasury Board of Canada 1995 då han ställde frågan

service i Norge och Finland drivs inom ramen för ett enskilt företag (NRK. 1 och Yleisradio), fin ns det i Sverige tre: Ett för tv (Sveriges Television , SVT ), ett för radio (Sveriges Radio , SR ) och ett för utbildnings program (Sveriges Utbildningsradio, UR, vilket till följd av sin begränsade storlek inte återfinns bland de 25 största

Hotell För hotell anges de tre klasserna A/B, C och D. Det betyder att den "normala" standarden C är acceptabel men att motiven för en högre standard är starka. Ljudklass C motsvarar de tidigare normkraven för hotell, ljudklass A/B motsvarar kraven för moderna hotell med hög standard och ljudklass D kan användas vid

LÄS NOGGRANT FÖLJANDE VILLKOR FÖR APPLE DEVELOPER PROGRAM LICENCE . Apple Developer Program License Agreement Syfte Du vill använda Apple-mjukvara (enligt definitionen nedan) för att utveckla en eller flera Applikationer (enligt definitionen nedan) för Apple-märkta produkter. . Applikationer som utvecklas för iOS-produkter, Apple .

och krav. Maskinerna skriver ut upp till fyra tum breda etiketter med direkt termoteknik och termotransferteknik och är lämpliga för en lång rad användningsområden på vertikala marknader. TD-seriens professionella etikettskrivare för . skrivbordet. Brothers nya avancerade 4-tums etikettskrivare för skrivbordet är effektiva och enkla att

Den kanadensiska språkvetaren Jim Cummins har visat i sin forskning från år 1979 att det kan ta 1 till 3 år för att lära sig ett vardagsspråk och mellan 5 till 7 år för att behärska ett akademiskt språk.4 Han införde två begrepp för att beskriva elevernas språkliga kompetens: BI

**Godkänd av MAN för upp till 120 000 km och Mercedes Benz, Volvo och Renault för upp till 100 000 km i enlighet med deras specifikationer. Faktiskt oljebyte beror på motortyp, körförhållanden, servicehistorik, OBD och bränslekvalitet. Se alltid tillverkarens instruktionsbok. Art.Nr. 159CAC Art.Nr. 159CAA Art.Nr. 159CAB Art.Nr. 217B1B