II SEMESTER
Theory Question Paper Format
The question papers of the theory examinations should follow the pattern specified below:
| Section |
Marks for Each Question |
Number of Questions |
Total Marks |
|
|
Total |
Should Answer |
|
| A |
3 |
8 |
6 |
18 |
| B |
8 |
6 |
4 |
32 |
| C |
10 |
3 |
2 |
20 |
|
Total Marks |
70 |
While selecting the questions importance should be given to all major units.
PRACTICAL QUESTION PAPER FORMAT
| Scheme of valuation:
|
| 1. |
Writing two programs one from each section |
20 marks |
| 2. |
Execution of one program |
20 marks |
| 3. |
Formatting the program and output |
10 marks |
| 3. |
Record verification |
10 marks |
| 4. |
Viva voce related to practical topics only |
10 marks |
| Total Marks |
70 |
PROJECT EVALUATION FORMAT
|
|
| 1. |
Demonstration and presentation |
70 marks |
| 2. |
Documentation |
30 marks |
| Total Marks |
100 |
TITLE: Data Structures Using C
CODE: CA2112
Hrs / Week: 4 Hrs
CREDITS: 3
Files in C and Introduction to data structures:
Introduction, File data type, opening and closing a file, file functions (getc, putc, getw, putw, fscanf, fprintf, fread, fwrite, fgets, fputs, feof), Dynamic allocation. Introduction to data structures, Classification of data structures.
8 Hrs
Linear data structures:
Introduction, Stacks, Storage representation of stacks, operations on stacks, applications of stacks, queues, operations on queues, circular queues, operations on circular queues, applications of queues and circular queues, polish notation, evaluation of expression.
15 Hrs
Linked Lists:
Introduction, Singly linked list, operations on linked lists, traversing a linked list, creating a linked list, adding nodes at various positions in a linked list, deletion of nodes, advantages and disadvantages, types of linked lists, applications of linked lists.
15 Hrs
Trees:
Introduction, terminologies and basic concepts, Binary tree, Storage representation of binary tree, tree traversals, Binary search tree, Implementation of BST, building a binary search tree, height balanced tree, AVL rotation.
10 Hrs
Searching and sorting:
Sorting – Bubble sort, Insertion sort, selection sort, quick sort, merge sort, heap sort, hashing. Searching – Linear and Binary.
12 Hrs
BOOKS :
1. Data Structure by Schaum Series
2. Fundamentals of Data Structure by Horowitz Sahni
3. Data Structure by Dale and Lilly
4. S. Sahni, Data Structures, Algorithms and Applications, Tata McGraw Hill,
TITLE: Microprocessors (8086)
CODE: CA2212
Hrs / Week: 4 Hrs
CREDITS: 3
Architecture and Operation of 8086:
Introduction to 8086, Operation of Intel 8086, Pin description of 8086, ADDRESS BUS, DATABUS, CONTROL BUS.
8 Hrs
Programming with 8086:
Programming model, instruction classification, Instruction format, Addressing modes of Intel 8086, writing assembly level programs-overview of instruction set of 8086,. Data transfer, Arithmetic, Logic branch operations. Programming techniques - Looping, Counting and Indexing, Additional data transfer and 16 bit arithmetic operations, logic operations, Compare and rotate operations. Counters and Time delays. Stacks and subroutinesconditional CALL and RETURN instructions
20 Hrs
Memory Interfacing, Interfacing I/O Devices using 8086:
Memory Interfacing. Interfacing Output displays, Interfacing Input devices, peripheral mapped I/O, memory mapped I/O.
7 Hrs
Interrupts of 8086:
8086 interrupts, 8086 vectored interrupts, LOCK, 8086 BUS CYCLE.
7 Hrs
Interfacing of peripherals (I / Os) and applications:
Interfacing Keyboard (linear and matrix) and 7 segment display including multiplexers, 8279 programmable keyboard/display interface, 8255 PPI, 8259 PIC, DMA and 8237 DMA controller, Interfacing data converters-D to A converters, A to D converters.
18 Hrs
BOOKS:
1. R.S. Gaonkar - Microprocessor Architecture, Programming and Application with 8086. Penram Int. 3rd Edition
2. Brey B Brey, The Intel Microprocessor 8086/8088, 80186/80188, 80286, 80386, 80486 Pentium, Pentium Pro. Processor, 6th Edition, Pearson Education.
3. Douglas V. Hall - Microprocessors and digital systems, MH.
4. Kenneth L. Short - Microprocessor and Programmed Logic", PHI, 2nd Edn.
5. Aditya P. Mathur - Introduction to Microprocessors, 3rd Edn. TMH
6. Antonakos: Introduction to Intel family of Microprocessors Pearson Education
7. Hoffer: Modern Systems Analysis and Design Pearson Education
8. Kendall, System Analysis and Design
TITLE: Operating system
CODE: CA2312
Hrs / Week: 4 Hrs
CREDITS: 3
Introduction:
Definition, functions, views, types, Buffering & spooling, multiprogramming, time- sharing, Real time system, protection, operating system structure, system components, system calls.
10 Hrs
Process Management:
Process concept, functions, Cooperating process, Interprocess communication, Scheduling Criteria, job & processor scheduling. (preemptive & non preemptive) FCFS,SJF,Round Robin algorithms, process synchronization – semaphores, deadlocks - detection and recovery.
15 Hrs
Memory Management:
Functions, Different schemes-Single continuous-Partitioned -Multiple Relocatable-PagingDemand paging-Segmentation-Paged segmentation. Virtual Memory management: Demand paging, Page replacement & page replacement algorithm, and thrashing.
15 Hrs
Device and file system:
Disk structure, allocation methods, free space management, need for disk scheduling, scheduling algorithm, access methods, directory structure, organization, file protections.
0 Hrs
Case Studies:
DOS and UNIX– Memory Management – overlaying – Extended and Expanded memory – Memory allocation – File system and allocation method – Internal and External commands – Memory management commands – File management commands.
10 Hrs
BOOKS:
1. Operating System by Milan Milenkovic, McGraw Hill, 1987
2. Operating System by Madnick and Donoval, McGraw Hill, 1974
3. Operating System Concepts by James L Peterson
4. Operating System Design and Implementation by Andrew S Tenenbaum
TITLE: Operations Research
CODE: CA2412
Hrs / Week: 4 Hrs
CREDITS: 3
Linear Programming Problems: Origin and development of operations research, Linear Programming Problem – formulation of Lenear Programming problem, Graphical solution. Theory of simplex method. Use of artifical variables and their solution.
10 Hrs
Transportation Problem: Mathematical formulation of transportation problem, Initial basic Feasible solution, North West corner rule, Matrix minima method, Vogel’s approximation method, MODI method to find optimal solution.
11 Hrs
Assignment Problem: Mathematical formulation of an Assignment problem, Assignment algorithm, Hungarian Method to solve Assignment Problem.
13 Hrs
Network Analysis: Basic components of Network, Rules for drawing Network diagram Time calculation in Networks. Critical Path Method and PROJECT Evaluation and Review Techniques. Algorithm and flow chart for CPM and PERT.
13 Hrs
Theory of Games: Two – person Zero –sum Games, the maximin and Minimax principle, Saddle point and value of the Game. Game without saddle points, mixed strategies, solution for 2X2 games, Graphical method Dominance property.
13 Hrs
BOOKS:
1. Taha, “Operations Research”, 7th edition, Pearson Education, 2007.
2. Billey E. Gillett, “Introduction to Operations Research” , HimalayaPublishing House, Delhi, 1979.
3. Hamady A.Taha “Operations Research” , Collin Mac Millan, 1982.
PRACTICALS
TITLE: DATA STRUCTURES LAB
CODE: CA2P1
Hrs / Week: 2 Hrs
CREDITS: 1
PART A (Data Structures)
1. Array implementation of a stack.
2. Array implementation of a queue.
3. Array implementation of circular queue.
4. Creating a linked list.
5. Adding nodes at various positions in a linked list.
6. Deleting nodes from various positions from a linked list.
7. Operations on linked list.
8. Creating a binary search tree.
9. Performing the various traversals on a binary search tree.
10. Insertion sort.
11. Quick sort
12. Merge sort
13. Heap sort
14. Radix sort
15. Linear search
16. Binary search
TITLE: MICROPROCESSOR LAB
CODE: CA2P2
Hrs / Week: 2 Hrs
CREDITS: 1
1. Exchange of two 16-bit numbers.
2. Addition & Subtraction of two 8-bit HEX numbers.
3. Addition of two 16-bit numbers.
4. Subtraction of two 16-bit numbers.
5. Conversion of hexadecimal to BCD.
6. Block Transfer.
7. Block Transfer in reverse order.
8. 2's Complement of 8 &16 bit number.
9. Largest & smallest number in an Array
10. Checking of +ve, -ve &Zero.
11. Multiplication by successive addition.
12. Frequency of occurance of element.
13. Sum & Average of n-one byte number
14. Square root of a given number.
15. Searching for a number.
16. Addition of two 32 bit numbers.
17. Counting no of ones and zeroes.
18. Sum of odd and even numbers in an array.
Back
