| COURSE OPTER | COURSE NAME | MARKS | CREDITS |
|---|---|---|---|
| Ability Enhancement Course-I | English | 100 | 4 |
| Core Course-I | Programming using C | 100 | 4 |
| Core Course-I Practical | C LAB | 50 | 2 |
| Core Course-II | Computer Organization | 100 | 4 |
| Core Course-II LAB | Practical Computer Organization | 50 | 2 |
| Generic Elective-I | Discrete Structures | 100 | 4 |
| Generic Elective-I | Practical Discrete Structures LAB | 50 | 2 |
ENGLISH
UNIT-I
Short Story: Jim Corbett-The Fight between Leopards; Dash Benhur- The Bicycle Dinanath Pathy- George V High School; Alexander Baron- The Man who knew too much; Will F Jenkins- Uneasy Homecoming.UNIT-II
Prose: C V Raman-Water- The Elixir of Life; Harold Nicolson- An Educated Person; Cla ire Needell Hollander- No Learning without Feeling; Steven Harvey- The Empty Page; S antosh Desai-Emoji Disruption.UNIT-III
Comprehension of a passage from any of the prescribed pieces and answering the questions.UNIT-IV
Expanding an idea into a paragraph.UNIT-V
Language exercises-test of vocabulary, usage and grammar based on the prescribed pi eces Prescribed Text The Widening Arc: A Selection of Prose and Stories. Ed. Asim R Parhi, S Deepika and Pulastya Jani. Kitab Bhavan, Bhubaneswar. 2016.Suggested Reading:
Fluency in English – Part II, OUP, 2006 Communicative English. E. Suresh Kumar and P. Sreehari.PROGRAMMING USING C
UNIT-I
Introduction to Programming Language, Introduction to C Programming , Character Set, C Tokens, Keywords & Identifiers, Constants, Variables, Data Types, Variables , Storage Classes, Operators (Arithmetic, Relational, Logical , Assignment, Increment & Decrement, Conditional , Bitwise), Expressions , Input and Output Operations.UNIT-II
Decision Making and Branching: Simple IF Statement, IF ….. ELSE Statement, Nesting IF …. ELSE Statement, ELSE IF Ladder, Switch Statement? Operator, GOTO Statement. Decision Making and Looping: The WHILE Statement, The DO Statement, The FOR Statement, Jumps in LOOPS. Arrays, Character Arrays and Strings.UNIT-III
User-defined Functions: Need, Elements & Definition, Function Calls, Function Definition, Category of Functions, Recursion. Structures and Unions: Defining, Declaring, Accessing, Initialization Structure, Arrays of Structures, Arrays within Structures, Structures and Functions, Unions.UNIT-IV
Pointers: Accessing the Address of a Variable, Declaring Pointer Variables, Initializations of Pointer Variable, Accessing a Variable through its Pointer, Chain of Pointers, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays,, Pointers and Character Strings, Array of Pointers, Pointers as Function Arguments, Functions Returning Pointers, Pointers to Functions, Pointers to Structures, Troubles with Pointers.UNIT-V
File Management in C: Defining and Opening a File, Closing a File, Input/ Output Operations on Files, Error Handling During I/O Operations, Random Access to Files, Command Line Arguments, Dynamic Memory Allocation.Recommended Books:
1. E. Balaguruswamy, “Programming in ANSI C”,4/e, (TMH).2. Paul Deitel, Harvey Deitel, "C: How to Program", 8/e, Prentice Hall.
3. J. R. Hanly, “Problem Solving & Program Design in C”, 7/e, Pearson.
4. B. Kernighan & D.M. Ritche, “The C Programming Language”, 2/e PHI.
COMPUTER ORGANIZATION
UNIT-I
Introduction: Organization and Architecture, Structure & Functions. Number Systems: The Decimal System, Positional Number Systems, The Binary System, Converting Between Binary and Decimal (Integers, Fractions), Hexadecimal Notation.UNIT-II
Computer Arithmetic: Arithmetic & Logic Unit, Integer Representation ( Sign-Magnitude, Twos Complement, Range Extension, Fixed Point Representation), Integer Arithmetic ( Negation, Addition and Subtraction, Multiplication, Division), Floating-Point Representation, (Principles, IEEE Standard for Binary Floating-Point Representation), Floating-Point Arithmetic (Addition and Subtraction, Multiplication and Division, Precision Considerations, IEEE Standard for Binary Floating-Point ArithmeticUNIT-III
Computer Evolution and Performance: History of Computers, Design for Performance ( Microprocessor Speed, Performance Balance, Improvements in Chip Organization & Architecture), Multicore, MICs, and GPGPUs, Intel x86 Architecture, Embedded Systems and the ARM, Performance Assessment ( Clock Speed and Instructions per Second, Benchmarks, Amdahl’s Law, Little’s Law.UNIT-IV
Digital Logic: Boolean Algebra, Gates, Combinational Circuits (Implementation of Boolean Functions, Multiplexers, Decoders, Read-Only Memory, Adders), Sequential Circuits (Flip-Flops, Registers, Counters), Programmable Logic Devices (PLA, FPGA).UNIT-V
Top-Level View of Computer Function and Interconnection: Computer Components, Computer Function (Instruction Fetch and Execute, Interrupts, I/O Function), Interconnection Structures, Bus Interconnection (Bus Structure, Multiple-Bus Hierarchies, Elements of Bus Design), Point-to-Point Interconnect (QPI Physical Layer, Link Layer, Routing Layer, & Protocol Layer), PCI Express (PCI Physical and Logical Architecture, PCIe Physical Layer, PCIe Transaction Layer, PCIe Data Link Layer).Text Book:
William Stallings.DISCRETE STRUCTURES
UNIT-I
Logic and Proofs: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Normal Forms, Proof Methods and Strategy, Mathematical Induction, Strong Induction and Well-Ordering, Recursive Definitions and Structural Induction, Recursive Algorithms.UNIT-II
Basic Structures: Sets, Set Operations, Functions, Recursive Functions, Sequences and Summations. Relations: Relations and their Properties, n-ary Relations and their Applications, Representing Relations, Closures of Relations, Equivalence Relations, Partial Ordering. Boolean.UNIT-III
Algebra: Boolean Functions, Representing Boolean Functions, Logic Gates, Minimization of Circuits. Algebraic Structures & Coding Theory: The Structure of Algebras, Semi-groups, Monoids and Groups, Homomorphism, Normal Subgroups, and Congruence Relations, Rings, Integral Domains and Fields, Quotient and Product Algebras, Coding Theory. Polynomial Rings and Polynomial Codes.UNIT-IV
Counting: Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients, Generalized Permutations and Combinations, Generating Permutations and Combinations. Advanced Counting Techniques, Applications of Inclusion-Exclusion, Discrete probability, Conditional probability, Bayes’ Theorem.UNIT-V
Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs, HavelHakimi Theorem, Representing Graphs and Graph Isomorphism, Connectivity, Cut- Sets, Euler and Hamiltonian Paths, Shortest-Path Problem, Planar Graphs, Graph Coloring, Network Flows.Recommended Books:
1. Kenneth H Rosen, Discrete Mathematics & Its Applications, McGraw-Hill. 7/e.2. J. L. Hein, Discrete Structures, Logic, and Computability, 3rd Edition, Jones and Bartlett Publishers, 2009 .
3. C.L. Liu , D.P. Mahopatra, Elements of Discrete mathematics, 2nd Edition , Tata McGraw Hill, 1985
4. M. O. Albertson and J. P. Hutchinson, Discrete Mathematics with Algorithms , John wiley Publication, 1988
No comments:
Post a Comment