IT Syllabus Sem III and IV Only
IT Syllabus Sem III and IV Only
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 291
--------------------------------------------------------------------------------------------------------------------------------------------
List of Experiments:
This is a sample list of Experiments, minimum 12 experiments are to be performed covering the entire
syllabus. At least two experiments should be beyond syllabi based on learning of syllabi (Apply)
***************
Course Outcomes:
After successfully completing the course, the students will be able to:
UNIT-II: Laplace Transform:- Definition, standard forms, properties of Laplace transform, inverse
Laplace transform, Initial and final value theorem, Convolution theorem, Laplace transform of
impulse function, Unit step function, Laplace transforms of periodic function . (7 )
b) Statistics Curve fitting: Least Square Method, Coefficient of Correlations, Lines of Regression. (7)
UNIT-V: Complex Analysis: - Functions of complex variables, Analytic function, Cauchy- conditions, Harmonic
function, Harmonic conjugate functions, Milne’s Method, conformal mappings (translation, rotation,
magnification and bilinear transformation), Expansion of function in Taylor’s and Laurent’s series. (7)
UNIT–VI: Vector calculus:- Scalar and vector point functions, Differentiation of vectors, Curves in space,
Gradient of a scalar point function, Directional derivatives, Divergence and curl of a vector point
function and their physical meaning, expansion Formulae (without proof), line, surface, volume
integrals, irrotational Solenoidal Vector fields. (7)
Text Books:
1. Elements of Applied Mathematics Vol. II by P. N. Wartikar and J.N. Wartikar,
2. Higher Engg. Mathematics by B.S. Grewal.
Reference Books:
1. Advancing Engg. Mathematics by E.K.Kreyzig.
2. A text book of Differential Calculus by Gorakh Prasad.
3. A Text Book of Applied Mathematics by P.N.Wartikar and J.N.Wartikar.
4. Engineering Mathematics by Ravish R Singh, Mukul Bhatt.
**************
Course Objectives:
Increase Critical thinking and analytical problem-solving skills and awareness of computer related ethics to
discrete Mathematical Logic.
Apply appropriate discrete mathematical concepts and operations to interpret data and to solve problems.
Identify problem and analyze it in terms of its significant parts and the information needed to solve
problems based on sets, relation, function and recursion.
Formulate and evaluate possible solutions to problem and select the chosen solution based on Boolean
algebra.
Construct graphs and trees, interpret them, and draw appropriate conclusion.
Course Outcomes:
After successfully completing the course, the students will be able to:
Identify basic terminology of Mathematical Logic, Theory of inference & Predicate calculus.
Identify, illustrate, and solve engineering problems on the basis of set theory.
Identify and Design an Algebraic Structures and groups
Examine and formulate the concept of Lattices & Boolean Algebra to solve engineering problems.
Design and interpret data using graphs, trees and related algorithms.
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 293
--------------------------------------------------------------------------------------------------------------------------------------------
UNIT I : Mathematical Logic : Statements & Notation , Connectives , Normal forms , The Theory of Inference for
the Statement Calculus , Predicate Calculus , The Inference Theory of the Predicate Calculus.
UNIT II: Set Theory : Basic concepts of Set Theory , Representation of Discrete Structure, Relation and ordering,
Functions , Recursion.
UNIT III : Algebraic Structures : Algebraic Systems , Semi groups and Monoids , Grammars and Languages, Polish
expression & their compilation , Groups , Semi groups, Application of Residue Arithmetic to Computers.
UNIT IV: Lattice & Boolean Algebra: Lattices as Partially Ordered Sets, Boolean Algebra, Boolean Functions,
Representation of Boolean Functions , Minimization of Boolean Functions.
UNIT V: Graph Theory: Basic concepts of Graph Theory , Paths, Reachability & Connectedness, Matrix
representation of graphs , Storage Representation and Manipulation of Graphs, Coloring Graphs.
UNIT VI: Trees, Tree Searching, Minimal spanning trees, Simple Precedence Grammars, , rooted tree, expression
tree, B tree, Distance between spanning trees of a graph. PERT and Related Techniques.
Text Book : J.P.Trembley, R.Manohar :”Discrete Mathematical Structures with Application to Computer Science”
1988 (Tata McGraw Hill)
REFERENCE BOOKS:
1 G Shankar Rao, “Discrete Mathematical Structures”, New Age International, 2002 ISBN:81-224-1424-9.
2 Kenneth H. Rosen, “ Discrete Mathematics and its Applications”, 7th Edition, McGraw Hill Edition.
3. S.K. Chakraborty & B.K.Sarkar ;”Discrete Mathematics” OXFORD.
4. Bernard Kolman,Robert C.Busby, Sharon Ross: “Discrete Mathematical Structures” Third Edition PHI.
Course Objectives:
Study of the basic concepts of Java such as operators, classes, objects, inheritance, packages and exception
handling.
Study of concepts like enumerations, generics, logging, API, assertions, Applets, AWT.
Preparing the students to learn Object Oriented Programming Methodology.
Course Outcomes:
Unit I: Introduction to Object Oriented Programming: Introduction, Need of OOP, Principles of Object-
Oriented Languages, Procedural Language Vs OOP, Application of OOP, Java Virtual Machine, Java features,
Program Structures. Java Programming Constructs: Variables, Primitive data types, Identifier, Literals, Operators,
Expressions, Precedence Rules and Associativity, Primitive Type Conversion and Casting, Flow of Control.
Unit II: Classes and Objects: Classes, Objects, Creating Objects, Methods, Constructors, Cleaning up Unused
Objects, Class Variable and Methods, this keyword, Arrays, Command Line Arguments.
Unit III: Inheritance: Inheritance vs. Aggregation, Polymorphism, Method Overloading Method Overriding, super
keyword, final keyword, Abstract class. Interfaces, Packages and Enumeration: Interface, Packages, java.lang
package, Enum type.
Unit IV: Exception: Introduction, Exception handling Techniques, User-defined exception, Exception
Encapsulation and Enrichment. Input/ Output: The java.io.file Class, Reading and Writing data, Randomly
Accessing a file, Reading and Writing Files using I/O Package.
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 294
--------------------------------------------------------------------------------------------------------------------------------------------
Unit V: Applets: Introduction, Applet Class, Applet structure, Applet Life cycle, Common Methods used in
displaying the output, paint (), update () and repaint (), More about applet tag, get Document Base () and get Code
Base() methods.
Unit VI: Event Handling: Introduction, Event delegation Model, java.awt.event Description, Sources of events,
Event Listeners, Adapter classes, Inner Classes. Abstract Window Toolkit: Introduction, Components and
Containers, Button, Label, Checkbox, Radio Buttons, List Boxes, Choice Boxes, Text field and Textarea, Container
Class, Layouts, Menu, Scrollbar.
Text Book: Sachin Malhotra and Saurabh Choudhary: Programming in Java, Oxford University Press 2010.
Reference Books:
1. Herbert Schildt: Java Complete References (McGraw Hill)
2. E. Balagurusamy: Programming with Java (McGraw Hill)
3. Khalid Mughal: A Programmer’s Guide to Java Certification, 3rd Edition (Pearson)
4. Liang: A text Book of Java Programming, (PHI).
Course Objectives :
Course Outcomes ;
After successful completion of this course the student will be able to
1. To draw and explain internal architecture of 8086 with its register organization.
2. Able apply instruction format 7 addressing modes in 8086 programming.
3. Able to apply control flow instruction in 8086 programming through use of any Open Source
Software.(TASM,NASM etc.)
4. Able to apply stack & subroutine concept in 8086 programming.
Unit I: Microprocessor 8086 architecture-BIU and EU, pin configuration, Software model of 8086 microprocessor.
Memory addresses space and data organization. Data types. Segment registers, memory segmentation. IP & Data
registers, Pointer, Index registers. Memory addresses generation.
Unit II: 8086 Instruction set overview, addressing modes. 8086 instruction formats. 8086 programming: Integer
instructions and computations: Data transfer instructions, Arithmetic instructions and their use in 8086
programming.
Unit III: 8086 instructions: logical instructions, Shift and rotate instructions 8086 programming: 8086 flag register
and Flag control instructions control flow and jump instructions, Loops & loop handling instructions. 8086
programming using these instructions.
Unit IV: Stack and Subroutines,8086 stack segment and stack related instructions. 8086 I/O Address space,
Subroutines and related instructions, parameter passing, Concept of Macros, Status saving on stack. Concept of
recursion at assembly Program level. 8086 programming using subroutines, recursion and macros.
Unit V: 8086 I/O: Types of input output, isolated I/O interface, input output data transfers, I/O instructions and bus
cycles. Programmable Peripheral Interface 8255 PPI: pin diagram, internal organization, modes of operation.
Unit VI: 8086 Interrupt Mechanism, types and priority , Interrupt vector table, Interrupt Instructions, External
hardware-interrupt interface signals & interrupts sequence. Programmable Interrupt Controller 8259: Block & pin
diagram, internal architecture, Software interrupts, Nonmaskable interrupt, Internal Interrupt functions.
Text Book: Avtar Singh & Walter A. Triebel: The 8088 and 8086 Microprocessors, Programming, Interfacing,
Software, Hardware, and Applications, PHI, 2003.
References:
1. Barry B. Brey : The Intel Microprocessor Architecture, Programming & Interfacing (6/e)(PHI)
2. John P Uffenbeck, “8086/8088 Families: Designing, Programming and Interfacing”. Prentice Hall
3. D. V. Hall: Microprocessors and Interfacing, TMH.
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 295
--------------------------------------------------------------------------------------------------------------------------------------------
3IT05 ANALOG AND DIGITAL ELECTRONICS
Course Objectives :
To understand the basic operation and applications of analog devices such as BJT and JFET
To introduce analog ICs like Op-Amp and Timer
To study and develop skills to design basic combinational and Sequential logic circuits
To lay foundation for understanding computer architecture and organization
Course Outcomes :
On completion of the course learner will be able to-
Understand the basic applications of BJT.
Get acquainted with analog ICs like Op-Amp IC-741 and Timer IC-555
Discriminate the working of sinusoidal and non-sinusoidal waveform generators.
Apply the concept of K-map to simplify logic expressions.
Design and implement Combinational circuits
Explore the applications of Sequential circuits
UNIT I:
Introduction to Analog Circuits: Transistor as an amplifier. Need of biasing, Potential divider bias circuit, Faithful
amplification of CE amplifier, Transistor as an electronic switch, Construction and working of JFET.
UNIT II:
Operational Amplifier: Block diagram of Op-Amp, ideal Op-Amp parameters. Applications of op-amp: Inverting
& Non-Inverting Amplifier, Voltage follower, Summing Amplifier, Subtractor, Comparator.
UNIT III:
Wave Generators:
Transistorized Oscillators: Barkhausen Criterion, R-C Phase Shift Oscillator, Transistor crystal oscillator Timer IC
555: Block diagram, working, Astable multivibrator, Monostable multivibrator.
UNIT IV: Introduction to Digital Circuits: Logic gates, Standard logic expression forms, SOP, POS, Logic
expression realization & minimization using K-map (upto 4 variables only). Half Adder, Full Adder, Half subtractor,
Full subtractor.
UNIT V: Logic Circuits: Difference between Combinational and Sequential circuits, Code convertors (BCD,
Excess-3 and Gray), Multiplexers, De-multiplexers and Decoders.
Flip Flops: SR flip-flop, JK flip-flop, D flip-flop and T flip-flop.
UNIT VI: Sequential Circuits: Difference between Asynchronous & Synchronous sequential circuits,
Asynchronous counters, Mod counter, Up-Counter, Down-Counter. Working of shift Registers, SISO, SIPO, PISO
and PIPO. Application of Shift Register as a Ring Counter.
Text Books:
1. V.K.Mehta, Rohit Mehta: Principles of Electronics (S.CHAND)
2. Gayakwad R.A.: Op-Amps & Linear Integrated circuits (PHI)
3. Jain R.P. Modern Digital Electronics (TMH)
Reference Books:
1. N.N.Bhargava, D.C.Kulshreshtha, S.C.Gupta: Basic Electronics & Linear circuits, (TTTI)
2. S. Salivahanan: Electronics Devices & circuits, Third Edition
3. John P. Hayes: Introduction to Digital Logic Design{Pearson)
4. Anand Kumar: Fundamentals of Digital Circuits (PHI)
1. Write a program to demonstrate various data-types used in java and also perform the type casting.
2. Demonstrate the use of this keyword in java.
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 296
--------------------------------------------------------------------------------------------------------------------------------------------
3. Write a program in java to demonstrate various OOP’S (Inheritance, Polymorphism, and Abstraction)
concepts in java.
4. Create User defined Packages in Java
5. Write a program in java to set the priority of thread in order.
6. Demonstrate the strings are immutable in java and create mutable strings in java.
7. Write a program in java which demonstrates the exception caught because of invalid input.
8. Write java program to create a registration form using AWT.
9. Write a Java program to demonstrate the use of AWT components namely buttons, labels, text boxes,
menus with event handling.
10. Write a program in java to copy certain text of one file to another newly created file in java using java I/O
operations.
11. Write a program in java to connect java to oracle or MySql Database using JDBC drivers
12. Demonstrate the various List interfaces in java.
13. Write a program in java to show use of generic classes and methods
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
Following list is an indicative list and the subject teacher is free to design his/her own list of experiments based on
the syllabus of Assembly Language Programming (3IT04). Study experiments are highly discouraged.
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
Following list is an indicative list and the subject teacher is free to design his/her own list of experiments based on
the syllabus of Analog & Digital Circuits (3IT05)
1) To study the input and output characteristics of transistor connected in Common Emitter (CE) configuration.
2) Implementation of Op-amp as an inverting amplifier.
3) Implementation of Op-amp as a non-inverting amplifier.
4) Study of Astable Multivibrator using IC 555 and find the frequency of output square wave.
5) To study and verify the Truth Table of different Logic gates using TTL ICs (7400, 7402, 7404, 7408, 7427, 7432,
7486 etc.).
6) Study and verify the truth table of Half adder and Full adder using logic gates.
7) Study and verify the truth table of Half Subtractor and Full Subtractor using logic gates
8) Implementation of 4bit parallel adder using IC-7483 .
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 297
--------------------------------------------------------------------------------------------------------------------------------------------
9) Study the working of Multiplexer using one of the ICs like 74151A, 74152, 74153, 74157.
10) Study the working of De-Multiplexer and Decoder using one of the ICs like74138,74154,74156
11) Study the working and Verification of truth table of SR, JK, T and D Flip Flops.
12) Implementation of 3 bit asynchronous counter using JK Flip Flop.
13) Implementation of 3 bit Shift Register using D Flip Flop.
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
This practical lab must cover the following aspects for Python:
1. Basics for python programming that consists of the study of various data types in Python,
implementation of control structures and loops, functions (pre-defined and user defined), file handling
commands and functions.
2. The lab must also cover the concepts related to networking using python.
3. OOP concepts study and its programming using python libraries.
4. The lab must cover the part of UI deigning using python (Django, Flask, etc.).
5. The plotting of graphs using various libraries such as (matplotlib, seaborn, etc.).
6. The lab must also give a brief introduction regarding the a concept of machine learning or a learning
algorithm implementation.
7. An introduction to the data science track can be given by conducting and including an experiment on
data manipulation using (Numpy, Pandas, etc.)
The following list is an indicative list and the subject teacher is free to design his/her own list of experiments based
on Python, R etc.
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
SEMESTER - IV
Course Objectives :
How Computer Systems work & the basic principles.
Instruction Level Architecture and Instruction Execution.
The current state of art in memory system design.
How I/O devices are accessed and its principles.
To provide the knowledge on Instruction Level Parallelism.
To impart the knowledge on micro programming.
Concepts of advanced pipelining techniques.
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 298
--------------------------------------------------------------------------------------------------------------------------------------------
Course outcomes :
Ability to understand the basic structure of computer including functional units, addressing modes, stacks,
queues, subroutines, etc.
Ability to understand the basic processing unit of computer, execution of a complete instruction.
Ability to understand about input/output organization of computer including interrupt, DMA, buses,
interfaces, etc.
Ability to understand the concepts of RAM, ROM, cache memory, virtual memory.
Ability to understand number representation, Booth's algorithm, different peripheral devices.
Unit-I Basic structure of computer: hardware & software, program sequencing. concept of memory
locations & address. Main memory operation. instructions & instruction sequencing. Addressing
modes. basic I/O operations. Stacks. queues & subroutines.
Unit-II Processing Unit: fundamental concepts. execution of a complete instruction. hardwired control,
performance consideration. Micro-programmed control; microinstructions.
Unit-III I/O organization: accessing I/O devices, interrupts, direct memory access, bus arbitration:
centralized and distributed. I/O hardware: processor bus (Synchronous & Asynchronous).
Unit-IV Memory Unit: basic concepts, semiconductor RAM memories, internal organization, static &
dynamic RAMs, ROMs. speed, size & cost considerations.
Unit-VI Arithmetic; number representation. Design of fast adders, signed addition and subtraction.
Multiplication of positive numbers, sequential multiplication, fast multiplication, Booths’
algorithm for multiplication, integer division, restoring and non-restoring division.
Text-Books:
1. “Computer Organization” 5th Edition by V.Carl Hamacher & S.Zaky, McGraw-Hill (ISE).
2. “Computer Organization and Architecture: Designing for Performance”, 10th Edition by William Stallings,
Pearson Education.
References:
1. “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition by David A. Patterson
and John L. Hennessy, Elsevier.
2. “Computer Architecture and Organization”, 3rd Edition by John P. Hayes, WCB/McGraw-Hill.
3. Design and Architecture”, 2nd Edition by Vincent P. Heuring and Harry F. Jordan, Pearson Education.
4. “Structured Computer Organization”, 5th Edition by Tenanbaum A.S., Pearson Education.
Course Objectives :
Course Outcomes :
Text Books:
1. Fourauzan B., "Data Communications and Networking", 5th Edition, Tata McGraw-Hill, Publications.
2. Andrew S. Tenenbaum, “Computer Networks”, PHI, ISBN 81-203-2175-8.
Reference Books:
1. William Stallings, “Data & Computer Communications”, (6/e) Pearson Education.
2. Wehrle, Klaus, Gunes, Mesut, Gross, James, "Modeling and Tools for Network Simulation", Springer,
ISBN: 978-3-642-12330-6
3. J.Freey, “Computer Communication & Networks”, AEW Press.
4. Bhushan Trivedi, “Computer Networks” OXFORD.
Unit I :
Introduction: Operating System (OS definition),OS Evolution, OS Services, Process Concept ,Process Scheduling
,Operations on Processes, Cooperating & Inter-process Communication, Threads: Multithreading Models, Threading
Issues ,Java Threads. (6 Hrs)
Unit II : CPU Scheduling: Concepts, Scheduling Criteria, Scheduling Algorithms, Process Synch.: The Critical
Section Problem ,Synchronization Hardware, Semaphores, Monitors. ( 6 Hrs)
Unit III : Deadlocks: Definition& Characterization. Deadlock Avoidance, Deadlock Detection, Recovery from
Deadlock. Memory Management: Background, Swapping, Contiguous Memory Allocation schemes ,Paging,
Segmentation. (6 Hrs)
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 300
--------------------------------------------------------------------------------------------------------------------------------------------
Unit IV : Virtual Memory: Background, Demand Paging, Process Creation, Page Replacement policies, Allocation
of Frames, Thrashing. (6 Hrs)
Unit V : File-System Interface: Directory Structure, File-System Mounting, File Sharing, Protection, File-System
Structure, File-System Implementation, Directory Implementation, Allocation Methods Free-Space Management,
File Recovery. ( 6 Hrs)
Unit VI: I/O Systems: Overview, I/O Hardware, Application I/O Interface , Kernel I/O Subsystem, Transforming
I/O to Hardware Operations. Disk Scheduling ,Disk Management ,Swap-Space Management ,RAID Structure.
(6 Hrs)
Text Book:
Avi Silberschatz, P.B.Galvin, G.Gagne: “Operating System Concepts” (6th Edn) John Wiley & Sons Publication.
Reference Books:
1. A.S Tanenbaum “Modern Operating Systems” Pearson Education.
2. William Stallings “Operating Systems” Prentice-Hall.
3. D M Dhamdhere “Operating Systems” Tata McGraw-Hill.
Course Outcomes :
Define fundamental features of array, linked-list, stack, queue, tree and graph
Write the algorithms to perform various operations such as: Search, Insertion, Deletion, Sort etc
Implement algorithms for various operations on linear and non-linear data structure
Classify the linear data structures such as Array, Linked-List, Stack, Queue and non-linear data Structures such
as Tree and Graph with their applications
Implement linear data structures: Array, Linked-list, Stack, Queue using suitable language C,C++
Implement non-linear data structure: Tree, Graph using C or C++
know different types of sorting methods and their algorithms
Choose appropriate algorithm for Searching 9: Perform operations of traverse, insertion, deletion.
UNIT I :
Algorithms and Linear Data Structure: Array Introduction: Data, Data Structure and their types. Algorithm and their
Complexity, String processing operations, Pattern matching algorithms: fast and slow. Array: Types of array,
memory representation of array, Algorithm and operations on Array: traversing, searching, insertion, deletion.
Applications (7 Hrs)
UNIT II:
Algorithms and Linear Data Structure: Linked List (LL) Linked List: Features, Representation of Linked List in
memory using array, Types of LL, Algorithms and operations onto LL: traversing, insertion, deletion, searching &
their implementation, Applications (5 Hrs)
UNIT III
Linear Data Structure: Stack and Queue Stack: Definition, Memory representation of Stacks using array and Linked
List. Operations on to Stack: Push and Pop. Stack Applications: Recursion, Solve arithmetic expressions, tower of
Hanoi etc. Queue: Definition, Memory representation of Queue using array and Linked List, Types of queue,
Operations on queues: Traversing, Insertion, Deletion, Searching. Applications (6 Hrs)
UNIT IV
Sorting, Sorting Methods and its Algorithms Simple Sorting Algorithms, Bubble Sort, Quick Sort, Insertion Sort,
Selection Sort, Heap Sort, Merge Sort, Bucket Sort and their Applications. (6 Hrs)
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 301
--------------------------------------------------------------------------------------------------------------------------------------------
UNIT V :
Non-Linear Data Structure: Tree Trees: Terminology, Types, Binary trees and their representation in memory,
traversing in binary trees using stacks. Binary Search Trees, searching, inserting and deleting nodes in binary trees,
Heap tree, Path length & Huffman’s algorithm, Spanning Trees, Basic concepts of Kruskal’s and Prim’s Algorithm,
B+ tree. (6 Hrs)
UNIT VI :
Non-Linear Data Structure: Graph Graph: Definitions, Sequential and Linked-list representation of Graphs,
Warshalls’ algorithm, Bridges in graph, Johnsons algorithm. Graph Traversals: Breadth First Search, Depth First
Search, Topological Sort, Shortest Path Algorithms: Unweighted Shortest Paths, Basic concepts of Dijkstra’s
Algorithm. (6 Hrs)
Text Books:
1. Mark Allen Weiss, ‘Data Structures and Algorithm Analysis in C++’, 3/e, Florida International University, ISBN
0-321-37531-9
2. Seymour Lipschutz, ‘Theory & Problems of Data Structures’, Schaum’s Outline Series (Mc Graw-Hill)
International Editions.
Reference Books:
1. John Hubbard: ‘Schaum’s Outline DataStructure with C++’, ISBN-13: 978-0071353458
2. Jean-Paul Tremblay, Paul G. Sorenson, P. G. Sorenson, ‘An Introduction to Data Structures With Applications’,
(McGraw-Hill Computer Science Series), ISBN-13: 978-0070651579
3. Ellis Horowitz, Sartaj Sahni, Rajasekaran , ‘Computer Algorithms/C++’, 2nd edition, 2019.
SECTION - A
Unit I : Study of Social Science : Importance to Engineer, salient features of Indian constitution. Fundamental
Rights and Duties. Directive Principles of State Policy. (8)
Unit II : Indian Parliament : Composition and powers, President of India : Election and Powers. Council of
Ministers and Prime Minister (8)
Unit III : Impact of Science and Technology on culture and Civilization. Human Society: Community Groups.
Marriage and Family: Functions, Types and problems. (8)
SECTION - B
Unit IV: Production : Factors of production, Laws of return, Forms of Business Organisation. (8)
Unit V : Banking : Functions of Central and Commercial Banks. Introduction to GST, Market : Forms, perfect,
imperfect competition and monopoly. (8)
Unit VI: Nature and scope of Economics : Special significance of Economics to Engineers. Economics of
Development : Meaning, Characteristics of under development, obstacles to Economic growth and vicious circle of
poverty. (8)
Books Recommended :
1. Pylee M.V. : Constitutional Govt. in India, S.Chand and Co.
2. C N Shankar Rao: Sociology, S.Chand and Co.
3. Dewett and Varma J.D. : Elementary Economic Theory, S.Chand and Co.
4. A.N.Agrawal : Indian Economy, Problem of Development and Planning (Wiley Eastern Ltd), New Delhi.
5. S.K.Mishra : Indian Economy, Its Development Experience. Himalaya Pub.House, Bombay.
6. E.Kuper : Economics of W.R. Development, McGraw Hill Co.,
7. Brij Kishore Sharma. : The Constitution of India, PHI.
8. Mahajan : The Constitution of India, S.Chand, New Delhi.
9. Maclaver and Page : Principle of Sociology.
10. Davis K. : Human Society
11. Datt R.K. : Indian Economy, S.Chand and Comp. New Delhi P.M.Sundharam
12. Dhingra I.C. : Indian Economy
13. Jemes L.E., R.R.Lee : Economics of W.R.Planning, McGraw Hill Co.
--------------------------------------------------------------------------------------------------------------------------------------------
SANT GADGE BABA AMRAVATI UNIVERSITY GAZETTE - 2020 - PART TWO - 302
--------------------------------------------------------------------------------------------------------------------------------------------
4IT06 DATA COMMUNICATION & NETWORKING - LAB
Following list is an indicative list and the subject teacher is free to design his/her own list of experiments
based on the syllabus of Data Communication & Networking Lab (4IT02)
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
Following list is an indicative list and the subject teacher is free to design his/her own list of experiments based on
the syllabus of Operating System (4IT03)
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
Following list is an indicative list and the subject teacher is free to design his/her own list of experiments based on
the syllabus of Data Structure (4IT04)
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
The following list is an indicative list and the subject teacher is free to design his/her own list of experiments based
on Raspberry Pi with Adrino etc.
Students are advised to explore the Virtual Labs Developed by Ministry of Human Resource Development
Government of India available at http://www.vlab.co.in/broad-area-computer-science-and-engineering
REFERENCE BOOKS:
************