Vous êtes sur la page 1sur 34

Course : B.Sc.(I.T.

) Code : 301T

Semester : I Computer Fundamentals

Hours/week : 3 Credit : 3

Objective: To impart basic introduction to computer hardware components, computer numbering, how the CPU works, fundamental about algorithms and flowchart as well as different type of software. Sr. Topic No 1. Fundamentals of Computer System • Introduction. • Characteristics & features of Computers. • Components of Computers. • Organization of Computer. 2. Data Representation • Introduction to Number System o Decimal Number System o Binary Number System o Hexadecimal Number System • Conversion within Numbers Systems • Arithmetic Operation on Binary and Hexadecimal Numbers • Normalized Floating point Number • Representation of Character in Computers • Representation of Integer Numbers • Representation of Fraction Numbers • Hexadecimal Representation of Number 3. Algorithm and Flowcharts • Algorithm o Definition o Characteristics o Advantages and disadvantages o Examples • Flowchart o Definition o Define symbols of flowchart o Advantages and disadvantages o Examples 4. Computer Generation & Classification • Generation of Computers : First to Fifth • Classification of Computers • Distributed & Parallel computers 5. Computer Languages • Types of Programming Languages o Machine Languages o Assembly Languages o High Level Languages
Revised Syllabus of B.Sc.(Information Technology), with Credit Based System. w.e.f.: 2009-10

Ref. No. of Lect. 3 1/1

1/3

12 4

1/3 2/2

4 4

2/1

6 3

3/3 3/ 4

3

2/12

3

3 2/9

1

• 6.

Assembler, Linker, Loader, Interpreter & Compiler.

2/9 2/4 2/4 3

7.

8.

9.

Computer Memory • Memory Cell & Organization • Types of Memory (Primary And Secondary) o RAM o ROM o PROM o EPROM o Secondary Storage Devices ( FD, CD, HD, Pen drive, DVD, Tape Drive, DAT ) I/O Devices • Input Devices : o Touch screen , OMR, OBR , OCR, Light pen • Output Devices : o Scanners, Digitizers, Plotters, LCD o Plasma Display, Printers Processor • Structure of Instruction • Description of Processor • Processor Features • RISC & CISC Operating system Concepts • Why Operating System • Functions of Operating System • Types of Operating System o Batch O.S. o Multiprogramming O.S. o Time Sharing O.S o Personal Computers O.S. o Network O.S.

1/4 1/4

3

6 2/5

6 2/10 2 2/10 4

Core Reference: 1. Fundamentals of Information Technology By Chetan Srivastava, Kalyani Publishers 2. Fundamentals of Computers By V.Rajaraman, PHI Publication , IVth Edition. 3. Fundamentals of Programming By Raj K.Jain, S.Chand Publication Additional Reference: 1. Computer Today By Suresh K. Basandra, Galgotia Publication,Updated Edition 2. Computer Fundamental By B.Ram, BPB Publication.

Revised Syllabus of B.Sc.(Information Technology), with Credit Based System. w.e.f.: 2009-10

2

Course : B.Sc.(I.T.) Code : 302T

Semester : I Digital Electronics.

Hours/week : 3 Credit : 3

Objective:

To impart basic knowledge in digital logic and circuits and to introduce basic concepts of data communications. Student will be able to learn basic concepts of digital logic and the design of basic logic circuits using commonly used combinational and sequential circuits Topic Ref. No. of Lect. 10 1 1 1 2 2 2 1 7 1 2

Sr. No 1

Number Systems and Arithmetic 1/1 Decimal Number System & Binary Number System Decimal to Binary conversion(Double-dabble method only) Binary to Decimal Conversion Binary Arithmetic : Binary addition, subtraction, multiplication & division Hexadecimal number system , Hexadecimal to binary, binary to Hexadecimal, Hexadecimal to decimal conversion Hexadecimal arithmetic: Addition, subtraction, multiplication & division Binary subtraction using 1' complement, 2's complement method Boolean Algebra and Logic Gates Postulates of Boolean Algebra Theorems of Boolean Algebra: Complementation , commutative, AND, OR, Associative,Distributive,Absorption laws , De morgan's theorems Reducing Boolean expressions Logic Gates : AND, OR, NOT, Ex-OR, Ex-NOR NAND as Universal building block Logic diagrams of Boolean expressions Boolean expressions for logic diagrams Minimization Techniques Introduction , Minterms and Maxterms K-Map, K-map for 2 variables K-map for 3 variables K-map for 4 variables Combinational and Arithmetic Logic Circuits Half Adder & Full Adder Binary parallel Adder Half Subtractor, Full Subtractor Adder/Subtractor in 2's complement system BCD to Decimal decoder 2 : 4 demultiplexer 4 line to 1 line multiplexer 1/3

2

1 1 1 1 1/5 5 1 1 1 2 7 1 1 1 1 1 1 1 3

3

4

1/6

Revised Syllabus of B.Sc.(Information Technology), with Credit Based System. w.e.f.: 2009-10

parallel-in paralle-out 1/7 6 1 1 1 2 1 7 1 1 2 1 1 1 6 1/8 7 1/9 3 1 1 1 Core Reference: 1. Digital Electronics and Logic Design – N. Race around condition Master slave FF Counters Introduction : Asynchronous/ ripple counter Modulus Counter . Digital Electronics and Micro-Computers – R. w.(Information Technology).Gaur .G.e. with Credit Based System. Dhanpat Rai Publication Additional Reference: 1.: 2009-10 4 .5 Flip Flops Introduction : RS FF Clocked RS FF.f. Buffer register Serial.K.in serial -out Serial-in parallel-out Parallel-in serial-out. Technova Publication Revised Syllabus of B.Palan. MOD-12 counter Synchronous counter : Synchronous serial & synch parallel counter BCD counter Ring counter Johnson counter Shift Registers Introduction. preset and clear JK FF .Sc. T FF . D FF Triggering.

1/1 No. Topic Microprocessor.T.f. w. input.(Information Technology). 5 2 2 1 2/3 3 1 1 1 6 1 2 1 2 5 1 1 2 1 2/6 5 1 1 2 1 9 3 2 3 1 6 2 2 2 2 3 2/4 4 1/5 5 6 2/6 7 2/6 Revised Syllabus of B.Sc.(I. with Credit Based System. No 1.Course : B. Microcomputers and Assembly language • Microprocessors • Microprocessor Instruction set and computer languages • From large Computers to Single chip microcontrollers Building Concept of Microprocessor • Introduction . output devices • Central processing unit 8085 Microprocessor • Features of intel 8085 microprocessor • Pin diagram and pin functions of 8085 • 8085 CPU architecture • Functions internal blocks Introduction to 8085 Assembly Language Programming • The 8085 programming model • Instruction Classification • Instruction and Data formats • How to write assembly and execute simple programs 8085 Instruction Set-I • Addressing Modes • Classification of Instruction set • Data Transfer group of Instructions • Program examples for data transfer group 8085 Instruction Set-II • Arithmetic instructions group • Program examples • Logical instruction group • Program examples 8085 Instruction Set-III • Conditional and unconditional Jump • Conditional and unconditional CALL • Conditional and unconditional RET Ref.: 2009-10 5 .Sc. Sr. of Lect.e. Study of human body • Memory.) Code : 303AT Semester : I 8085:Microprocessor Hours/week : 3 Credit : 3 Objective: To introduce 8085 assembly language and thereby familiarize the student with architecture of microprocessors.

(Information Technology).e.Sc. w. with Credit Based System. 8. programming and Applications with 8085– By R. P.8 Concept of Looping • Flowchart • Programs using loop : Examples • Stack and Machine control group 2/6 6 1 3 2 Core Reference: 1.borole Revised Syllabus of B.S.f.Vibhute.it Microprocessors – By V.B. Microprocessors : Architecture.: 2009-10 6 .J. 2.Gaonkar.

nested if. char. • Operators: Arithmetic. History of C language. Control and Iterative Statements : • Simple if. 2/2. double. float. Declaration and initialization Accessing array elements. 2/4. • C as a Structured Language.Course : B.Sc. 1/3. of Lect. w. C Token. • Type modifiers: long. 2/8. Introduction to string Ref. Logical. 1/6 3 4. short. 1/1 3 5. Declaration & Initialization. 1/4 12 6. 2/7. 3 9 Revised Syllabus of B.) Code : 304AT Semester : I Programming in C Hours/week : 3 Credit : 3 Objective: To expose students to algorithmic thinking and problem solving and impart moderate skills in programming using C Language in a industrystandard. Relational. Sr. execute simple C programs using conditional statements. Compilation & Execution of C program I/O: Introduction. 1/1. else if ladder • Switch-case statement • The conditional expression (? : operator) • while and do-while loop. 2/3.(Information Technology).Sc.: 2009-10 7 . Topic Introduction • An Overview of C .e.(I. character constant. Identifier & Keywords. Basic Elements & Operators • Character set. 1/1. 1/1 No. 2. Memory representation of array. Features of C. goto statement Arrays: • Introduction. 1/8. Integer constant. loops and arrays.T. • Precedence & Associatively of Operators Data Types • Data Types: int. Escape sequence characters. Variables • Constant and its types. • Library functions: General used & Mathematical. signed and unsigned C Program & I/O statements • Structure of C Program. character array. 2/1. with Credit Based System.f. 2/5. Unary operators: Increment & decrement Assignment and Conditional operator. No 1.3. floating point constant. Create. • One dimension and multidimensional arrays. 3 6 3. if-else. 2/2. and for loop • break & continue statement. /6. Formatted Input/Output function: scanf & printf. string constants. Introduce students to learn basic features.

3 6 Core Reference: 1.P. actual parameters and formal parameters. Call by value. types of functions.7. Returning function results. with Credit Based System. Function prototype. Defining functions. Let us C : Y. Kanetkar [bpb publication] [Shaums’ Series] 2.e.f. Spirit of “C” : Moolish Kooper. 3. 1/5.Sc. Calling function.(Information Technology). Functions • Introduction. Programming in C : E. w. 2/9. Balaburuswamy [Tata macgraw hill] Programming in C : Goterfried Additional References: 1.: 2009-10 8 . Recursion. Arguments. Revised Syllabus of B.

which will make the transition from college to workplace smoother and help them to excel in their jobs. No. Himalaya Pub. Concept of Communication • Attributes of Communication • Process of Communication • Feedback 2.Sc.Rai.T. 2. House. Listening Comprehension Listening and typing – Listening and sequencing of sentences – Filling in the blanks – Listening and answering the questions 2. Group Discussions and other recruitment exercises. Oral . with Credit Based System. tenses. Everest Pub.Telephone conversation – Role play activities (Students take on roles and engage in conversation) Core Books 1.Cloze Exercises – Vocabulary building – Reading and answering questions.Sc.e.(Information Technology). vocabulary building. Meera Banerji. Objective of Communication • Upward Communication • Downward Communication • Horizontal Communication 3 Method of Communication • Verbal . McMillan Revised Syllabus of B. No Topic 1.M.Anjali Ghanekar. By urmila Rai & S. summarization. Capitals. Sr. Communication Skill for Effective Management By Dr. 1/1 3 ½ 3 1/3 1/11 3 12 1/12 9 1/29 1/30 (4) (5) (6) English Language Lab (15 Periods) 1. Speaking: Phonetics: Intonation – Ear Training – Correct Pronunciation – Sound recognition exercises -Common Errors in English Conversations: Face to Face Conversation . & to enhance students’ performance at Placement Interviews.(I. Business Communication . 3. 3.) 2T+1P Code : 305ATP Semester : I Hours/week : Credit : 3 Communication Skill Objective: To equip students of computer science with effective speaking and listening skills in English To help them develop their soft skills and people skills. Developing Communication Skill By Krishna Mohan. • CS of good communication • Language of business writing 5 Oral Communication • Speeches and Presentation • Dialogues Ref. Written 4 Written Communication • Punctuation marks. w.f. constructing paragraphs. Reading Comprehension and Vocabulary Filling in the blanks . reduction of sentence length.Course : B.: 2009-10 9 . of Lect. Abbreviations • Grammer: Parts of Speech.

Distributive Laws. Quaternary Relation. Proper Subset. 2 • Pigeonhole Principal without proof. Topic Ref. Disjoint sets.(Information Technology). No. Sublattices . Sr.2/1 13 1 • Basic Definitions: Set.) Code : 306AT Semester : I Mathematical Foundation Hours/week : 3 Credit : 3 Objective: Main objective of this course is to introduce mathematical concepts and techniques that have applications in computer science and Information Technologies. Tata McGraw-Hill Additional Reference: Revised Syllabus of B. Principal of Inclusion and Exclusion 2. Events.Course : B. Core Reference: [1] “Discrete Mathematical Structures” by Bernard Kolman.T. Equality of two sets. Antisymmetric Relation. Counting Methods 3 • Combination: Theorems and Examples. Empty set. Properties of Universal set.2/3 14 3 • Permutation: The Multiplication Principal of Counting. Boolean Algebra 2/12 9 • Lattice: Introduction. Permutation and Combination 1/3. Symmetric Relation. Finite set. Associative Laws. Cartesian Product. Universal set.(I. Intersection of Sets. Symmetric Difference. 4. Set Theory 1/1. Venn diagram. Examples. Relation and Function 2/4 9 3 • Introduction: Binary Relation. Infinite set.e. of No Lect. Power set. Sharon Cutler Ross. Difference of two sets. w. Idempotent Laws. Equally Likely Outcomes.Sc. Properties of Compliment. Subset. 1 • Rules of Set Theory.: 2009-10 10 . Distributive and Complimented Lattices • Principle of Duality. Robert C. Ternary Relation. 2 • Combinations of Sets: Union of sets. Transitive Closure. 3. Liu. 6 • Properties of Binary Relations: Reflexive Relation. Properties of Empty set. Tabular Form.Sc. Pearson Education Asia. [2] “Elements of Discrete Mathematics” by C.L. explanation of each using Venn-diagram and simple examples. Transitive Relation. Properties of Lattices. Complement of a set. Busby. Singleton Set.f. 9 • Algebraic Properties of Set Operations: Statement and proof of Commutative Laws. 6 • Probability: Sample Spaces. Graphical Form. with Credit Based System. Assigning Probabilities to Events. 1.

e. Bembalkar.(Information Technology). Revised Syllabus of B.Sc.: 2009-10 11 .f. w. with Credit Based System.[3] “Discrete Mathematics” by Dr.

Nested lists. Formatting Paragraphs: Paragraph attributes. Charts: Chart Wizard. Editing a graphic. Delete a style. Apply a style from the style dialog box. Buttons: forward. Modify or rename a style. Print preview and printing. and columns. Adding worksheets. Chart formatting toolbar. Editing a graphics. Anatomy of a URL. Columns. Format Cells dialog box. Revised Syllabus of B.T. • Web Browser: Basic Browsing. • Word Processing Tool: Menus. and more. Print. Working With Text :Typing and inserting text. Organize various types of files and manage the desk top in general. • Spreadsheet Basics: Screen elements. Selecting cells. Adding and renaming worksheets. Freeze panes. Spelling and Grammar: AutoCorrect. Managing Directories. and page numbers. Resizing. Delete.(Information Technology). Modifying A Worksheet.(I. Moving. Print Preview.opening.f. saving.Sc. Save. Copy. Starting. Formatting lists Tables :Insert Table button. Moving and resizing a table. Autofilling functions. Deleting text. familiarization with file icons. Specifying a Home Page. Inserting rows and columns. Browsing: Using Web URLs.) Code : 301P Semester : I Office Lab Hours/week : 6 Credit : 3 Objective: To impart the student hands on practice so that students should be able to: Create. Headers. Alternating text and numbers with Autofill. Linking worksheets. Deleting. Autofill. Page size and orientation. Keyboard Shortcuts. Formulas and Functions: Formulas.. Create a simple style from the style dialog box.Course : B. The standard toolbar . Close a document . AutoShapes. Adding clip art. Formatting toolbar. closing. Create a new styles from a model. Format Painter. w. Saving documents. The clipboard. Working on multiple documents. Table properties Graphics :Adding clip art. Graphics. Shutdown. Drop caps. Shortcut menus. Page Properties and Printing: Page breaks. Exploring Directories. Undo. Creating and opening documents. Page numbers. Launching Applications. backward. and mixed referencing. Formatting Cells: Formatting toolbar. home.e. Moving through cells. AutoShapes. Resizing a chart. Page Formatting: Page margins. Add an image from a file. footers. Basic functions. Lists : Bulleted and numbered lists. adding to favorites. Spelling and grammar check. Searching for files. Headers and footers. save. absolute. use a standard word and spread-sheet processing package exploiting popular features. Membership Websites: Signing up for email service. • GUI Operating System : Mouse Practice. and pasting text. Customizing toolbars. Margins. Styles : Apply a style. Using Accessories. with Credit Based System. Autosum. Dates and times. Moving a chart. Login. closing of software windows. Thesaurus. Synonyms. Renaming files. Moving. Page orientation. printing. Selecting text. Add an image from a file. Minimizing. Draw a table.: 2009-10 12 . Toolbars. Complex sorts. Moving and copying cells.Sc. Saving an Image from the Web. stop. Resizing rows and columns. Sorting and Filling: Basic ascending and descending sorts. rows. copying. save as. Tables and Borders toolbar. Searching: Academic Search on the web. Renaming documents. Relative. Function Wizard.

Slide numbers. Slide master.• Presentation Tool: AutoContent Wizard. Date and time Saving and Printing. Create a presentation from a template. Slide transitions. Slide animation. Reordering slides. w. Applying a design template. Presentation Screen: Screen layout. Delete a text box. Create a custom slide show. Bulleted lists.f. Open an existing presentation. Adding notes. Video and Audio Working with Text: Adding text. Views. WordArt Slide Effects: Action buttons.(Information Technology). Changing slide layouts. AutoLayout. Backgrounds.: 2009-10 13 . Adding an image from a file. with Credit Based System. Header and footer. Editing a graphic. Change case Spelling check Color & Background: Color schemes. Replace fonts. Hide slides. Editing options. Formatting text. Numbered lists. AutoShapes. Page setup. Note: Revised Syllabus of B. Slide show options. Print • Integrating Programs Word.e. Animation preview. spreadsheet and Presentation. Master Slides. Adding clip art. Edit a custom slide show Adding Content: Resizing a text box.Sc. Working with Slides: Insert a new slide. Save as a web page. The above practical is to be conducted using the either MicrosoftOffice or OpenOffice. Line spacing. Graphics. Create a blank presentation. Text box properties.

Study of 4-bit ripple counter 11. Study of BCD to 7-segment decoder 8. capacitors. serial-out.Sc. 1.(Information Technology). w. CROs and Signal Generators – measurement of AC & DC voltages. Study of Implementation of a 3:8 decoder. Study of Logic Gates: Study of truth table of basic gates.T. Study of Generating a Boolean expression with a multiplexer 9.Course : B.Sc.) Code : 202P Semester : I Digital Electronics Lab Hours/week : 4 Credit : 2 Objective: To provide hands-on practice of the basic knowledge in digital logic and circuits and to provide hands-on practice in some commonly used combinational and sequential circuits Instruction: The Laboratory work will have to be performed during the semester consisting of any of the 8 experiments from the given list below: List of Experiments: Study and Testing of measuring instruments: Digital and Analog multimeters. Study of Clocked JK Flip Flop 10. with Credit Based System. measurement of frequency. realization of Boolean functions 3. inductors.: 2009-10 14 . Study of Half adder and Full Adder 4. LEDs & transistors 2. 4-bit shift register Revised Syllabus of B. 6. Study of Components: Identification and testing of resistors.(I.f. Study of Half Subtractor and Full Subtractor 5. diodes.e. Study of Parallel-in. Study of 4-line to 16 bit decoder 7.

Sc. 2. Array of Structure e. 13. Phone bill Revised Syllabus of B. Block transfer and block exchange of data bytes. Program to find Armstrong Number. Program to print the Fibonacci Series 8. Course : B. 7.) Code : 204AP Semester : I Lab for Programming in ‘C’ Hours/week : 4 Credit : 2 List of Experiments: 1. 2. measurement of delay period on CRO using SOD pin of 8085. 5. Employee pay slip . Program for recursion e.: 2009-10 15 . 12. 9. also programs which access numbers from specified memory locations) 3. 4.g. Multiplication of two 8-bit numbers using the method of successive addition and Shift & add. Transpose of matrices 10.Sc. Program for Addition of Array elements.T.Sc. factorial. 6. Program for Factorial of n. Multiplication of matrices 11. Division of two 8-bit numbers using the method of successive subtraction and shift & subtract. 10. student result. Generating delays of different time intervals using delay subroutines and 9. Addition and subtraction of two 16-bit numbers.Course : B. Find maximum amongst 3 numbers.g.) Code : 203AP Semester : I 8085: Microprocessor Hours/week : 4 Credit : 2 Instruction: Any ten experiments from the list given below are to be performed on the 8085 Microprocessor Kit: 1.(Information Technology). (Using 2’s complement method.T. Program to Calculate x y 5. Arranging the elements of a block of data in ascending and descending order. 11. Sorting array using bubble sort technique 12. w. Program for structure initialization 14. 3. Perimeter of Triangle & Rectangle. with Credit Based System. Addition and subtraction of two 8-bit numbers with programs based on different Addressing modes of 8085. 8. Program for Reversing the Array elements.(I. 4.e. reverse of digit 13. Find Area. 7. Finding the smallest and largest element in a block of data.(I. Program for Summation of First n Number. 6. Program to check Prime Number.f. Searching and element from array. Program for nested loops.

f.: 2009-10 16 .15.e. Function with parameter & return values Revised Syllabus of B.(Information Technology).Sc. with Credit Based System. w.

of Lect. Representation in Memory 3 Linked List • Concept of Linked List • Representation of linked List in memory • Traversing a linked list • Searching a linked list : sorted and unsorted • Insertion & Deletion in Linked List • Header Linked List & Two way List 4 Stacks. linked representation of queues • Types of Queues : Deques & Priority Queues 1. linked representation of stack. by Jean Paul Tremblay & Pal G. Introduction to Data Structure: • Introduction • Basic Terminology : Data item. including searching and sorting. In particular.f. queues.e.(Information Technology). stacks. and techniques of data abstraction. Application of stacks: Quicksort. lists. Arithmetic Expression POLISH & POSTFIX. w.: 2009-10 17 . Entity.Sc. Attributes • Data Organization and Data Structure 2. by Horowitz and Sahani (Galgotia publications). Tata Mcgraw. Recursion. (PHI). An introduction to data structures and application. Insertion and Deletions • Sorting & Searching Algorithms • Multidimensional Arrays : 2D & M-D Concept • Record : Record Structures. with Credit Based System.(I. • Queue : Representation of queues. 3 1 1 1 9 1 3 2 1 2 15 1 1 3 3 7 2 12 6 3 3 Core References: Data Structures : By Seymour Lipschutz. Array Representation of Stack. Data Structures. Recursion • Stack: Operation .Course : B. No. Files. Records. by Tannenbaum. Arrays • Representation of Linear Arrays • Traversing. Fundamentals of Data structures. the implementation of linear data structures such as arrays. Topic Ref No 1. Queues .) Code : 307T Semester : II Introduction to Data Structure Hours/week : 3 Credit : 3 Objective: This course provides students an opportunity to develop and refine their programming skills. Fields. Sr. the emphasis of this course is on the organization of information. 2. 3.T. Revised Syllabus of B.Sc. Advance Reference: 1.Hill Publication. Sorenson (McGraw Hill).

Methods for Handling Deadlock Storage Management • Memory Management: Address Binding. No I Topic Introduction to Software: • Software: Definition. Scheduling Algorithms. simple batch systems. LRU). Parallel systems. Logical Vs.e. Process Management • Concept of Process: Process State. Directory Structure. of Lect. Deadlock Modeling.) Code : 308AT Semester : II Operating Systems Hours/week : 3 Credit : 3 Objectives: To introduce students the basic functioning of operating systems as resource manager and its Salient features. Also to study about process states. Page replacement Algorithms (FIFO. Structure of OS. Memory and I/O Management techniques. Personal Computer systems.f. Memory Allocation. Semaphores. operating system as the main component of system software.Course : B. Sr. with Credit Based System. File management. Time sharing system. • Virtual Memory: Demand Paging. File Access. Operating System Fundamental • Operating Systems: OS as a resource manager. Real time systems • OS Structures: Components of OS: Process management. Critical Section. • File System Interface: Files. Free space Management Ref No. Optimal. w.T.(Information Technology).S.: Early systems. Distributed systems.(I. thread. classification and components of software. Segmentation. Characteristics of modern OS. I/O management. scheduling. • CPU Scheduling : Types of Schedulers. Problem of synchronization.Sc. Memory management. Virtual Memory in windowsXp.Sc. Criteria for scheduling. Storage management. • Types of O. Monitors. • Process Synchronization: Need for synchronization. 2 2 2/1 7 2 3 II 2 1/2 18 3 5 5 5 1/3 12 4 4 2 2 III IV Revised Syllabus of B. • Deadlocks: Concept of Deadlock. Evolution of OS. Segmentation and paging of Intel Pentium. Physical Address space. Protection • Implementation of File System: Allocation Methods. Paging. Hardware Synchronization. Operation on Processes.: 2009-10 18 . OS functions. multi-programmed batch systems.

w.Mokhade . Revised Syllabus of B. MacMillan Publication. Operating System Concepts. I/O Hardware . Galvin.R. By S. “Operating System”. Additional References: 1.(Information Technology).: 2009-10 19 .Donovan. “Operating System”.Sathe & Anil S.f. By Stuart E.e. with Credit Based System. John J.B. Addison – Wesley Publishing Company. Silberzchaz & P.V I/O System • I/O System Components : I/O Devices .A. Disk Scheduling . Disk Management 1/4 6 3 3 Core References: 1.Madnick. 2.Sc. Application I/O interface • Secondary Storage Structure : Disk fundamental.

mode • PUSH/POP.) Code : 303BT Semester : II 8086: Microprocessor Hours/week : 3 Credit : 3 Objectives: Make the student aware about the functional organization of physical components and architecture of a 8086 Microprocessor Kit. of Lect.T. Brey Revised Syllabus of B.: 2009-10 4 2 1 4 1 2 3 2 2 2 2 3 1 3 20 .(Information Technology).Sc. 1/1 1 2 2 1 1 2 3 1 Introduction to Microprocessor and Microcomputer • Historical background • Microprocessor based personal computer system • Number system • Computer data formats 2 8086 Hardware specification • Types of computers • Microcomputer structure and operation • 8086 internal architecture • Introduction to programming 8086 : programming languages 3 Addressing Modes 1/3 • Data addressing modes • Program memory addressing modes • Stack memory addressing modes 4 Data Movement Instructions ( Instructions related 1/4 with 8086 only) • MOV revisited: Machine language. LAHF & SAHF 5 Arithmetic instructions • Addition.Sc. w.special addr. Also give the brief about instruction set of 8086.the op-code. subtraction and comparison • Multiplication and division • BCD and ASCII arithmetic 6 Logic instructions • Basic logic Instructions • Shift and rotate 7 Program control Instructions • The JUMP group • LOOP • CALL & RET Core Reference: 1. The Intel Microprocessors: Architecture. No 1.f. initializing stack • Miscellaneous data transfer instructions: XCHG. Sr. resister assignment. MOD field.(I. Topic Ref No.Course : B. programming and interfacing – By Barry B.e.R/M memory addressing. with Credit Based System.

tolower() Preprocessor Directives: • File inclusion and conditional compiler directives.Sc.(Information Technology). Pointer expression and pointer arithmetic. Declaration and initialization of pointers. Storage Class & Library Functions: • Storage classes.malloc(). block and file scope.2. Scope. 21 References No. #endif. 3 Revised Syllabus of B. Microprocessors and Interfacing : Douglas Hall Course : B. visibility and lifetime of variable. auto. Nested structures. gets(). De-referencing. Bit fields. Miscellaneous Features: • Bitwise Internal Operators: Introduction. character pointer. The pointer operator * and &. Constant pointers.11. Pointer to an array. Arrays of structure. Two dimensional array of string. extern.Sc. atof(). #if. Accessing structure members. Masking. 1/5 6 4. Passing array and structure to function. ltoa(). file handling.(I. Functions & Pointers: • Call by reference. w. functions returning pointers. 2 6 5.h: atoi().T. Declaration and initializing structure. • String handling functions: strcpy(). typedef statement. strlwr(). #elif. static and register storage classes. strcmp(). 2) Write programs using pointers. #else. toupper(). 2/11. random(). Macro substitution. • Unions: Declaration. 1/15. with Credit Based System. strlen(). 1/10. calloc(). No 1. atol(). strcat(). of Lectures 2/10. representation of data. array of pointer to string. strupr().exit(). Topic Structure & Union • Structure: Introduction.) Semester : II Code : 304BT Advance Programming in C Hours/week : 3 Credit : 3 Objective: After working through this paper the students should be able to 1) Learn some advance features of C language. passing structure pointer to function. itoa(). Pointer to pointer. puts() • Data conversion functions from stdlib. #define.f. Sr. #ifdef. abs(). arrow (->) operator. 2/9. 4 2. 3) Aware of graphics functions of C. 2/App-I.: 2009-10 . Difference between structure and union Pointers: • Introduction.e. 1/5 6 3. Memory organization. 1/7 5 6. 2/14.

P. Kanetkar [Shaums Series] Revised Syllabus of B. Opening & closing a file. Programming in C 4. flushall(). fread() and fwrite() function. Drawing object in C. Rectangle. Ellipse. outtextx() function.e. with Credit Based System. 5 Core Reference: 1.13 • File handling: Introduction. remove(). [Tata macgraw hill] : Goterfried : Y. rename(). fprintf() and fscanf(). Balagurusamy. File Handling 2/12.(Information Technology). Graphics Under C Additional References: 1. Test your Skills in C : Moolish Kooper. Circle. 7. Graphics in C: 4 • Introduction: initgraph() and detectgraph() function. Random access functions fseek(). 1/12. Spirit of “C” 2.Kanetkar : Y. : Y. File copy program. • Command line arguments: use of argc and argv. Writing and reading records from binary file. putc() function.Enumerated data types. Let us C Solutions 2.f. Appending. Kanetkar [bpb publication] : E. 9 8. Programming in C 3. Line.Sc. rewind(). modifying and deleting a record from file. getc(). w. text and binary files. Input/Output operations on files.: 2009-10 22 . Changing foreground & background colors. Type casting. Filling object by color.

(Information Technology). reading. Revised Syllabus of B.Sc.II Hours/week : 2T+1P Credit : 3 Objective: To introduce advance topics to self-assess various components of communication skills as well as to improve listening.(I.: 2009-10 23 . writing. and speaking and presentation skills through practice.f.Course : B. w. with Credit Based System.e.) Code : 305BTP Semester : II Communication Skill.T.Sc.

Advance Reference Books: 1. Relative Error • Chopping off and Rounding off Error. Numerical methods -S.C. Absolute.e.Sc. Inverse of Matrix.Course : B. Error in Calculation 1/1 • Significant Error .) Code : 306BT Semester : II Numerical Computational Methods Hours/week : 3 Credit : 3 Sr. 2 24 . with Credit Based System. Core Reference Books: 1. R. 3 • Polynomial Regression. 2+1 • Bisection Method 2+1 • False Position Method 2+1 • Newton-Raphson Method 4 Elimination Methods for Solving Simultaneous 1/3 7 Equations 2 • Introduction and Matrix Notation of set of Equations 4 • Gauss Elimination Method 3 • Matrix Inverse Method 5 Interpolation 1/6 16 1 • Introduction and Polynomial Interpolation 2 • Newton-Gregory Forward Difference Interpolation Formula 2 • Newton-Gregory Backward Difference Interpolation Formula 2 • Central Difference Formula 2 • Newton’s divided Difference Interpolation 2 • Lagrange’s Interpolation 2 • Spline Interpolation 2 • Cubic Spline Interpolation 1 • Applications of Interpolation 6 Least Square Curve Fitting 1/7 8 2 • Best Fit and Criteria for Best Fit and Least Square Fit. Narosa Publication Hous. No 1 Topic Ref. Search Method for Initial Guess.B.T. 3/2 2 • Definitions.f.Dr. “Numerical Computational Methods” . of Lect.P. Rank of Matrix 3 Numerical Solutions of Transcendental Equations 1/2 10 1 • Concept of Iterative Methods. Percentage. • Truncation Error.Patil.(Information Technology). 2 Matrices and Determinants.Canale-McGraw Hill Revised Syllabus of B. Cofactor • Adjoint of Matrix. Matrix Operations • Determinant of Square Matrix. P.: 2009-10 No.Chapra. Propagation Error.Sc. w.(I. 3 • Linear Regression.

Write the programs for traversing of n item from the linked list.: 2009-10 25 .K) which reads a positive integer N>10 and determines whether or not N is a prime number.(Information Technology).e. Numerical methods-E.f. Implement Bubble sort using C. Implement Linear and binary search algorithm using C.) Code : 307P Semester : II Data Structure & Operating System Assignments: Write the Program using C (if applicable) : Data Structure: Write a program using DIV(J. Hours/week : 6 Credit : 3 Revised Syllabus of B. Operating System: 1. 5.T. Write a program which counts the number of particular character/word in the String. Write the programs for insertion and deletion of n item from the queues. Write the programs for insertion and deletion of n item using the array. Write a program which reads words WORD1 and WORD2 and then replaces each occurrence of word1 in text by word2 Write the programs for traversing of n item using the array. Write a program to implement the Round Robin Scheduling Algoithms.Balguruswamy Course : B. w. Write a program to implement the FCFS Scheduling Algoithms. 2. with Credit Based System.Sc.(I. Write a program to implement the Priority Scheduling Algoithms. 3.2. 4. Write a program to implement the SJF Scheduling Algoithms. Write the programs for push and pop operation using the stacks.Sc. Study of Unix/Linux Command.

Addition and subtraction of two 8-bit numbers with programs based on different Addressing modes of 8086. 6. 8. w. 5.f. with Credit Based System. Finding the smallest and largest element in a block of data. 4. 9. 12.e. Multiplication of two 8-bit numbers using the method of successive addition and Shift & add. Division of two 8-bit numbers using the method of successive subtraction and shift & subtract.) Code : 203BP Semester : II 8086 Microprocessor Hours/week : 4 Credit : 2 Any ten experiments from the list given below: 1. Revised Syllabus of B. Program for Addition of Array elements.(I. Generating delays of different time intervals using delay subroutines and measurement of delay period on CRO using SOD pin of 8086. 2. Addition and subtraction of two 16-bit numbers. Program for Factorial of n. Arranging the elements of a block of data in ascending and descending order.Course : B. 10. Block transfer and block exchange of data bytes.Sc. 11. also programs which access numbers from specified memory locations) 3.: 2009-10 26 . Program for Summation of First n Number. Program for Reversing the Array elements.Sc. (Using 2’s complement method.(Information Technology).T. 7.

9. 3. Newton’s divided Difference Interpolation Program in C for representation of. compare.Sc. 6. 5.T.: 2009-10 27 . Program to modify a record from binary file Program to delete a record from binary file Program on conditional compiling Program on macro substitution. 12. Newton-Gregory Forward Difference Interpolation Formula Program in C for representation of.Sc. 4. Program using command line arguments. Gauss Elimination Method Program in C for representation of. w. Program in C for representation of. Lagrange’s Interpolation Program in C for representation of.(Information Technology). 11. 6. 3.T. concatenation. 12 . Newton-Gregory Backward Difference Interpolation Formula Program in C for representation of. string copy. Program to sort names. 15.g. 8. Central Difference Formula Program in C for representation of. 16. 9. Inverse of Matrix Program in C for representation of. 13. 5. Newton-Raphson Method Program in C for representation of. Spline Interpolation Revised Syllabus of B. String manipulation function e. 7. reverse Program for reading/writing text file.) Code : 206BP Semester : II Hours/week : 4 Credit : 2 Implementation of Numerical Computational Methods Using C. Program for reading/writing binary file File copy program. 10 .(I.Sc. 14. False Position Method Program in C for representation of. Bisection Method Program in C for representation of. string length. hut. clock. etc. 1.Course : B.) Code : 204BP Semester : II Advance Programming in C Hours/week : 4 Credit : 2 1. 2. Program to demonstrate the storage class. Matrix Inverse Method Program in C for representation of.f. Course : B. 2. 4. with Credit Based System. Program for data conversion Program to draw simple pictures (human face. 8. Swapping of numbers by using call by reference Program to pass array to function. 11 . 7.) using graphics functions. Program for passing structure pointer to function.e. 10.(I.

Chemistry.S.T.C.e.Sc. with Credit Based System. Revised Syllabus of B.Dr. A candidate who has passed the B.(Information Technology) degree course only if he/she satisfies the following condition: 1. Physics. He/ She must have passed the higher secondary (multipurpose) examination conducted by H. Second and Third year in the subject or subjects concerned excluding compulsory English. board Government of Maharashtra with science / technical subjects Or an Examination of any statutory University and Board recognized as equivalent thereto.C. He/ She must have passed with minimum 50% of marks (45% reserved category) at qualifying examination. Second Language and remaining optional subject(s).Sc. Mathematics and or Biology or one of the technical subjects prescribed at the said examination as the optional or elective subjects or an examination recognized as equivalent thereto. 2. OR He/She must have passed examination prescribed at the end of second year of the junior college conducted by the H.(Information Technology) examination of this university may be allowed to present himself subsequently at the degree examination in a subject or subjects other than those he has taken earlier provided that he puts in three years of attendance as a regular candidate for First.S. A candidate shall not be allowed to appear for such examination if he has passed the higher examination. Maharashtra State. board. Babasaheb Ambedkar Marathwada University.: 2009-10 28 . w. Appendix ‘A’ A Candidate shall be admitted to the I year of the B. OR Three years Diploma Course in engineering conducted by the board of technical Education./Electronics.(Information Technology). Second language. Government of Maharashtra with English.f.Sc. OR Candidate having offered prescribed vocational course (MCVC) with Computer techniques/I.

 The final grade will be given to the candidate by the university. if he/she failed to gain the complete credits of the Second and Third Semester. Grade: The grade will be given as follows: Revised Syllabus of B. w.  There will be 40% weightage for two class test and 60% for the final theory examination. in that course irrespective of marks obtained in the class tests. if he/she failed to gain the complete (27) credits of the First Semester and a candidate will not be allowed to get admission in Fifth Semester.  The pattern of the examination and the scope is indicated in the syllabus.e.: 2009-10 29 .Sc. The mark list of the same is to be submitted to the university authority within 7 working days after the completion of class tests.  The schedule for the first class test will tentatively be after 30 working days (not later than 31 August/10 February).  Final Examination will be conducted by the University based on the complete syllabus. with Credit Based System.  For Each course the concerned teacher will have to conduct two Class tests after completion of 15 and 30 lectures respectively. If Marks of the final Theory examination in any course is less than 40%. There shall not be separate timetable for the class test. second class test after 60 working days (not later than 15 October/15 March) and Final examination after 75 working days in respective semesters. the Candidate will be given F grade.  Maximum number of students in a batch for practicals in first four semesters shall consist of 20 students and for fifth & sixth semester the batch shall consist of 15 students.The Degree of Bachelor of Science (Information Technology) shall be conferred on candidate who has pursued a regular course of study consisting of six semesters in the relevant subject as prescribed and has appeared at the end examination and passed under the credit based system in all the examination prescribed for the Degree course in the faculty.f.(Information Technology).  Final Practical Examination will be conducted by the university and examiners will submit the grade of students for practical examination to the university. The concerned teachers have to take class test in their teaching schedule.  A candidate will not be allowed to admit in Third Semester.  The Number of students in a theory class shall not exceed 60.

The candidate with 55% & above and less than 60% marks will get B+ grade.(Information Technology). During repetition of the course the candidate has to re-appear for the class tests and final examination. Points Calculation: Grade A+ A B+ B C+ C F Points 10 9 8 7 6 5 0 Revised Syllabus of B. The candidate with 50% & above and less than 55% marks will get B grade.: 2009-10 30 . The course incharge of the course will conduct the class test. with Credit Based System. The candidate with 60% & above and less than 75% marks will get A grade. w. He/She has to repeat the course as per the guidelines given by the college.f.Sc. The candidate with less than 40% marks will get F grade.e. The candidate with 40% & above and less than 45% marks will get C grade. Any students with F grade will be considered to be failed in the course.The candidate with more than or equal to 75% marks will get A+ grade. The candidate with 45% & above and less than 50% marks will get C+ grade.

: 2009-10 31 .e. w. as follows: Final Grade as per the final GPA: Equivalent Percentage More than or Equal to 75% 60% and less than 75% 55% and less than 60% 50% and less than 55% 45% and less than 50% 40% and less than 45% Below GPA GPA >=9 8 > GPA < 9 7 > GPA < 8 6 > GPA < 7 5 > GPA < 6 4 > GPA < 5 < 4 GPA Final Grade A+ A B+ B C+ C F Revised Syllabus of B. with Credit Based System.Grade Point Average (GPA): The student will have GPA between 4 to 10 computed as follows: GPA = Sum (Course credit * number of points obtained) Sum (Course Credit) The final grade will be assigned to students on the basis of final GPA.Sc.(Information Technology).f.

f.T. Pract.: 2009-10 32 . Aurangabad Curriculum Structure and Scheme of Evaluation: B. Th. 60 60 60 60 60 60 360 60 60 60 60 60 60 360 50 50 50 50 200 50 50 50 50 200 3 3 3 3 3 3 4 4 4 4 3 3 3 3 3 3 4 4 4 4 - Total Marks 100 100 100 100 100 100 50 50 50 50 800 100 100 100 100 100 100 50 50 50 50 800 Semester I 1 301T 2 302T 3 303AT 4 304AT 5 305ATP 6 306AT Computer Fundamentals Digital Electronics 8085:Microprocessor Programming in C Communication Skill – I Mathematical Foundation 7 301P Office Suite 8 202P Digital Electronics 9 203AP 8085:Microprocessor 10 204AP Programming in C Total of Semester – I Semester II 1 307T Data Structure 2 308AT Operating System I 3 303BT 8086:Microprocessor 4 304BT Adv. Code T P Total Total hrs/ week hrs/ week hrs/ week Credits Class Tests 20+20 20+20 20+20 20+20 20+20 20+20 240 20+20 20+20 20+20 20+20 20+20 20+20 240 Scheme of Evaluation(Marks) Uni.Babasaheb Ambedkar Marathwada University.Sc.(I. Duration ( in hrs. Programming in C 10 206P Numerical Methods Total of Semester – II 3 3 3 3 2 3 17 3 3 3 3 2 3 17 1 6 4 4 4 19 3 3 3 3 3 3 6 4 4 4 36 3 3 3 3 3 3 6 4 4 4 36 3 3 3 3 3 3 3 2 2 2 27 3 3 3 3 3 3 3 2 2 2 27 1 6 4 4 4 19 Revised Syllabus of B.B.II 6 306BT Numerical Computation Methods 7 307P Data Structure & O.( Information Technology) Dr. Exam.Sc.e.(Information Technology). Course Name of the Subject Scheme of Teaching No. w. Programming in C 5 305BTP Communication Skill .) Exam.S.Exam Univ. 8 208BP 8086:Microprocessor 9 204BP Adv.) Sr. Uni.Sc. with Credit Based System.

No. Pract.(I. Based on 310AT 12 215AP/228 Pr. Proj. Duration ( in hrs. with Credit Based System.(Information Technology).( Information Technology) Dr. Course Code Name of the Subject Scheme of Teaching P Total Total Credit hrs/ hrs/ week week T hrs/ week Class Test Scheme of Evaluation(Marks) University Uni.) Sr. Based on 312AT 9 204CP Pr.Sc. Exam. w. Based on 315AT/328T / P/221AP/2 321AT/317T 17P 13 215AP/228 Pr. Aurangabad Curriculum Structure and Scheme of Evaluation: B. Based on 306CT 11 225P Pr. Mgmt-I 2 327T DBMS using SQL 3 314AT DCN – I 4 310AT OOPs using Java–I 5* 315AT Computer Graphics – I 6* 328T ASP and JSP 7* 321AT Dataware hsg. No.Sc.e. Based on 326AT 10 227P Pr.) Total Marks Exam.Sc. 5/6/7/8) Revised Syllabus of B. Based on 327T 11 210AP Pr.B.: 2009-10 33 .and DM 8* 317T Linux 9 126AP Pr. Based on 309AT 8 212AP Pr. Based on 304CT 10 106CP Pr. 50 50 50 50 50 250 50 50 50 50 50 Semester III 1 309AT Analysis of Algorithm 2 308BT Operating System II 3 312AT DBMS – I 4 304CT OOPs using C++ 5 306CT Statistical Methods 6 325T IT Tools and Application 7 209AP Pr.T.f.Babasaheb Ambedkar Marathwada University. Based on 315AT/328T / P/221AP/2 321AT/317T 17P Total of Semester – IV 3 3 3 3 3 3 18 3 3 3 3 3 3 3 3 18 4 4 4 2 4 18 3 3 3 3 3 3 4 4 4 2 4 36 3 3 3 3 3 3 3 3 2 4 4 4 4 36 3 3 3 3 3 3 2 2 2 1 2 27 3 3 3 3 3 3 3 3 1 2 2 2 2 27 20+20 20+20 20+20 20+20 20+20 20+20 - 60 60 60 60 60 60 - 240 20+20 20+20 20+20 20+20 20+20 20+20 20+20 20+20 360 60 60 60 60 60 60 60 60 3 3 3 3 3 3 4 4 4 2 4 3 3 3 3 3 3 3 3 2 4 4 4 4 - 100 100 100 100 100 100 50 50 50 50 50 850 100 100 100 100 100 100 100 100 50 50 50 50 50 850 2 4 4 4 4 18 240 360 250 * Indicate optional paper (any two from Sr. Based on 325T Total of Semester – III Semester IV 1 326AT Soft.Exam Uni.

Based on 329T 11 210BP Pr. Based on 326BT 10 229P Pr.Sc. Based on 310BT 12 230P/231A Pr.(Information Technology).mgmt-II 2 329T Internet Security 3 314CT Wireless networks 4 310BT OOPs using Java–II 5* 330T E-Business 6* 331AT Multimedia Tech 7* 320AT XML 8* 321BT KDD 9 126BP Pr.Sc.B.Test. Based on 330T / 331AT / P/220AP / 320AT / 321BT 221BP Total of Semester – V Semester VI 1 313CT Soft. Course Code Name of the Subject Scheme of Teaching P Total Total Credit hrs/ hrs/ week week T hrs/ week Class Test Scheme of Evaluation(Marks) University Uni.andQA 2 332T Cust Rela Mgmt 3 323T Ethics and Cyber law 4 320BT UML 5* 333T Internet Prog.) Sr.: 2009-10 34 . *** Indicates credit for review 1 and Actual Seminar presentation.Sc.Babasaheb Ambedkar Marathwada University.e.Exam Uni. Aurangabad Curriculum Structure and Scheme of Evaluation: B. 50 50 50 50 50 Semester V 1 326BT Soft. with Credit Based System. Duration ( in hrs.(I.( Information Technology) Dr. w. Based on 330T / 331AT / P/220AP / 320AT / 321BT 221BP 13 230P/231A Pr.Usg PHP 6* 334T ERP 7* 331BT Animation 8* 314CT Mobile Computing 9 740P PROJECT WORK 10 241P SEMINAR 3 3 3 3 3 3 3 3 18 3 3 3 3 3 3 3 3 18 2 4 4 4 4 18 3 3 3 3 3 3 3 3 2 4 4 4 4 36 3 3 3 3 3 3 3 3 14 4 36 3 3 3 3 3 3 3 3 1 2 2 2 2 27 3 3 3 3 3 3 3 3 7** (1+2+4) 2*** (1+1) 27 20+20 20+20 20+20 20+20 20+20 20+20 20+20 20+20 240 20+20 20+20 20+20 20+20 20+20 20+20 20+20 20+20 60 60 60 60 60 60 60 60 - 3 3 3 3 3 3 3 3 2 4 4 4 4 3 3 3 3 3 3 3 3 6 3 - 100 100 100 100 100 100 100 100 50 50 50 50 50 850 100 100 100 100 100 100 100 100 200 50 850 360 60 60 60 60 60 60 60 60 250 200 50 14 4 18 Total of Semester – VI 240 360 250 * Indicate optional paper (any two from 5/6/7/8) ** Indicates credit for review 1.) Total Marks Exam.proj. Exam.T.f. No. Revised Syllabus of B. review 2 and Actual Project Work. Pract.