Shadab Tughlaq

SHADAB TUGHLAQ Programming with C Lectures: 4 Hrs/week One paper: 100 marks 13 Hrs duration Term Work: 25 Marks

Practical: 3 Hrs/week Practical Exam: 50 Marks

1.

Introduction to Problem Solving: Flow Charts, Tracing Flow Charts, Problem Solving methods, Need for computer Languages, Sample Programs written in C

2.

C Language Preliminaries C character set, Identifiers and keywords, Data types, Declarations, Expressions. Statements and symbolic constants

3.

Input - Output getchar, Putchar, Scanf. Printf, gets, puts, functions.

4.

Pre Processor commands # Include, # Define, # ifdel

5.

Preparing and running a complete C program

6.

Operators and Expressions Arithmetic, Unary, Logical, Bit wise, Assignment, and Conditional Operators

7.

Control Statements While, do-while, for statements, nested loops, if else, switch, break, Continue, and goto statements, comma operators

8.

Storage Types Automatic, External, Register and static variables

9.

Functions: Defining and accessing, passing arguments, Function prototypes: Recursion, Library functions, Static Functions

10.

Arrays: Defining and processing, Passing arrays to a function, Multi Dimensional arrays.

11.

Strings: Defining and operations on strings

12.

Pointers: Declarations, Passing pointers to a function, Operations on pointers,

1/13

SHADAB TUGHLAQ Pointer Arithmetic, Pointers and arrays, Arrays of pointers function Pointers 13.

Structures: Defining and processing, Passing to a function, Unions, typedef, array of structure, and pointer to a structure.

14.

File Structures: Definitions, concepts of record, file operations: Storing, creating, Retrieving, Updating Sequential, relative, indexed and random access mode. Files with binary mode (Low level), performance of Sequential Files, Direct mapping techniques: Absolute; relative and indexed sequential files (ISAM) concept of index, levels of index, and overflow of handing.

File Handling: File operation: creation, copy, delete, update, text file, and binary file Term work / Practical: Each candidate will submit a journal in which at least 12 practical assignments based .on the above syllabus along with the flow chart and program listing will be submitted with the internal test paper. Test graded for 10 marks and Practical graded for 15 marks.

List of Practical: Two Programs based on functions Two programs based on pointers. Four programs based on remaining portion e.g. control statements, Structure and Unions etc. Three programs based on Different File Operations (File Handling)

References: 1. Mastering C by Venugopal, Prasad -TMH 2. Complete Reference With C Tata McGraw hill 3. C- Programming E.Balagurusamy Tata McGraw Hill 4. How to solve it by Computer. : Dromey PHI, 5. Schaums Outline of Theory and Problems of programming with C: Gottfried. 6. The C programming Language: Keminghan and. Ritchie. 7. Programming in ANSI C: Ramkumar Agarwal 8. Mastering C by Venugopal, Prasad -TMH 9. Let us C by kanetkar 10. An Introduction to data structures with applications Jean – Paul Trembly and Paul Sorenson. 2nd Edition (1984)

2/13

SHADAB TUGHLAQ System Analysis And Design Lectures: 4 Hrs/week One paper: 100 marks / 3 Hrs duration

Tutorial: - 1 Hr/week Term Work: 25 Marks

1.

Introduction a. Systems & computer based systems, types of information system b. System analysis & design c. Role, task & Attribute of the system analyst

2.

Approaches to system development a. SDLC b. Explanation of the phases c. Different models their advantages and disadvantages i. Waterfall approach ii. Iterative approach iii. Extreme programming iv. Rad model v. Unified process vi. Evolutionary software process model 1. Incremental model 2. Spiral model vii. Concurrent development model

3.

Analysis: investigating system requirements a. Activities of the analysis phase b. Fact finding methods i. Review existing reports, forms and procedure descriptions ii. Conduct interviews iii. Observe & document business. Processes iv. Build prototypes v. Questionnaires vi. Conduct jad sessions c. Validate the requirements i. Structured walkthroughs

4.

Feasibility Analysis a. Feasibility study and cost estimates b. Cost benefit analysis c. Identification of list of deliverables

5.

Modeling system requirements a. Data flow diagrams logical and physical b. Structured English c. Decision tables d. Decision trees e. Entity relationship diagram

3/13

SHADAB TUGHLAQ 6.

Design a. Design phase activities b. Develop system flowchart c. Structure chart i. Transaction Analysis ii. Transform analysis d. Software design and documentation tools i. Hipo Chart ii. Warnier orr diagram e. Designing databases i. Entities ii. Relationships iii. Attributes iv. Normalization

7.

Designing input, output & user interface a. Input design b. Output design c. User interface design

8.

Testing a. Strategic approach to software testing. b. Test strategies for conventional software. c. Test strategic for object-oriented software d. Validation testing e. System testing f. Debugging

9.

Implementation & maintenance a. Activities of the implementation & support phase

10.

Documentation a. Use of case tools b. Documentation Importance c. Types of Documentation

Books: 1. "Analysis and Design of Information Systems: Senn, TMH 2. System Analysis and Design”: Howryskiewycz., PHI 3. "System Analysis and Design”: Awad 4. "Software Engineering A Practitioners Approach": Roger S. Pressman TMH 5. "System Analysis and Design Methods": Whitten Bentley 6. "Analysis and Design of Information Systems": Raja Raman, PHI

4/13

SHADAB TUGHLAQ Computer Organization & Architecture Lectures: 4 Hrs/week One paper: 100 marks / 3 Hrs duration 1.

DIGITAL LOGIC. a. Boolean Algebra b. Gates c. Combinatorial Circuits. i. Implementation of Boolean Functions 1. Algebraic Simplification 2. Kanaugh maps ii. Multiplexes / Demultiplexers iii. Decoders I Encoders iv. Adders: Half, Full d. Sequential Circuits i. Flip- Flops: S-R, J-K, and D ii. Registers: Parallel, Shift iii. Counters: Ripple, iv. Synchronous

2.

THE COMPUTER SYSTEM a. Computer function and Interconnection i. Computer functions ii. Interconnection Structures iii. Bus Interconnection b. Memory System Design i. Memory hierarchy and SRAM ii. Advanced DRAM Organization iii. Interleaved memory, Associative memory iv. Nonvolatile memory v. RAID c. Cache Memory i. Cache memory Principles ii. Elements of Cache design iii. Improving Cache Performance d. Input I Output i. External devices ii. I/O modules iii. Programmed I/O iv. Interrupt-driven I/0. v. Direct Memory Access vi. I/O Channels and Processors

3.

CENTRAL PROCESSING UNIT a. Instruction Set: characteristics & functions i. Machine Instruction characteristics

5/13

Tutorial: - 1 Hr/week Term Work: 25 Marks

SHADAB TUGHLAQ

b. c.

d. e.

4.

5.

ii. Type of Operands iii. Types of Operations Instruction Set: addressing modes & formats i. Addressing ii. Instruction Formats CPU structure and Function i. Processor Organization ii. Register Organization iii. Instruction Cycle iv. Instruction Pipeline RISC Instruction Level Parallelism and Super scalar Processors i. Super scalar versus super pipelined ii. Limitations iii. Instruction level parallelism and machine parallelism iv. Instruction issue policy v. Register Renaming vi. Branch Prediction vii. Super scalar Execution viii. Super scalar Implementation

CONTROL UNIT a. Control Unit Operation i. Micro-operations ii. Control of the processor iii. Hardwired Implementation b. Micro programmed Control c. Basic concepts

PARALLEL ORGANISATION a. Multiprocessor organizations i. Types of Parallel Processor Systems ii. Parallel organizations b. Symmetric Multiprocessors i. Organization c. Clusters i. Cluster Configurations ii. Cluster Computer Architecture References Books: 1. Digital Computer Fundamentals, Bartee C. Thomas, McGraw-Hill International Edition 2. Computer Architecture by Nicholas Carter, Schaum's outlines, McGrawHill 3. Advance Computer Architecture 2nd Edition By Parthasarthy , Thomson 4. Computer Organization by Hamacher C., Zaky S. McGraw Hill S. Computer Organization and Architecture: Stallings, W Prentice Hall of India, New Delhi 6. Computer Architecture, Behrooz Parhami, Oxford University Press 7. Computer Fundamentals Architecture & Organization B. Ram New Age 8. Computer Organization ISRD group Tata McGraw Hill

6/13

SHADAB TUGHLAQ Discrete Mathematics Lectures: 4 Hrs/week One paper: 100 marks 13 Hrs duration

7/13

Tutorial: 1 Hr/week Term Work: 25 Marks

1.

Number Systems a. Decimal Number Systems b. Binary number Systems. c. Hexadecimal Number System d. Octal Number System e. Binary Arithmetic

2.

Propositions and logical operations a. Notation, Connections, Normal forms, Truth Tables b. Equivalence and Implications c. Theory of inference for statement calculus, Predicate calculus d. Rules of Logic i. Mathematical Induction and Quantifiers

3.

Sets, Relations and Digraphs a. Review of set Concepts b. Relations and digraphs c. Properties of relations d. Equivalence relations e. Computer representation of relations and digraphs f. Manipulation of relations g. Partially Ordered Sets (Posets)

4.

Recurrence relations a. Towers of Hanoi b. Iterations c. Homogenous linear equations with constant d. Coefficients e. Particular Solution f. Difference table g. Finite order differences h. Line in a plane in general Position

5.

Groups and applications: i. Monoids, semi groups j. Product and quotients of algebraic structures k. Isomorphism, homomorphism, automorphism l. Normal subgroups, Codes and group codes

6.

Classification of Languages a. Overview of Formal Languages b. Representation of regular languages and grammar c. Finite state machines

SHADAB TUGHLAQ

Term work. Assignment: Each candidate will submit a journal in which at least 10 assignments based on the above syllabus and the internal test paper. Test will be graded for 10 marks and assignments graded for 15 marks

Books: 1. "Discrete Mathematical Structures” Tremblay and Manohar, Tata McGraw Hill 2. "Discrete Mathematics” 1st Edition by Maggard Thomson 3. "Discrete Mathematics” Semyour Lipschutz, Varsha patil 2nd Edition Schaum's Series TM I 4. "Discrete Mathematical Structures” Kolman, Busby and Ross, Prentice Hall India, Edition 3. 5. "Elements of Discrete Structures” C.L.Liu 6. "Computer Fundamentals" P.K. Sinha 7. "Discrete Mathematics and its application" – Rosen 8. “Discrete Mathematical Structures” G Shankar Rao, New Age 9. “Fundamental Approach to Discrete Mathematics” Acharjaya D. P. Sreekumar New Age

8/13

SHADAB TUGHLAQ

Principles of Economics and Management Lectures: 4 Hrs/week One paper: 100 marks / 3 Hrs duration

Tutorial: - 1 Hr/week Term Work: 25 Marks

1. Introduction to Managerial Economics a. Nature and Scope of Managerial Economics b. Economics theory and Managerial Economics c. Managerial Economist: Role and Responsibilities. 2. Demand: a. b. c. d.

Law of demand. Elasticity of demand Supply function, elasticity of Supply Market equilibrium.

3. Demand forecasting: a. Survey methods b. Evaluation of forecast accuracy. c. Cost Output relationship. Economies and Diseconomies of scale. d. Cost control and cost reduction. Break-even analysis. 4. Market structures: a. Perfect and imperfect competition b. Monopoly, Oligopoly c. Monopolistic Competition d. Price Discrimination e. Price and Output Decisions under different market structures. f. Government intervention in pricing. 5. Management. Functions a. Responsibilities of management to society b. Development of management thought c. Contribution of F.W. Taylor, Henri Fayol, Elton Mayo d. System contingency approaches to management 6. Nature of planning, decision-making process, management by objectives. 7. Organization structures: a. Functional. Product matrix b. Flat and vertical structures c. Authority relationships d. Decentralization and delegation of authority

9/13

SHADAB TUGHLAQ

8. Maslow Herzberg and MacGregor's theory of motivaation. a. McClellands achievement motivation b. Blanchard's situation leadership theory 9. Preventive maintenance: a. Quality control b. Total quality management c. Quality circles.

10.

Marketing: a. Understanding the concept of marketing mix b. Product policy c. New product development d. Product life cycle and new product development e. Channels of distribution f. Pricing, Advertising and product promotion. Policies g. Marketing research.

11.

Human resource management: a. Selection b. Training and appraisal c. Compensation administration.

Reference books: 1. Principals & Practice of Management: L.M.Prasad 2. Principals of Macroeconomics: Mankiw. Thomson 3. Managerial Economics Varshney Maheshwari, S.Chand 4. Managerial Economics Dean Joel PHI 5. Managerial Economics D.N Divedi, Vikas Publishing house. 6. Managerial Economics Naylor, Vernon. Wertz 7. Managerial Economics Rama Swamy. Nama Kumari 8. Essential of Management, Koontz 7th Edition 9. International marketing, Francis Cherunilam 10. HR & Personnel Management, Ashwathappa

10/13

SHADAB TUGHLAQ

Introduction to Web technology Lectures: 4 Hrs/week One paper: 100 marks 13 Hrs duration Term Work: 25 Marks

Practical: 3 Hrs/week Practical Exam: 50 Marks

1.

Introduction to the web a. History and Evolution b. Web Development Cycle c. Web publishing d. Web contents e. Static Web contents f. Dynamic Web Contents

2.

Languages and Technologies for Browsers a. HTML, DHTML, XHTML, ASP, JavaScript, b. Features and Applications

3.

Introduction to HTML a. HTML Fundamentals b. HTML Browsers c. HTML Tags, Elements and attributes d. Structure of HTML Code i. Head ii. Body e. Lists i. Ordered List ii. Unordered Lists iii. Definition List iv. Nesting List f. Block Level Tags i. Block Formatting, Heading, Paragraph, Comments ii. Text Alignment and font size g. Text Level Tags i. Bold Italic, Underlined, Strikethrough, Superscript 1. Subscript h. Inserting Graphics, Scaling Images i. Frameset j. Forms k. An Introduction to DHTML

4.

Cascading Style Sheets a. The usefulness of Style Sheets

11/13

SHADAB TUGHLAQ b. Creating Style Sheets c. Common Tasks with CSS d. Font family i. Font Metrics ii. Units e. Properties f. Classes and pseudo classes g. CSS tags 5.

Introduction to ASP a. Working of ASP page b. Variables c. ASP forms d. Date types e. Operators f. Object Hierarchies i. ASP Object Model g. Request response Object collections h. ASP Applications i. Creating Active Server Page Application ii. Session Object iii. Session Collections iv. Contents Collection v. Response Object Method

6.

JavaScript a. Introduction b. Operators. Assignments and Comparisons., Reserved Words c. Starting with JavaScript i. Writing first JavaScript program ii. Putting Comments d. Function e. Statements in JavaScript f. Working with Objects i. Object Types and object Instantiation ii. Date Object, Math Object, String Object, Event Object, Frame Object, Screen object g. Handling Events i. Event Handling Attributes ii. Window Events, Forn Events iii. Event Object iv. Event Simulation

7.

Website Design Concepts a. How the Website should be i. Basic rules of Web Page design

12/13

SHADAB TUGHLAQ ii. Types of Website Reference Books: 1. 2. 3. 4. 5. 6. 7.

Web Technologies Achyut S. Godbolc. Atul Kahate Tata McGraw Hill Web Tech. & Design C.Xavierv New Age Multimedia and Web Technology -Ramesh Bangia HTML: The Complete Reference - Thomas A. Powel HTML Examples Norman Smith, Edward ASP 3.0 Programmers Reference - Richard Anderson JavaScript Bible - Danny Goodman

List of Practical: 1. Create Web page and apply some block level tags, text level tags. 2. Create web page and apply background color, text color, horizontal rules and special characters 3. Create Web page and include ordered list, unordered list, definite list and Nested list 4. Create Web page and include links to a. Local page in same folder b. Page in different folder c. Page on the Web d. Specific location within document 5. Create Web page and include images with different alignment and wrapped text. 6. Create tables and format tables using basic table tags and different attributes. 7. Create a frameset that divides browser window into horizontal and vertical framesets. 8. Create Web page and apply style rules. 9. Create a Web page including control structures using JavaScript. 10. Programs based on Event Handling.

13/13