Bachelor of Computer Science

Published on May 2016 | Categories: Documents | Downloads: 45 | Comments: 0 | Views: 530
of 22
Download PDF   Embed   Report

Comments

Content

Page 1 of 22

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.

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 2 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 his/her study upto the 4th (pre-topen 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-Final) Semester if he/she is not failing in more then two subjects of 5th 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. 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.

(2)

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

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 3 of 22

BSC INFORMATION TECHNOLOGY SEMESTER – I

Sr. No.

Subject

No. of Theory Lect. Per Week

No. of Practical/Week

1 2

3

4

5 6

CS-1 Communication Skills CS-2 Problem Solving Methodologies & Programming in C CS-3 Foundation of Information Technology CS-4 Foundation of Mathematics & Statistics CS-5 Practical on CS-2 CS-6 Practical on CS-3

4+1 4+1 6

4 +1

6

4+1

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 4 of 22

No . 1 2

Topics Grammar Communication Skills

CS – 1 Communication Skills Details Tenses Introduction Communication as a two way process Purpose or objectives of Communication Verbal and non verbal communication Barriers of communication Essential of communication Official letters Business letters Applications or Resume Business Report Press report Current Topics Confusing Words One word substitution Antonyms Synonyms English into Gujarati or Hindi Gujarati or Hindi into English

Marks 05 20

Min. Lct. 05 15

3

Practical letter Writing Report Writing Essay Writing Testing Vocabulary

15

10

4 5 6

20 10 10

10 4 5

7 8

Translation Comprehension

10 10 100

6 5 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

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 5 of 22

No. 1

CS – 2 Problem Solving Methodologies & Programming in C Topics Details Marks 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 Getting C program structure started with C C Character sets Constants, Variables and Keywords in C Various Data Types Type Casting Various Operators Hierarchy of Operations Various Decision Controls if, if-else,Nested if-else, if-elseif Structures Conditional (Ternary) operator Switch Case Loops for, while, do while, Nesting of loops Use of break an continue statements, goto with lable Header files Importance of header files & Library Introduction to some popular header files and Functions 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() Pre Programming Techniques

Min. Lct.

20

12

2

6

3

14

4

80

8

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 6 of 22

5

User defined functions

6

Arrays

7

Structures

8

Misc.

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 Concept of Single & Two dimensional arrays Initializations & working with array Passing array elements to function Sorting of numeric & string array String operations How to define a structure Accessing structure elements Memory allocation Array of structure Array within structure Union Typedef Symbolic Constants C Preprocessor #define #include 100

5

8

5

2

60

Reference Books: 1. Programming in ANSI C 2. Let Us C 3. Working with C 4. Programming in C

E.Balaguruswami Yashwant Kanetkar Yashwant Kanetkar Schaum Series Publication

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 7 of 22

No. 1

CS – 3 Foundation of Information Technology Topics Details 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. Definition of computer Block Diagram of computer Characteristics of computer Generation of computer Digital computer, mini, micro, mainframe, super Hybrid computer 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 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 MSDOS, A Brief History of Windows System. 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.

Marks

Min. Lct.

10

6

2

Introduction to computers

10

6

3

Computer Peripherals

20

15

4

Overview Computer Language & OS

10

7

5

Number systems Binary, Arithmetic & Code

20

12

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 8 of 22

6

Internet technology & World wide web

What are ASCII, BCD & EBCDIC Where & Why these codes are used? 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 Reference Books: Computer Fundamentals Fundamentals Of Computers, 3rd Edition Fundamentals of IT for BCA Foundation of Information Technology Fundamentals of Information Technology

60

P.K. Sinha V. Rajaraman S. Jaiswal D.S. Yadav Deepak Bharihoke

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 9 of 22

No. 1

CS 4 – Foundation of Mathematics and Statistics Topics Details 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 Solution of linear equations using direct Linear methods (gauss-elimination, Gauss-jordan system of with proof) equation Inter-polation Definition, Finite-defference forwarddifference table, backward-difference table, Newton forward-differnece formula (with proof), Newton-backward difference formula with proof, language’s interpolation(example only) Solution of Definition, Bi-section method, False-position algebraic and method, Newton-raphson method. (with proof) transcendent al equation Integration Definition, Trapezoidal rule (with proof), Simpson’s 1/3 rule (with proof) Numerical Eular’s method, Modified eular’s method, RK Solution of 2nd and RK 4th order method (only Example) ordinary differential equations Part – II Statistics Chart and Simple bar diagram, pie diagram, graphs of Curve frequency distribution, Histogram for Equal class interval, Frequency, polygon, frequency curve, cumulative frequency curve, Ogive curve less than and more than Linear Linear programming problem, meaning, programming Constrains, problem mathematical model of LPP, uses of LPP, graphic method, Simplex method (two variable) Transportatio Transportation: meaning, method of finding, n problem initial solution, (north west corner method, least cost method, Vogel’s approximation method)

Marks

Min. Lct.

8

5

2

7 10

5 7

3

4

10

5

5 6

5 10

03 5

7

5

4

8

10

6

9

10

5

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 10 of 22

10

Correlation and regression

11

Curve fitting

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. Linear curve (Y = a + bx) Second degree parabola (Y = a + bx + cx2) Exponential Curve Y= aebx

15

10

10

5

100 Reference Books: Numerical Analysis Statistical Methods Operation Research Numerical Analysis Mathematical Statistic

60

VN Vedmurthy S P Gupta J K Sharma Salariya SP Gupta & VK Kapoor

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 11 of 22

No. 1

CS – 5 Practical & Viva Based on CS – 2 Topics CS – 2 (C – Programs)

Marks 50 50

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

No. 1

CS – 6 Practical & Viva Based on CS – 3 Topics CS – 3 (Computer Fundaments, MS Office, Internet Technology)

Marks 50 50

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

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 12 of 22

BSC INFORMATION TECHNOLOGY SEMESTER - II

Sr. No.

Subject

No.of Theory Lect. Per Week

No. of Practical per Week

1 2 3 4 5 6

CS – 7 Advance C & Data Structure CS – 8 DBMS Using FoxPro CS – 9 Computer Organization & Architecture CS – 10 SAD & SE CS – 11 Practical on CS - 7 CS – 12 Practical on CS - 8

4+1 4+1 4 +1 4+1

6 6

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 13 of 22

No. 1

Topics Pointer

CS – 7 Advance C & Data Structure Details Definition and Concept Advantage of using pointer Pointer arithmetic Array & Pointer Static & Dynamic Array Pointer to Structure 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 Selection sort, Insertion sort, Bubble sort, Quick sort, Merge sort, Linear sort, Binary sort 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 Primitive and non-primitive Storage structure for array, structure and array of structure Definition and concept Operation on stack Application of stack in recursion Definition and concept Operation on queue Circular queue

Marks

Min. Lct.

8

2

UDF

5

3

4

Sorting & Searching techniques Data file handling

30

5

8

5

Data Structure Stack

4

6

70

5

7

Queue

5

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 14 of 22

8

Linked list

9

Tree

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 Definition and concept, Operation on binary tree (create, traverse) (pre, post, in) 100

15

5 60

Reference Books: Data Structure through C/C++ Data Structure Let us C Pointer in C Data and File Structure

Tennaunbuam R.B. Patel Kanitkar Kanitkar Trembley & Sorrenson

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 15 of 22

No. 1

Topics DBMS Concepts

CS – 8 DBMS using FoxPro Details Characteristics and Use of DBMS Data Models (Hierarchical, Network, Relational) Entity and Relationship, E-R Diagram Popular DBMS software 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 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 Sort Index, Reindex Find, Seek Select

Marks

Min. Lct.

10

5

2

FoxPro Basics

5

Creating, Editing, Updating, Database file Commands

90 12

4

Sorting Indexing & Multiple File Handling Commands

7

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 16 of 22

5

Library Functions

6

Set commands

7

Input/Output, Initializing, Assigning and other command

8

9

Conditional & Branching commands Looping Commands (with nesting) Procedure Related Commands

Numeric Functions: abs(),between(),ceiling(),floor(),int(),mi n(), 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() 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 ?,??,??? .*. &&. 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) If….else….endif (with nesting) Do case… endcase For….endfor, Do….enddo Scan (for, while) endscan Creation of Procedures Procedures, Parameter, Return, Suspend, Resume, Cancel Execution of Procedures (do (with))

6

6

5

5

5

10

5

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 17 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 Programming in FoxPro 2.6 An int. to Database concepts Database Management System Concepts

R.K.Taxali Gagan Sahoo Bipin Desai C.J. Date

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 18 of 22

No. 1

CS – 9 Computer Organization & Architecture Topics Details Marks Digital Logic Circuits Logic Gates : AND,OR,NOT,NAND,NOR,XOR,Exclusiv e 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. 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 Multiplication and Division of two binary numbers Floating point representation Fixed point representation Error Detection code – (Parity Bit) 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

Min. Lct.

20

15

2

Digital Component

25

12

3

Data Representat ion

10

8

4

Central processing Unit

25

7

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 19 of 22

5

Input – Output organization

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 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 Reference Books: Computer System Architecture Digital Logic And Computer Design Digital Computer Electronics

60

Morries Mano (PHI) Morries Mano Malvino And Leach

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 20 of 22

CS – 10 SAD & SE No. Topics Introduction Details 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 Reasons for project proposal Source of project requests Project review and selection Feasibility study 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 Data flow diagrams Data dictionary Objective of input design Various coding techniques Input validation What is output? Type of Output, Type of output presentation. Tabular, Graphics. Basic file terminology Type of file (Master, Transaction, Table, Report) Methods of file organization (Sequential, Direct access, Indexed) Top down structure of methods Coupling & Cohesion, Span of control, fan in, fan out. Design & Doc. Tools (Structured chart, HIPO) Testing methods (Unit testing, Black-box testing, White-box testing, System testing) What is Software Quality? ISO – 9000 (Introduction only) Conversion method
Mark Lect.

1

15

10

2

Project Selection

5

5

Requiremen t Analysis 3

12

8

4

5

Structured Analysis Input & Output Design

8

5

7

4

Design of files 6

5

4

Software design 7

8

4

8

Software Testing Quality Assurance & Implementat ion

10

5

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 21 of 22

9

Introduction to Software Engineering

Software Project Management

10

11

Software Design

Different type of software applications Software Myths and Reality Generic View of software Engineering Software process & different process models (sequential, RAD, Incremental, Spiral) 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 Introduction to OOA & OOD What is Object, Attributes, state, behavior? Benefit of OOD Total

10

5

15

8

5 100

2 60

Reference Books: Analysis & Design of Information System Fundamentals of Software Engineering Software Engineering A Practitioner’s Approach

James A Senn Rajibmall Pressman

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Page 22 of 22

Sessions 1

CS – 11 Practical & Viva Based on CS – 7 Topics CS – 7 Adv C & Data strucrure

Marks 50 50

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

Sessions 1

CS – 12 Practical & Viva Based on CS – 8 Topics CS – 8 FoxPro

Marks 50 50

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

SAURASHTRA UNIVERISTY BECHELOR OF COMPUTER SCIENCE (INFORMATION TECHNOLOGY) B.Sc.(I.T.) Syllabus of Semsester - I and Semester – II Effective from June - 2007

Sponsor Documents

Or use your account on DocShare.tips

Hide

Forgot your password?

Or register your new account on DocShare.tips

Hide

Lost your password? Please enter your email address. You will receive a link to create a new password.

Back to log-in

Close