Bachelor of Computer Science (Information Technology)...

of 22

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY)

B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II

Effective from June - 2007

Bachelor of Computer Science (Information Technology) B.Sc.(I.T.)

( 3 years – Six Semester Full Time Course )

Ordinance, Regulations and Examination Scheme : O.B.Sc.(IT). – 1 : Candidate for admission to the B.Sc.(IT) must have passed standard 12th or equivalent examination with Mathematics or Business Mathematics or Statistics or Computer or Physics from Gujarat secondary and higher secondary board. O.B.Sc.(IT). – 2 : The duration of the course will be of three full time academic years. The examination for the B.Sc.(IT) course will be divided into six semesters. No candidate will be allowed to join any other course or service simultaneously. O.B.Sc.(IT). – 3 : Candidate who have passed an equivalent examination from any other board or examining body and is seeking admission to the B.Sc.(IT). course will be required to provide necessary eligibility certificate. O B.Sc.(IT ) – 4 : No candidate will be admitted to any semester examination for B.Sc.(IT). unless it is certified by the Principal that he has attended the course of study to the satisfaction of the principal of the college. O. B.Sc.(IT) – 5 : Candidate desirous of appearing at any semester examination of the B.Sc.(IT). course must forward their application in the prescribed from to the University through the principal of the college on or before the date prescribed for the purpose under the relevant ordinances. O B.Sc.(IT). – 6 : No candidate will be permitted to reappear at any semester examination, which he has already passed. The marks of successfully completed paper will be carry forwarded for the award of class. O. B.Sc.(IT). – 7 : There shall be an examination at the end of each semesters to be known as first semester examination, second semester examination respectively. At which a student shall appear in that portion of papers practical and viva – voice if any, for which he has kept the semester in accordance with the regulations in this behalf. A candidate whose term is not granted for what so ever reason shall be required to keep attendance for that semester or term when the relevant papers are actually taken at the college. O. B.Sc.(IT). – 8 : Medium of instruction is English only.

of 22




R. B.Sc.(IT). – 1 :

Resolution to keep term of all computer courses covering U.G. and P.G. Degree course.

Any candidate can go up to take admission in pre to pen-ultimate semester irrespective of failure in any number of subjects.

A Candidate can take admission to pen-ultimate semester if he/she is not failing to more then two subjects.

A candidate can take admission to ultimate {final} semester if he/she is not failing in more then two subjects.

That is a candidate will be permitted to continue h is/her study upto the 4 th (pre-to-pen ultimate) semester examination without passing his/her previous semester examination.

A candidate can take admission to fifth (pen-ultimate) semester if he/she is failing in NOT more then two subjects of forgoing semesters.

A candidate can take admission to Sixth (Ultimate-F inal) Semester if he/she is not failing in more then two subjects of 5 th Semester. Provided he/she should have cleared all 1 to 4 semester.

R. B.Sc.(IT). –2

Standard Of Passing The standard of passing the B.Sc.(IT) degree examination will be as under : ( 1 ) To pass any semester examination of the B.Sc.(IT) degree, a candidate must obtain

at least 40% marks in the university examination separately in each course of theory and practical.

( 2 ) Those of the successful candidates who obtain 40% or more marks in the aggregate of all the semester taken together will be placed in the pass class. Who obtain 50% or more marks in the aggregate of all the semester taken together will be placed in the second class. Who obtain 60% or more marks in the aggregate of all the semester taken together will be placed in the first class . The successful candidates who obtain 70% or more marks in the aggregate of all the semester taken together will be declared to have passed the examination in the first class with distinction.

R. B.Sc.(IT). –3 The following are the syllabus in the various subjects to be studied for the B.Sc.(I.T.)

of 22




BSC INFORMATION TECHNOLOGY SEMESTER – I

Sr. No. Subject No. of Theory

Lect. Per Week No. of Practical/Week

1 CS-1 Communication Skills

4 + 1

2 CS-2 Problem Solving Methodologies & Programming in C

4 + 1 6

3 CS-3 Foundation of Information Technology

4 +1 6

4 CS-4 Foundation of Mathematics & Statistics

4 + 1

5 CS-5 Practical on CS-2 6 CS-6 Practical on CS-3

of 22




CS – 1 Communicati on Skills

No.

Topics Details Marks Min. Lct.

1 Grammar Tenses 05 05 2 Communication

Skills Introduction Communication as a two way process Purpose or objectives of Communication Verbal and non verbal communication Barriers of communication Essential of communication

20 15

3 Practical letter Writing

Official letters Business letters Applications or Resume

15 10

4 Report Writing

Business Report Press report

20 10

5 Essay Writing Current Topics 10 4 6 Testing

Vocabulary Confusing Words One word substitution Antonyms Synonyms

10 5

7 Translation English into Gujarati or Hindi Gujarati or Hindi into English

10 6

8 Comprehension 10 5 100 60

Reference Books:

1. Follow Me by Barry Tomalin, BBC English By Redio and TV, London 2. How to Listen by Marion Geddes 3. Ebook – Improve you writing skills 4. English Grammar & Compostiotn by Rajendra Pal & Premalata Suri

of 22




CS – 2 Problem Solving Methodologies & Programming in C No. Topics Details Marks Min.

Lct. 1 Pre

Programming Techniques

Importance of preprogramming techniques Pre programming tools Algorithm Flow charts Dry Run (preparation of sample data set for testing of logic) Writing algorithms and development of flowcharts with dry run for the given list of problems

20 12

2 Getting started with C

C program structure C Character sets Constants, Variables and Keywords in C Various Data Types Type Casting Various Operators Hierarchy of Operations

80

6

3 Various Controls Structures

Decision if, if-else,Nested if-else, if-elseif Conditional (Ternary) operator Switch Case Loops for, while, do while, Nesting of loops Use of break an continue statements, goto with lable

14

4 Header files & Library Functions

Importance of header files Introduction to some popular header files and its library functions: <stdio.h>: printf(),scanf(),fflush(),gets(),puts() <conio.h>: getch(),getche(),getchar(),clrscr(),gotoxy(), textcolor(),textbackground(), cprintf(), <math.h>: abs(),exp(),sqrt(),log(),ceil(),floor(),pow(), fmod(),fabs() <string.h>: strlen(),strcpy(),strcmp(),strcat(),strlwr(), strupr(),strrev() <ctype.h>: isalpha(),isdigit(),isalnum(),isspace(),isupper(), islower(),isprint(),toupper(),tolower()

8

of 22




5 User defined functions

Different type of UDF (call by value only) Functions with no arguments, no return value Functions with no arguments, with return value Functions with arguments, no return value Functions with arguments, with return value Creation of your library Storage classes & scope of variables

5

6 Arrays Concept of Single & Two dimensional arrays Initializations & working with array Passing array elements to function Sorting of numeric & string array String operations

8

7 Structures How to define a structure Accessing structure elements Memory allocation Array of structure Array within structure Union

5

8 Misc. Typedef Symbolic Constants C Preprocessor #define #include

2

100 60 Reference Books: 1. Programming in ANSI C E.Balaguruswami 2. Let Us C Yashwant Kanetkar 3. Working with C Yashwant Kanetkar 4. Programming in C Schaum Series Publication

of 22




CS – 3 Foundation of Information Technology No. Topics Details Marks Min.

Lct. 1 Concepts in

information & Processing

An overview of information technology applications, Difference between Data & Information, Information system, Value of Information, Quality of Information Software Concepts: Types of Software, Programming Languages, Software (Its Nature & Qualities), Programming Languages.

10 6

2 Introduction to computers

Definition of computer Block Diagram of computer Characteristics of computer Generation of computer Digital computer, mini, micro, mainframe, super Hybrid computer

10 6

3 Computer Peripherals

Input Devices: Keyboard, Mouse, Joystick, Track ball, Touch Screen, OCR, OMR, MICR & OBR, Light pen,Scanner, Output Devices (All): Visual Display Unit (VDU), LCD, Plasma, Printers: Impact, Non Impact, Plotter, CRT Storage Devices & Type of Memory: RAM,ROM, PROM,EPROM,EEPROM, cache memory, magnetic tape,Magnetic disk, CDs, DVD, ZIP Drive, Per Drive Port Introduction: USB, Serial, Parallel and PS2

20 15

4 Overview Computer Language & OS

What is machine level language, What is assembly level language, What is high level language. (Note: there is no any comparison in between these language) (Just) Definition of Assembler, compiler & interpreter Operating Systems: History & Evolution, A Brief History of Linux, A Brief History of MS-DOS, A Brief History of Windows System.

10 7

5 Number systems Binary, Arithmetic & Code

Conversions: Decimal to Binary, Octal, Hexadecimal,Binary to Decimal, Octal, Hexadecimal,Octal to Decimal, Binary, Hexadecimal,Hexadecimal to Decimal, Binary, Octal,Complement: 1’s comp., 2’s comp. Addition of two binary numbers, Subtraction of two binary numbers using 1’s & 2’s comp.

20 12

of 22




What are ASCII, BCD & EBCDIC Where & Why these codes are used?

6 Internet technology & World wide web

Introduction to Web, Internet requirement, Internet – A global Network, Host & Terminals, TCP/IP, Common protocols used in Internet, World wide web, Web browsers, Internet addresses, Domain names, Basic concepts of HTML, Web Search engines Electronic Mail

30 14

100 60 Reference Books: Computer Fundamentals P.K. Sinha Fundamentals Of Computers, 3rd Edition V. Rajaraman Fundamentals of IT for BCA S. Jaiswal Foundation of Information Technology D.S. Yadav Fundamentals of Information Technology Deepak Bharihoke

of 22




CS 4 – Foundation of Mathematics and Statistics No. Topics Details Marks Min.

Lct. 1 Matrices Matrix, Square Matrix, Column Matrix, Row

Matrix, Diagonal Matrix, Unit Matrix, Upper triangular and lower triangular matrix, symmetric matrix, skew-symmetric matrix, trace of matrix, transpose of matrix, addition, subtraction and multiplication of two matrices ad joint of a square matrix, inverse of matrix and determinants

8 5

2 Linear system of equation

Solution of linear equations using direct methods (gauss-elimination, Gauss-jordan with proof)

7 5

3 Inter-polation Definition, Finite-defference forward- difference table, backward-difference table, Newton forward-differnece formula (with proof), Newton-backward difference formula with proof, language’s interpolation(example only)

10 7

4 Solution of algebraic and transcendental equation

Definition, Bi-section method, False-position method, Newton-raphson method. (with proof)

10 5

5 Integration Definition, Trapezoidal rule (with proof), Simpson’s 1/3 rule (with proof)

5 03

6 Numerical Solution of ordinary differential equations

Eular’s method, Modified eular’s method, RK 2nd and RK 4th order method (only Example)

10 5

Part – II Statistics 7 Chart and

Curve Simple bar diagram, pie diagram, graphs of frequency distribution, Histogram for Equal class interval, Frequency, polygon, frequency curve, cumulative frequency curve, Ogive curve less than and more than

5 4

8 Linear programming problem

Linear programming problem, meaning, Constrains, mathematical model of LPP, uses of LPP, graphic method, Simplex method (two variable)

10 6

9 Transportation problem

Transportation: meaning, method of finding, initial solution, (north west corner method, least cost method, Vogel’s approximation method)

10 5

of 22




10 Correlation and regression

Correlation: definition, Scattered diagram method, karl Pearson’s coefficient of correlation, properties of correlation, correlation ceoefficient for bi variate frequency distrubution, rank correlation, examples based on all above methods. Regression: Definition, lines of regression, regression coefficient and it’s properties, angle between tow lines of regression, example based of regression.

15 10

11 Curve fitting Linear curve (Y = a + bx) Second degree parabola (Y = a + bx + cx2) Exponential Curve Y= aebx

10

5

100 60 Reference Books: Numerical Analysis VN Vedmurthy Statistical Methods S P Gupta Operation Research J K Sharma Numerical Analysis Salariya Mathematical Statistic SP Gupta & VK Kapoor

of 22




CS – 5 Practical & Viva Based on CS – 2 No. Topics Marks 1 CS – 2 (C – Programs) 50 50

Each session is of 3 hours for the purpose of practical examination

CS – 6 Practical & Viva Based on CS – 3 No. Topics Marks 1 CS – 3 (Computer Fundaments, MS Office, Internet

Technology) 50

50 Each session is of 3 hours for the purpose of practical examination

of 22




BSC INFORMATION TECHNOLOGY SEMESTER - II

Sr. No. Subject No.of Theory

Lect. Per Week

No. of Practical per

Week 1 CS – 7 Advance C & Data Structure 4 + 1 6 2 CS – 8 DBMS Using FoxPro 4 + 1 6 3 CS – 9 Computer Organization &

Architecture 4 +1

4 CS – 10 SAD & SE 4 + 1 5 CS – 11 Practical on CS - 7

6 CS – 12 Practical on CS - 8

of 22




CS – 7 Advance C & Data Structure No. Topics Details Marks Min.

Lct. 1 Pointer Definition and Concept

Advantage of using pointer Pointer arithmetic Array & Pointer Static & Dynamic Array Pointer to Structure

30

8

2 UDF Void data type Call by value & call by reference function Recursion Array as a function argument Structures as a function argument Pointer as a function argument

5

3 Sorting & Searching techniques

Selection sort, Insertion sort, Bubble sort, Quick sort, Merge sort, Linear sort, Binary sort

5

4 Data file handling

Concept of data file and file structure Text file and binary file Opening and closing of data file (fopen(),fclose()) Write data/ Record to data file (fprint(),fwirte(),fputs()) Reading from data file (fscanf(),fread(),fgets()) File handling functions(feof(),ferror(),fseek(), ftell(),rewind()) Command line arguments

8

5 Data Structure

Primitive and non-primitive Storage structure for array, structure and array of structure

70

4

6 Stack Definition and concept Operation on stack Application of stack in recursion

5

7 Queue Definition and concept Operation on queue Circular queue

5

of 22




8 Linked list Definition and concept Operation on linked list Insertion at different position Deletion from different position Traversal Types of linked list: singly linked list, circular linked list, Header linked list, Doubly linked list Sorting and Searching in linked list

15

9 Tree Definition and concept, Operation on binary tree (create, traverse) (pre, post, in)

5

100 60 Reference Books: Data Structure through C/C++ Tennaunbuam Data Structure R.B. Patel Let us C Kanitkar Pointer in C Kanitkar Data and File Structure Trembley & Sorrenson

of 22




CS – 8 DBMS using FoxPro No. Topics Details Marks Min.

Lct. 1 DBMS

Concepts Characteristics and Use of DBMS Data Models (Hierarchical, Network, Relational) Entity and Relationship, E-R Diagram Popular DBMS software

10 5

2 FoxPro Basics Types of files: Command file (creation, modification, execution), database file, report file, Label files, Index file, Data types: Numeric, Character, Logical, Date, Memo, Float, General Operators and Expressions: Arithmetic, Relational, Logical

90

5

Creating, Editing, Updating, Database file Commands

Crate, Use(index), Append(Blank, Form) Insert (Before, Blank) Go(Record, Top, Bottom), Skip List(Off, Fields, Next, For, While, To Printer, To File) Display (Fields, For, While, Off, To, Printer) Edit(Fields, For, While, When) Browse(Fields, Freeze, For, When, Noedit, Nodelete, Nomodify) Delete(All, Next, Record, For, While) Recall (All, Next, Record, For, While) Pack, Zap Update, Replace Locate(For, While) Continue (For, While) Sum (For, while), Average (For, While), Total Close(All, Database, Indexes) Scatter, Gather

12

4 Sorting Indexing & Multiple File Handling Commands

Sort Index, Reindex Find, Seek Select

7

of 22




5 Library Functions

Numeric Functions: abs(),between(),ceiling(),floor(),int(),min(), max(),mod(), round(), sqrt(), rand(), sign() Date & Time: date(),time(), day(), dow(), month(), year() dtoc(), ctod(), cdow(), cmonth(), gomonth() File & Record : recno(), recount(), bof(), eof(), found(), deleted() Character, String & Other: chr(),asc(),val(), left(), right(),str(), substr(), len(), lower(), upper(), trim(), rtirm(), alltirm(), stuff(), isupper(), islower(), isalpha(), isdigit(), soundex(), set(), parameter() Arrary : assort(), alen(), ains(), asubscript(), aelement(), adel()

6

6 Set commands Alternate, carry, confirm, color to, console, date, default, decimal, device, delimiters, exact, filter, fixed, function, index, order, print, relation, safety, status, talk, message, mark, century, deleted, skip, procedure, heading, clock, field

6

7 Input/Output, Initializing, Assigning and other command

?,??,??? .*. &&. Node, = Accept, Input, Store, Read @say… get(picture, range, valid, default, message, error) @.. to .., @.. box, @….fill, @…prompt with message Wait, Private, Public, Clear, Exit, Loop Dimension, Command (One Dimension, Two Dimenision)

5

8 Conditional & Branching commands

If….else….endif (with nesting) Do case… endcase 5

9 Looping Commands (with nesting)

For….endfor, Do….enddo Scan (for, while) endscan

5

10 Procedure Related Commands

Creation of Procedures Procedures, Parameter, Return, Suspend, Resume, Cancel Execution of Procedures (do (with))

5

of 22




11 Programming Exercise

Programming Exercises that covers all above specified commands and functions Programming Exercises using Database

100 60 Reference Books : FoxPro 2.5 made simple R.K.Taxali Programming in FoxPro 2.6 Gagan Sahoo An int. to Database concepts Bipin Desai Database Management System Concepts C.J. Date

of 22




CS – 9 Computer Organization & Architecture No. Topics Details Marks Min.

Lct. 1 Digital Logic

Circuits Logic Gates : AND,OR,NOT,NAND,NOR,XOR,Exclusive NOR Boolean Algebra: What is Boolean Alg. Explanation about Boolean variable and Boolean Function (analog & digital signals) Describe truth table, Discuss postulates, Discuss theorem related to postulates. Simplified Boolean function using postulates and draw logical diagram of simplified function, simplified Boolean function using karnaugh map method and discuss Don’t care condition Sequential And Combinational Circuits: What are Clock Pulses, What is Combinational circuit and sequential circuit after discussion of adders and flip flops Flip Flops: SR, Clocked SR, D, JK, JK – master & salve, T Universal Gate: why it is called universal gate explain.

20 15

2 Digital Component

Integrated Circuits Decoders (2 X 4, 3 X 8) Encoders (Octal to Binary – 8 X 3) Multiplexer ( 4 X 1) Demultiplexer ( 1 X 4) Register : Block diagram of register, how it works, Parallel register and shift register, how it transfer data, asynchronous 4-bits binary counter

25 12

3 Data Representation

Multiplication and Division of two binary numbers Floating point representation Fixed point representation Error Detection code – (Parity Bit)

10 8

4 Central processing Unit

Introduction of CPU, Major Component of CPU General Register Organization: What is Control Word, Accumulator Register Stack Organization: What is register stack, what is memory stack, what is

25 7

of 22




polish notation & reverse polish notation, Why we use polish notation? Explain with an example. Arithmetic And Logic Unit: Block Diagram of ALU, Explain how it works. Interrupts: What is interruption, how it useful and work

5 Input – Output organization

Memory Buses: explain with block diagram, how it works, data bus, address bus, control lines. Input Output Buses Concept of input Output interface Input Out Processor (IOP) Direct Memory Access: intro, DMA works, explain DMA controller, How DMA transfer data in computer system

20 15

100 60 Reference Books: Computer System Architecture Morries Mano (PHI) Digital Logic And Computer Design Morries Mano Digital Computer Electronics Malvino And Leach

of 22




CS – 10 SAD & SE No. Topics Details Mark Lect.

1

Introduction What is System, it’s characteristics. Information System, Categories of information system (Transaction Processing, Management Info, Decision Support) What System Analysis and design Responsibilities of system Analyst Different Types of users. What is SDLC & its Stages

15 10

2

Project Selection

Reasons for project proposal Source of project requests Project review and selection Feasibility study

5 5

3

Requirement Analysis

What is Requirement Determination? Activities in requirement determination Fact-Finding techniques (interviews, questionnaire, record view, observations). Tools for documenting procedures and decision (decision tree, decision table). SRS Document

12 8

4 Structured Analysis

Data flow diagrams Data dictionary

8 5

5

Input & Output Design

Objective of input design Various coding techniques Input validation What is output? Type of Output, Type of output presentation. Tabular, Graphics.

7 4

6

Design of files

Basic file terminology Type of file (Master, Transaction, Table, Report) Methods of file organization (Sequential, Direct access, Indexed)

5 4

7

Software design

Top down structure of methods Coupling & Cohesion, Span of control, fan in, fan out. Design & Doc. Tools (Structured chart, HIPO)

8 4

8

Software Testing Quality Assurance & Implementation

Testing methods (Unit testing, Black-box testing, White-box testing, System testing) What is Software Quality? ISO – 9000 (Introduction only) Conversion method

10 5

of 22




9

Introduction to Software Engineering

Different type of software applications Software Myths and Reality Generic View of software Engineering Software process & different process models (sequential, RAD, Incremental, Spiral)

10 5

10

Software Project Management

Project Management (3Ps, People, problem, process) Project Planning Sizing (Size & Function oriented metrics) Estimation (LOC, FP) Make buy Decision Risk Management: Different type of risks (Product size, business customer, staff, process technology) RMMM plan

15 8

11 Software Design

Introduction to OOA & OOD What is Object, Attributes, state, behavior? Benefit of OOD

5 2

Total 100 60 Reference Books: Analysis & Design of Information System James A Senn Fundamentals of Software Engineering Rajibmall Software Engineering A Practitioner’s Approach Pressman

of 22




CS – 11 Practical & Viva Based on CS – 7 Sessions Topics Marks

1 CS – 7 Adv C & Data strucrure 50 50

Each session is of 3 hours for the purpose of practical examination.

CS – 12 Practical & Viva Based on CS – 8 Sessions Topics Marks

1 CS – 8 FoxPro 50 50

Each session is of 3 hours for the purpose of practical examination

Bachelor of Computer Science (Information Technology)...

Documents

Transcript of Bachelor of Computer Science (Information Technology)...