SYLLABUS

BCS301 DATA STRUCTURE

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by
CO 1 K1, K2
the algorithms and their common applications.
CO 2 Discuss the computational efficiency of the sorting and searching algorithms. K2

CO 3 Implementation of Trees and Graphs and perform various operations on these data structure. K3
Understanding the concept of recursion, application of recursion and its implementation and removal
CO 4 K4
of recursion.
Identify the alternative implementations of data structures with respect to its performance to solve a
CO 5 K5, K6
real world problem.

DETAILED SYLLABUS 3-1-0

Proposed
Unit Topic
Lecture
Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C.
Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations:
Big Oh, Big Theta and Big Omega, Time-Space trade-off. Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row
I Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D,3-D and 08
n-D Array Application of arrays, Sparse Matrices and their representations.
Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists,
Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion,
Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single
variable & Two variables Polynomial.
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions,
II Evaluation of postfix expression, Iteration and Recursion- Principles of recursion, Tail
recursion, Removal of recursion Problem solving using iteration and recursion with 08
examples such as binary search, Fibonacci numbers, and Hanoi towers. Tradeoffs
between iteration and recursion.
Queues: Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues,
Array and linked implementation of queues in C, Dequeue and Priority Queue.
Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary
III Search. Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: 08
Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.

Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array
IV Representation and Pointer(Linked List) Representation, Binary Search Tree, Strictly
Binary Tree ,Complete Binary Tree . A Extended Binary Trees, Tree Traversal algorithms: 08

Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal,
Operation of Insertation , Deletion, Searching & Modification of data in Binary Search .
 Threaded Binary trees, Traversing Threaded Binary trees. Huffman coding using Binary
Tree. Concept & Basic Operations for AVL Tree , B Tree & Binary Heaps

Graphs: Terminology used with Graph, Data Structure for Graph Representations:
Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and
V Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning 08
Trees: Prims and Kruskal algorithm. Transitive Closure and Shortest Path algorithm:
Warshal Algorithm and Dijikstra Algorithm.

Text books:

1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C++”, PHI Learning
Private Limited, Delhi India.
2. Gilberg ,Forouzan, Data Structures: A Pseudocode Approach with C 3rd edition , Cengage Learning publication.
3. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
4. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
5. Thareja, “Data Structure Using C” Oxford Higher Education.
6. AK Sharma, “Data Structure Using C”, Pearson Education India.
7. Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
8. Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures and Algorithms in C++”,
Wiley India.
9. P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication.
10. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education.
11. Berztiss, AT: Data structures, Theory and Practice, Academic Press.
12. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”,
McGraw Hill.
13. Adam Drozdek “Data Structures and Algorithm in Java”, Cengage Learning
BCS302 COMPUTER ORGANIZATION AND ARCHITECTURE
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

CO 1 Study of the basic structure and operation of a digital computer system. K 1, K2
Analysis of the design of arithmetic & logic unit and understanding of the fixed point and floating-point
CO 2 K2, K4
arithmetic operations.
CO 3 Implementation of control unit techniques and the concept of Pipelining K3
CO 4 Understanding the hierarchical memory system, cache memories and virtual memory K2
CO 5 Understanding the different ways of communicating with I/O devices and standard I/O interfaces K2, K4

DETAILED SYLLABUS 3-1-0

Unit Topic Proposed
Lecture
Introduction: Functional units of digital system and their interconnections, buses, bus architecture,
I 08
types of buses and bus arbitration. Register, bus and memory transfer. Processor organization,
general registers organization, stack organization and addressing modes.
Arithmetic and logic unit: Look ahead carries adders. Multiplication: Signed operand multiplication,
II Booths algorithm and array multiplier. Division and logic operations. Floating point arithmetic 08
operation, Arithmetic & logic unit design. IEEE Standard for Floating Point Numbers
Control Unit: Instruction types, formats, instruction cycles and sub cycles (fetch and execute etc),
III micro operations, execution of a complete instruction. Program Control, Reduced Instruction Set
08
Computer, Pipelining. Hardwire and micro programmed control: micro programme sequencing,
concept of horizontal and vertical microprogramming.
Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory
IV organization. ROM memories. Cache memories: concept and design issues & performance, address 08
mapping and replacement Auxiliary memories: magnetic disk, magnetic tape and optical disks
Virtual memory: concept implementation.
Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt hardware, types of
V interrupts and exceptions. Modes of Data Transfer: Programmed I/O, interrupt initiated I/O and 08
Direct Memory Access., I/O channels and processors. Serial Communication: Synchronous &
asynchronous communication, standard communication interfaces.
Text books:
1. Computer System Architecture - M. Mano
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, McGraw-Hill, Fifth Edition, Reprint 2012
3. John P. Hayes, Computer Architecture and Organization, Tata McGraw Hill, Third Edition, 1998. Reference books
4. William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson Education, Seventh edition, 2006.
5. Behrooz Parahami, “Computer Architecture”, Oxford University Press, Eighth Impression, 2011.
6. David A. Patterson and John L. Hennessy, “Computer Architecture-A Quantitative Approach”, Elsevier, a division of reed India
Private Limited, Fifth edition, 2012
7. Structured Computer Organization, Tannenbaum(PHI)
BCS303 DISCRETE STRUCTURES & THEORY OF LOGIC

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

CO 1 Acquire Knowledge of sets and relations for solving the problems of POSET and lattices. K3, K4
Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical
CO 2 K1, K2
abilities.
CO 3 Employ the rules of propositions and predicate logic to solve the complex and logical problems. K3
Explore the concepts of group theory and their applications for solving the advance technological
CO 4 K1, K4
problems.
CO 5 Illustrate the principles and concepts of graph theory for solving problems related to computer science. K2, K6

DETAILED SYLLABUS 3-1-0

Unit Topic Proposed
Lecture
Set Theory& Relations: Introduction, Combination of sets. Relations: Definition, Operations on
relations, Properties of relations, Composite Relations, Equality of relations, Recursive definition
I of relation, Order of relations. 08
POSET & Lattices: Hasse Diagram, POSET, Definition & Properties of lattices – Bounded,
Complemented, Distributed, Modular and Complete lattice.

Functions: Definition, Classification of functions, Operations on functions. Growth of Functions.

II
Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation 08
of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps.

Theory of Logics: Proposition, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of

III proposition, Theory of Inference. Predicate Logic: First order predicate, well- formed formula of
08
predicate, quantifiers, Inference theory of predicate logic.

Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability,
IV Contradiction, Algebra of proposition, Theory of Inference. 08
Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference
theory of predicate logic.
V Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs,
Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph 08
coloring
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle
Text books:
1. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill,
2006.
2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
3. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
4. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
5. Liptschutz, Seymour, “ Discrete Mathematics”, McGraw Hill.
6. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill. 4. Deo,
7. Narsingh, “Graph Theory With application to Engineering and Computer.Science.”, PHI.
8. Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi