Bachelor of Technology (Computer Engineering) Scheme of studies / Examination

(Semester- 3) Sl. No

Course No.

Subject

Mathematics-III / Basics of Economics & Management Data Base Management Systems

Teaching Schedule

Examination Schedule (Marks)

Duration of Exam (Hours)

L 3

T 1

P -

Total 4

Theory 100

Sessional 50

Prac tical -

T 150

3

3

1

-

4

100

50

-

150

3

1

MATH-201E /HUM-201E

2

CSE-201 E

3

CSE-203 E

Data Structures

3

1

-

4

100

50

-

150

3

4

CSE-205 E

3

1

-

4

100

50

-

150

3

5

CSE-207 E

Discrete Structures Internet Fundamentals

3

1

-

4

100

50

-

150

3

6

ECE-203 E

Analog Comm.

3

1

-

4

100

50

-

150

3

7

IT-253 E

-

-

3 3

3 3

-

50 25

25 25

75 50

3 3

8

CSE-209 E

Internet Lab Data Base Management Systems Lab.

9

CSE-211 E

Data Structures Lab

-

-

3

3

-

50

25

75

3

10

ECE-207E

Analog Comm. Lab

-

-

2

2

-

25

25

50

3

18

6

11

35

600

450

100

1150

TOTAL

BASICS OF ECONOMICS & MANAGEMENT HUM – 201 E

Sessional

:

50

L

T

P

Theory

:

100

3

1

-

Total Duration of Exam.

: :

150 3 Hrs.

Mark s Mark s Mark s

UNIT-I

Meaning of Industrial Economic, Production Function, its types, Least Cost Combination, Law of Variable Proportion, Laws of Return – Increasing, Constant & Diminishing. Fixed & variable costs in short run & long run, opportunity costs, relation between AC & MC, Ushaped short run AC Curve. Price & Output Determination under Monopoly in short run & long run. Price Discrimination, Price Determination under Discriminating Monopoly. Comparison between Monopoly & Perfect Competition. UNIT – II

Meaning of Management, Characteristics of Management, Management Vs. Administration, Management – Art, Science & Profession, Fayol’s Principles of Management. Human Realtions Approach,Functions of Management UNIT – III

Planning & Organising Planning ,steps in planning,Planning premises ,difference b/w planning policy & strategy,Authority & Responsibility,Centralization & decentralization. UNIT – IV

Staffing,Directing & Controlling-Manpower planning,Recruitment & section styles,Leadership,Communication Process & barriers,Control process and steps in controlling TEXT BOOKS: 1. “Modern Economic Theory” Dewett, K.K., S. Chand & Co. 2. “Economic Analysis” K.P. Sundharam & E.N. Sundharam (Sultan Chand & Sons). 3. “Micro Economic Theory” M.L. Jhingan (Konark Publishers Pvt. Ltd.). 4. “Principles of Economics” M.L. Seth (Lakshmi Narain Aggarwal Educational Publishers – Agra). 5. “An Introduction to Sociology”, D.R. Sachdeva & Vidya Bhusan. 6. “Society – An Introductory Analysis”, R.M. Maclver Charles H. Page. 7. “Principles and Practices of Management: R.S. Gupta; B.D. Sharma; N.S. Bhalla; Kalyani. REFERENCE BOOKS 1. “Organization and Management: R.D. Aggarwal, Tata McGraw Hill. 2. Business Organization and Management: M.C. Shukla Note : Eight questions are to be set taking two from each unit. The students are required to attempt five questions in all, taking at least one from each unit. PIET-CSE-III

MATH-201 E

MATHEMATICS - III

L

T

P

Theory

:

3

1

-

Sessional

:

Total : Duration of Exam

Mark 100 s Mark 50 s Mark 150 s : 3 Hrs.

UNIT – I Fourier Series : Euler’s Formulae, Conditions for Fourier expansions, Fourier expansion of functions having points of discontinuity, change of interval, Odd & even functions, Half-range series. Fourier Transforms : Fourier integrals, Fourier transforms, Fourier cosine and sine transforms. Properties of Fourier transforms, Convolution theorem, Perseval’s identity, Relation between Fourier and Laplace transforms, Fourier transforms of the derivatives of a function, Application to boundary value problems. UNIT-II Functions of a Complex Variables: Functions of a complex variable, Exponential function, Trigonometric, Hyperbolic and Logarithmic functions, limit and continuity of a function, Differentiability and analyticity. Cauchy-Riemann equations, Necessary and sufficient conditions for a function to be analytic, Polar form of the Cauchy -Riemann equations, Harmonic functions, Application to flow problems, Conformal transformation, Standard transformations (Translation, Magnification & rotation, inversion & reflection, Bilinear). UNIT-III Probability Distributions: Probability, Baye’s theorem, Discrete & Continuous probability distributions, Moment generating function, Probability generating function, Properties and applications of Binomial, Poisson and normal distributions. UNIT-IV Linear Programming: Linear programming problems formulation, Solution of Linear Programming Problem using Graphical method, Simplex Method, Dual-Simplex Method. Text Book 1. Higher Engg. Mathematics: B.S. Grewal 2. Advanced Engg. Mathematics: E. Kreyzig Reference Book 1. Complex variables and Applications : R.V. Churchil; Mc. Graw Hill 2. Engg. Mathematics Vol. II: S.S. Sastry; Prentice Hall of India. 3. Operation Research : H.A. Taha 4. Probability and statistics for Engineer: Johnson. PHI. Note : Examiner will set eight question, taking two from each unit. Students will be required to attempt five questions taking at least one from each unit.

PIET-CSE-III

CSE-201 E Database Management Systems L

T

P

Sessional:

50

Marks

3

1

-

Exam:

100

Total:

150

Mark s Mark s

Duration of Exam: 3 Hrs. Unit–1:Introduction Overview of database Management System; Various views of data, data Models, Schemes, Introduction to Database Languages & Environments. Advantages of DBMS over file processing systems, Responsibility of Database Administrator, Three levels architecture of Database Systems, : Introduction to Client/Server architecture. Data Models : E-R Diagram (Entity Relationship), mapping Constraints, Keys, Reduction of E-R diagram into tables, Naming Secondary Storage Devices. Network & Hierarchical Model. Unit-2: File Organisation: Sequential Files, index sequential files, direct files, Hashing, B- trees Index files, Inverted Lists. Relational Model, Relational Algebra & various operations (set operations, select, project, join, division), Order, Relational calculus: Domain, Tuple. Well Formed Formula, specifications, quantifiers. Unit-3: Introduction to Query Languages : QBE, integrity constraints, functional dependencies & Normalization th

(Normal forms- up to 5 Normal forms). Unit-4: Introduction to Distributed Data processing, Object Oriented Data Base Management Systems parallel Databases, data mining & data warehousing, Concurrency control : Transaction, Timestamping, Lock-based Protocols, serializability and Recovery Techniques.

Text Books: • •

Database System Concepts by A. Silberschatz, H.F. Korth and S. Sudarshan, 3 McGraw-Hill, International Edition. Introduction to Database Management system by Bipin Desai, 1991, Galgotia Pub.

rd

edition, 1997,

Reference Books: rd

•

Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 3 Wesley, Low Priced Edition.

• •

An Introduction to Database Systems by C.J. Date, 7 edition, Addison-Wesley, Low Priced Edition, 2000. nd Database Management and Design by G.W. Hansen and J.V. Hansen, 2 edition, 1999, Prentice-Hall of India, Eastern Economy Edition. th Database Management Systems by A.K. Majumdar and P. Bhattacharyya, 5 edition, 1999, Tata McGraw-Hill Publishing. A Guide to the SQL Standard, Date, C. and Darwen,H. 3rd edition, Reading, MA: 1994, Addison-Wesley. Data Management & file Structure by Looms, 1989, PHI

• • •

edition, 2000, Addision-

th

Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.

PIET-CSE-III

CSE-203 E L T 3 1

DATA STRUCTURES P Sessional: 50 Marks Exam: 100 Marks Total: 150 Marks Duration of Exam: 3 Hrs. Unit-1: Introduction: Introduction to Data Structures: Definition & abstract data types, Static and Dynamic implementations, Examples and real life applications; built in and user defined data structures, Ordered list and Operations on it. Arrays: Definition, implementation, lower bound, upper bound, addressing an element at a particular index for one dimensional arrays, Two dimensional arrays and Multi-dimensional arrays. Implementation of Data Structures like structure/ Record, Union,Sparse matrices: implementation of transpose. Stacks: Sequential implementation of stacks, operations, Polish-notations, Evaluation of postfix expression, Converting Infix expression to Prefix and Postfix expression, Applications. Unit-2: Queues: Definition, Sequential implementation of linear queues, Operations. Circular queue: implementation (using arrays), Advantage over linear queue, Priority queues & Applications. Linked Lists :Need of dynamic data structures, continuous & linked implementation of lists. Operations on lists. Dynamic implementation of linked lists, Operations. Comparison between Array and Dynamic Implementation of linked list. Linked implementation of stacks and queues. Circular lists, implementation of primitive operations. Doubly linked lists: continuous & dynamic implementation, operations. Unit-3: Trees: Definition, Basic terminology, Binary tree, Array and Dynamic Implementation of a binary tree, primitive operations on binary trees. External and internal nodes. Binary tree traversals : preorder, inorder and postorder traversals. Representation of infix, postifix and prefix expressions using trees. Representation of lists as binary trees.Introduction to Binary Search Trees, B trees, B+ trees , AVL Trees, threaded trees, balanced multi way search trees, Unit- 4: Graphs : Definition of undirected & Directed Graphs & Networks, Basic terminology, Representation of graphs,. Graph traversals and spanning forests, minimum-spanning trees, computer representation of graphs. Tables: Definition, Hash Functions, Implementation & Applications. Sorting & Searching: Basic Searching techniques (Linear & binary), Introduction to Sorting. Sorting using selection, insertion, bubble, merge, quick, radix, heap sort. Text Book: • Data Structures using C by A. M. Tenenbaum, Langsam, Moshe J. Augentem, PHI Pub. Reference Books: • Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman, Original edition, AddisonWesley, 1999, Low Priced Edition. • Fundamentals of Data structures by Ellis Horowitz & Sartaj Sahni, Pub, 1983,AW • Fundamentals of computer algorithms by Horowitz Sahni and Rajasekaran. • Data Structures and Program Design in C By Robert Kruse, PHI, • Theory & Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline by TMH • Introduction to Computers Science -An algorithms approach , Jean Paul Tremblay, Richard B. Bunt, 2002, T.M.H. • Data Structure and the Standard Template library – Willam J. Collins, 2003, T.M.H Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.

PIET-CSE-III

CSE-205 E L

T

3

1

Discrete Structures P

-

Sessional:

50

Exam:

100

Total:

150

Marks

Mark s Mark s

Duration of Exam: 3 Hrs.

Unit-1: Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets, Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product, Representation of relations, Types of relation, Binary Relations, Equivalence relations and partitions, Partial ordering relations and lattices, Mathematics Induction, Principle of Inclusion & Exclusion, Propositions. Function and its types, Composition of function and relations, Cardinality and inverse relations. Functions & Pigeo principles. Unit-2: Propositional Calculus: Basic operations: AND (^), OR (v), NOT (~), Truth-value of a compound statement, propositions, tautologies, contradictions. Techniques Of Counting: Rules of Sum of products, Permutations with and without repetition, Combination.

Recursion And Recurrence Relation :Polynomials and their evaluation, Sequences, Introduction to AP, GP and AG series, partial fractions, linear recurrence relation with constant coefficients, Homogeneous solutions, Particular solutions, Total solution of a recurrence relation using generating functions. Unit-3: Algebric Structures Definition, elementary properties of algebric structures, examples of a Monoid, Submonoid, Semigroup, Groups and rings, Homomorphism, Isomorphism and Automorphism, Subgroups and Normal subgroups, Cyclic groups, Integral domain and fields, Cosets, Lagrange’s theorem, Rings, Division Ring. Unit-4: Graphs And Trees: Introduction to graphs, Directed and Undirected graphs, Homomorphic and Isomorphic graphs, Subgraphs, Cut points and Bridges, Multigraph and Weighted graph, Paths and circuits, Shortest path in weighted graphs, Eurelian path and circuits, Hamilton paths and circuits, Planar graphs, Euler’s formula, Trees, Rooted Trees, Spanning Trees & cut-sets, Binary trees and its traversals Text Book: • Elements of Discrete Mathematics C.L Liu, 1985, McGraw Hill Reference Books: • Concrete Mathematics: A Foundation for Computer Science, Ronald Graham, Donald Knuth and Oren Patashik, 1989, Addison-Wesley. • Mathematical Structures for Computer Science, Judith L. Gersting, 1993, Computer Science Press. • Applied Discrete Structures for Computer Science, Doerr and Levasseur, (Chicago: 1985,SRA •

Discrete Mathematics by A. Chtewynd and P. Diggle (Modular Mathematics series), 1995, Edward Arnold, London,

•

Schaums Outline series: Theory and problems of Probability by S. Lipshutz, 1982, McGraw-Hill Singapore

•

Discrete Mathematical Structures, B. Kolman and R.C. Busby, 1996, PHI

•

Discrete Mathematical Structures with Applications to Computers by Tembley & Manohar, 1995, Mc Graw Hill. nd

• Discrete Mathematics & Structure, Satyender Bal Gupta, 2 Ed., Luxmi Pub. Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.

CSE-207 E

Internet Fundamentals

L

T

P

Sessional :

3

1

-

Exam

50 :

100

Total : 150 Duration of Exam: 3 Hrs.

Mark s Mark s Mark s

Unit-1 : The Internet: Introduction to networks and internet, history, Internet, Intranet & Extranet, Working of Internet, Internet Congestion, internet culture, business culture on internet. Collaborative computing & the internet. Modes of Connecting to Internet, Internet Service Providers(ISPs), Internet address, standard address, domain name, DNS, IP.v6.Modems, Speed and time continuum, communications software; internet tools. Unit-2 : World Wide Web : Introduction, Miscellaneous Web Browser details, searching the www: Directories search engines and meta search engines, search fundamentals, search strategies, working of the search engines, Telnet and FTP, HTTP, Gophar Commands, TCP/IP. Introduction to Browser, Coast-to-coast surfing, hypertext markup language, Web page installation, Web page setup, Basics of HTML & formatting and hyperlink creation.Using FrontPage Express, Plug-ins. Unit-3: Electronic Mail: Introduction, advantages and disadvantages, User Ids, Pass words, e-mail addresses, message components, message composition, mailer features, E-mail inner workings, E-mail management, MIME types, Newsgroups, mailing lists, chat rooms, secure-mails, SMTP, PICO, Pine, Library cards catalog, online ref. works. Languages: Basic and advanced HTML, Basics of scripting languages – XML, DHTML, Java Script. Unit-4 : Servers : Introduction to Web Servers: PWS, IIS, Apache; Microsoft Personal Web Server. Accessing & using these servers. Privacy and security topics: Introduction, Software Complexity, Attacks, security and privacy levels, security policy, accessibility and risk analysis, Encryption schemes, Secure Web document, Digital Signatures, Firewalls, Intrusion detection systems Text Book: • Fundamentals of the Internet and the World Wide Web, Raymond Greenlaw and Ellen Hepp – 2001, TMH • Internet & World Wide Programming, Deitel,Deitel & Nieto, 2000, Pearson Education Reference Books: • Complete idiots guide to java script,. Aron Weiss, QUE, 1997 • Network firewalls, Kironjeet syan -New Rider Pub. • Networking Essentials – Firewall Media. • www.secinf.com • www.hackers.com

•

PIET-CSE-III

Alfred Glkossbrenner-Internet 101 Computing MGH, 1996 Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.

ANALOG COMMUNICATION (ECE-203E) L

T

P

3

1

-

Mark s Mark SESSIONAL : 50 s Mark TOTAL : 150 s 3 TIME : Hrs. THEORY

: 100

UNIT – I NOISE: Classification of Noise, Various sources of Noise, Methods of Noise Calculation in networks and inter connected networks. Addition of noise due to several sources; noise in amplifiers in cascade, noise in reactive circuits, Noise figure, its calculation and measurement. Noise temperature, Mathematical representation of random noise, narrow band noise and its representation. Transmission of noise through linear systems, signal to noise ratio, noise bandwidth. UNIT-II MODULATION TECHNIQUES: Basic constituents of Communication Systems, need of modulation, Amplitude modulation, spectrum of AM wave, modulation index, DSBSC modulation, SSB Modulation, Collector modulation, Square law modulation methods, Methods of generating SSB Signals, vestigial side band modulation, Detection of AM Signal; Diode detector, Square Law Detector. Time Constant RC in diode detector. Diode detector with filter. FDM, Power relations in AM wave. UNIT-III ANGLE MODULATION: frequency and phase modulation, spectrum of FM Wave, modulation index and Bandwidth of FM Signal, NBFM and WBFM, Comparison between FM and PM Signals, FM and AM signals, AM and NBFM Signals, FM generation methods, Demodulation methods; slope detector, ratio detector, Foster-Seeley discriminator. Pre-emphasis & De-emphasis, effect of noise on carrier; noise triangle. UNIT-IV TRANSMITER AND RECEIVER: Classification of radio transmitters, Block diagram of AM transmitter, Frequency Scintillation, Frequency drift, Radio broadcast transmitter, Radio telephone transmitter, Privacy devices, Armstrong FM transmitter, Simple FM transmitter using Reactance modulator. Classification of radio receivers, TRF receives, superheterodyne receivers, Image Signal rejection, frequency mixers. Tracking and alignment of receivers, Intermediate frequency, AGC, AFC, SSB receiver. REFERENCE BOOKS: 1. Taub & Schilling, Principles of Communication Systems, TMH. 2. Mithal G K, Radio Engineering, Khanna Pub. 3. Sirnon Haykin, Communication Systems, John Wiley. 4. Dungan F.R., Electronics Communication System, Thomson-Delmar 5. Electronics Communication System: Kennedy; TMH NOTE: Eight questions are to be set in all by the examiner taking two questions from each unit. Students will be required to attempt five questions in all.

PIET-CSE-III

IT-253 E

Internet Lab.

L

T

P

Sessional

:

50

-

-

3

Exam

:

25

Total : Duration of Exam:

75 3 Hrs.

Mark s Mark s Mark s

PC Software: Application of basics of MS Word 2000, MS Excel 2000, MS Power Point 2000, MS Access 2000, HTML 1. 2. 3. 4.

To prepare the Your Bio Data using MS Word To prepare the list of marks obtained by students in different subjects and show with the help of chart/graph the average, min and max marks in each subject. Prepare a presentation explaining the facilities/infrastructure available in your college/institute. Design Web pages containing information of the Deptt.

HTML Lists : 1. Create a new document that takes the format of a business letter. Combine and
tags to properly separate the different parts of the documents. Such as the address, greeting, content and signature. What works best for each. 2. Create a document that uses multiple
and tags, and put returns between tags to add blank lines to your document see if your browser senders them differently. 3. Create a document using the tags to work as an invoice or bill of sale, complete with aligned dollar values and a total. Remember not to use the Tab key, and avoid using emphasis tags like or within your list. 4. Create a seven-item ordered list using Roman numerals. After the fifth item, increase the next list value by 5. 5. Beginning with an ordered list, create a list that nests both an unordered list and a definition list. 6. Use the ALIGN attribute of an tags to align another image to the top of the first image.. play with this feature, aligning images to TOP, MIDDLE and BOTTOM. 7. Create a ‘table of contents’ style page (using regular and section links) that loads a different document for each chapter or section of the document. Internet : 1. Instilling internet & external modems, NIC and assign IP address. 2. Study of E-mail system. 3. Create your own mail-id in yahoo and indiatimes.com. 4. Add names (mail-id’s) in your address book, compose and search an element. Reference Books: • Complete PC upgrade & maintenance guide, Mark Mines, BPB publ. The complete reference, Craig Zacker & John Rouske, • PC Hardware: TMH • Upgrading and Repairing PCs, Scott Mueller, 1999, PHI,

CSE- 209 E L

T

Database Management Systems Lab P

3

Sessional:

25

Mark Exam: 25 s Mark Total: 50 s Duration of Exam: 3 Hrs.

-

-

1.

Create a database and write the programs to carry out the following operation : 1. 2. 3. 4. 5. 6.

Marks

Add a record in the database Delete a record in the database Modify the record in the database Generate queries Data operations List all the records of database in ascending order.

2. 3.

Create a view to display details of employees working on more than one project. Create a view to display details of employees not working on any project.

4.

Create a view to display employees name and projects name for employees working on projects or . PIET-CSE-III Using two tables create a view which shall perform EQUIJOIN.

5. 6. 7.

Write trigger for before and after insertion. Detection and updation process. Write a procedure to give incentive to employees working on all projects. If no such employee found give app. Message. 8. Write a procedure for computing amount telephone bill on the basic of following conditions. Usage of S/w:

5.

1. VB, ORACLE and/or DB2 2. VB, MSACCESS 3. ORACLE, D2K VB, MS SQL SERVER 2000

CSE-211 E L

-

T

-

Data Structures Lab P

3

Sessional:

50

Marks

Mark Exam: 25 s Mark Total: 75 s Duration of Exam: 3 Hrs.

1.Write a program to search an element in a two-dimensional array using linear search. 2. Using iteration & recursion concepts write programs for finding the element in the array using Binary Search Method 3.. Write a program to perform following operations on tables using functions only a) Addition b) Subtraction c) Multiplication d) Transpose 4.. Write a program to implement Queue. 5.Write a program to implement Stack. 6. Write a program to implement the various operations on string such as length of string concatenation, reverse of a string & copy of a string to another. 7. Write a program for swapping of two numbers using ‘call by value’ and ‘call by reference strategies. 8. Write a program to implement binary search tree.( Insertion and Deletion in Binary search Tree) 9. Write a program to create a linked list & perform operations such as insert, delete, update, reverse in the link list 10. Write the program for implementation of a file and performing operations such as insert, delete, update a record in the file. 11. Create a linked list and perform the following operations on it a) add a node b) Delete a node 12. Write a program to simulate the various searching & sorting algorithms and compare their timings for a list of 1000 elements. 13. Write a program to simulate the various graph traversing algorithms. 14

Write a program, which simulates the various tree traversal algorithms.

15

Write a program to implement various Searching Techniques.

16

Write a program to implement Sorting Techniques.

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

PIET-CSE-III

ANALOG COMMUNICATION LAB (ECE-207E) L T

P

Sessional :

-

2

Viva

-

Total Time

Mark 25 s Mark : 25 s Mark : 50 s 3hrs : .

LIST OF EXPERIMENTS: 1.

i) To study Double Sideband Amplitude Modulation and determine its modulation factor and power in sidebands. ii) To study amplitude demodulation by linear diode detector. 2. i) To study Frequency Modulation and determine its modulation factor. ii) To study PLL 565 as frequency demodulator 3. To study Sampling and reconstruction of pulse amplitude modulation system. 4. To study the Sensitivity characteristics of superhetrodyne receiver. 5. To study the Selectivity characteristics of superhetrodyne receiver. 6. To study the Fidelity characteristics of superhetrodyne receiver. 7. i) To study Pulse Amplitude Modulation a) Using switching method b) By sample and hold circuit. ii) To demodulate the obtained PAM signal by IInd order Low pass filter. 8. To study Pulse Width Modulation / Demodulation. 9. To study Pulse Position Modulation / Demodulation. 10. To study active filters (Low-pass, High-pass, Band-pass, Notch filter). NOTE: At least seven experiments are to be performed from above list and the concerned institution as per the scope of the syllabus can set remaining three. PIET-CSE-III

Bachelor of Technology (Computer Engineering/Information Technology) Scheme of studies / Examination (Semester- 4) Teaching Examination Schedule Schedule (Marks) Sl. No.

Course No.

Subject

7

Mathematics III / Basics of MATH- 201E Industrial Sociology, / HUM-201 E Economics & Management Computer Architecture and CSE-202 E Organization CSE-204 E Programming Languages Object Oriented IT-252 E Programming using C++ ECE-204 E Digital Electronics Microprocessors & ECE-216 E Interfacing IT-256 E C++ Programming Lab.

8

ECE-212 E Digital Electronics Lab

1 2 3 4 5 6

9

10

ECE 218 E Microprocessors & Interfacing Lab. General GPCSEProficiency/Practical 210 Training TOTAL

L

T

3

P

Total

Theory

Sessional

Practical

Total

1 -

4

100

50

-

150

3

1 -

4

100

50

-

150

3

1 -

4

100

50

-

150

3

1 -

4

100

50

-

150

3

1 -

4

100

50

-

150

3

1 -

4

100

50

-

150

-

-

3

3

-

50

25

75

-

-

3

3

-

50

25

75

-

-

3

3

-

25

25

50

1

-

-

1

-

50

-

50

19

6 9

34

600

475

75

1150

BASICS OF INDUSTRIAL SOCIOLOGY, ECONOMICS & MANAGEMENT HUM – 201 E L

T

P

3

1

-

Sessional Theor y Total Duration of Exam. : 3 Hrs.

:

50

:

100

:

150

Mark s Mark s Mark s

UNIT-I Meaning of social change, nature of social change, theories of social change. The direction of social change, the causes of social change, the process of social change. Factors of social change – the technological factors, the cultural factors, effects of technology on major social institutions, social need of status system, social relations in industry. UNIT-II Meaning of Industrial Economic, Production Function, its types, Least Cost Combination, Law of Variable Proportion, Laws of Return – Increasing, Constant & Diminishing. Fixed & variable costs in short run & long run, opportunity costs, relation between AC & MC, U-shaped short run AC Curve. Price & Output Determination under Monopoly in short run & long run. Price Discrimination, Price Determination under Discriminating Monopoly. Comparison between Monopoly & Perfect Competition. UNIT – III Meaning of Management, Characteristics of Management, Management Vs. Administration, Management – Art, Science & Profession, Fayol’s Principles of Management. Personnel Management – Meaning & Functions, Manpower – Process of Manpower Planning, Recruitment & Selection – Selection Procedure. Training – Objectives & Types of Training, Various Methods of Training. Labour Legislation in India – Main provisions of Industrial disputes Act 1947; UNIT – IV Marketing Management – Definition & Meaning, Scope of Marketing Management, Marketing Research – Meaning, Objectives. Purchasing Management – Meaning & Objectives, Purchase Procedure, Inventory Control Techniques. Financial Management – Introduction, Objectives of Financial decisions, Sources of Finance. Note : Eight questions are to be set taking two from each unit. The students are required to attempt five questions in all, taking at least one from each unit. TEXT BOOKS : 8. “Modern Economic Theory” Dewett, K.K., S. Chand & Co. 9. “Economic Analysis” K.P. Sundharam & E.N. Sundharam (Sultan Chand & Sons). 10. “Micro Economic Theory” M.L. Jhingan (Konark Publishers Pvt. Ltd.). 11. “Principles of Economics” M.L. Seth (Lakshmi Narain Aggarwal Educational Publishers – Agra). 12. “An Introduction to Sociology”, D.R. Sachdeva & Vidya Bhusan. 13. “Society – An Introductory Analysis”, R.M. Maclver Charles H. Page. 14. “Principles and Practices of Management : R.S. Gupta; B.D. Sharma; N.S. Bhalla; Kalyani. REFERENCE BOOKS 3. “Organization and Management : R.D. Aggarwal, Tata McGraw Hill.

4. Business Organization and Management : M.C. Shukla

CSE- 202 E

Computer Architecture & Organization

L

T

P

Sessional:

50

Mark s

3

1

-

Exam : Total:

100 150

Marks Marks

Duration of Exam: 3 Hrs. Unit-1: General System Architecture: Store program control concept, Flynn’s classification of computers (SISD, MISD, MIMD); Multilevel viewpoint of a machine: digital logic, micro architecture, ISA, operating systems, high level language; structured organization; CPU, caches, main memory, secondary memory units & I/O; Performance metrics; MIPS, MFLOPS. Instruction Set Architecture: Instruction set based classification of processors (RISC, CISC, and their comparison); addressing modes: register, immediate, direct, indirect, indexed; Operations in the instruction set; Arithmetic and Logical, Data Transfer, Machine Control Flow; Instruction set formats (fixed, variable, hybrid); Language of the machine: 8086 ; simulation using MASM Unit-2: Basic non pipelined CPU Architecture: CPU Architecture types (accumulator, register, stack, memory/ register) detailed data path of a typical register based CPU, Fetch-Decode-Execute cycle (typically 3 to 5 stage); microinstruction sequencing, implementation of control unit, Enhancing performance with pipelining. Hardwired control design method, Micro programmed control unit. Unit-3: Memory Hierarchy & I/O Techniques: The need for a memory hierarchy (Locality of reference principle, Memory hierarchy in practice: Cache, main memory and secondary memory, Memory parameters: access/ cycle time, cost per bit); Main memory (Semiconductor RAM & ROM organization, memory expansion, Static & dynamic memory types); Cache memory (Associative & direct mapped cache organizations. Allocation & replacement polices, segments, pages & file organization, virtual memory. Unit-4: Introduction to Parallelism: Goals of parallelism (Exploitation of concurrency, throughput enhancement); Amdahl’s law; Instruction level parallelism (pipelining, super scaling –basic features); Processor level parallelism (Multiprocessor systems overview). Computer Organization [80x86]: Instruction codes, computer register, computer instructions, timing and control, instruction cycle, type of instructions, memory reference, register reference. I/O reference, Basics of Logic Design, accumulator logic, Control memory, address sequencing, micro-instruction formats, micro-program sequencer, Stack Organization, Instruction Formats, Types of interrupts; Memory Hierarchy. Programmed I/O, DMA & Interrupts. Text Books: nd

3. Computer Organization and Design, 2 Ed., by David A. Patterson and John L. Hennessy, Morgan 1997, Kauffmann. rd 4. Computer Architecture and Organization, 3 Edi, by John P. Hayes, 1998, TMH. Reference Books: 5. Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001, Prentice-Hall Upper Saddle River, New Jersey th 6. Computer Organization, 5 Edi, by Carl Hamacher, Zvonko Vranesic,2002, Safwat Zaky. th 7. Structured Computer Organisation by A.S. Tanenbaum, 4 edition, Prentice-Hall of India, 1999, Eastern Economic Edition. th 8. Computer Organisation & Architecture: Designing for performance by W. Stallings, 4 edition, 1996, Prentice-Hall International edition.

CSE-204 E

Programming Languages

L

T

P

3

1

-

Mark s Mark Exam: 100 s Mark Total: 150 s Duration of Exam: 3 Hrs. Sessional:

50

Unit-1: Introduction: A brief history, Characteristics of a good programming language, Programming language translators compiler & interpreters , Elementary data types – data objects, variable & constants, data types, Specification & implementation of elementary data types, Declarations ,type checking & type conversions , Assignment & initialization, Numeric data types, enumerations, Booleans & characters. Syntax & Semantics: Introduction, general problem of describing syntax, formal method of describing syntax, attribute grammar dynamic semantic. Unit-2: Structured data objects: Structured data objects & data types , specification & implementation of structured data types, Declaration & type checking of data structure ,vector & arrays, records Character strings, variable size data structures , Union, pointer & programmer defined data objects, sets, files. Subprograms and Programmer Defined Data Types: Evolution of data type concept abstraction, encapsulation & information hiding , Subprograms ,type definitions, abstract data types, over loaded subprograms, generic subprograms. Unit–3: Sequence Control: Implicit & explicit sequence control ,sequence control within expressions, sequence control within statement, Subprogram sequence control: simple call return, recursive subprograms, Exception & exception handlers, co routines, sequence control. Concurrency – subprogram level concurrency, synchronization through semaphores, monitors & message passing Data Control: Names & referencing environment, static & dynamic scope, block structure, Local data & local referencing environment, Shared data: dynamic & static scope. Parameter & parameter transmission schemes. Unit-4: Storage Management: Major run time elements requiring storage ,programmer and system controlled storage management & phases , Static storage management , Stack based storage management, Heap storage management ,variable & fixed size elements. Programming Languages: Introduction to procedural, non-procedural ,structured, logical, functional and object oriented programming language, Comparison of C & C++ programming languages. Text Book: • Programming languages Design & implementation by T.W. .Pratt, 1996, Prentice Hall Pub. • Programming Languages – Principles and Paradigms by Allen Tucker & Robert Noonan, 2002, TMH, Reference Books: • Fundamentals of Programming languages by Ellis Horowitz, 1984, Galgotia publications (Springer Verlag), • Programming languages concepts by C. Ghezzi, 1989, Wiley Publications., • Programming Languages – Principles and Pradigms Allen Tucker , Robert Noonan 2002, T.M.H. Note: Eight questions will be set in all by the examiners taking at least two

questions from each unit .Students will be required to attempt five questions in all at least one from each unit.

IT-252 E

Object Oriented Programming Using C++

L

T

P

3

1

-

Mark s Mark Exam: 100 s Mark Total: 150 s 3 Duration of Exam: Hrs. Sessional:

50

Unit–1: Introduction to C++, C++ Standard Library, Basics of a Typical C++ Environment, Preprocessors Directives, Illustrative Simple C++ Programs. Header Files and Namespaces, library files. Concept of objects, basic of object modeling, object classes, associations, behaviors, description, Object Oriented Analysis & Object Modeling techniques, Object Oriented Concepts : Introduction to Objects and Object Oriented Programming, Encapsulation (Information Hiding), Access Modifiers: Controlling access to a class, method, or variable (public, protected, private, package), Other Modifiers, Polymorphism: Overloading,, Inheritance, Overriding Methods, Abstract Classes, Reusability, Class’s Behaviors. Classes and Data Abstraction: Introduction, Structure Definitions, Accessing Members of Structures, Class Scope and Accessing Class Members, Separating Interface from Implementation, Controlling Access Function And Utility Functions, Initializing Class Objects: Constructors, Using Default Arguments With Constructors, Using Destructors, Classes : Const(Constant) Object And Const Member Functions, Object as Member of Classes, Friend Function and Friend Classes, Using This Pointer, Dynamic Memory Allocation with New and Delete, Static Class Members, Container Classes And Integrators, Proxy Classes, Function overloading. Unit-2: Operator Overloading: Introduction, Fundamentals of Operator Overloading, Restrictions On Operators Overloading, Operator Functions as Class Members vs. as Friend Functions, Overloading, Overloading Unary Operators, Overloading Binary Operators. Inheritance: Introduction, Inheritance: Base Classes And Derived Classes, Protected Members, Casting Base- Class Pointers to Derived- Class Pointers, Using Member Functions, Overriding Base –Class Members in a Derived Class, Public, Protected and Private Inheritance, Using Constructors and Destructors in derived Classes, Implicit Derived – Class Object To Base- Class Object Conversion, Composition Vs. Inheritance. Unit–3: Virtual Functions and Polymorphism: Introduction to Virtual Functions, Abstract Base Classes And Concrete Classes, Polymorphism, New Classes And Dynamic Binding, Virtual Destructors, Polymorphism, Dynamic Binding. Files and I/O Streams: Files and Streams, Creating a Sequential Access File, Reading Data From A Sequential Access File, Updating Sequential Access Files, Random Access Files, Creating A Random Access File, Writing Data Randomly To a Random Access File, Reading Data Sequentially from a Random Access File. Stream Input/Output Classes and Objects, Stream Output, Stream Input, Unformatted I/O (with read and write), Stream Manipulators, Stream Format States, Stream Error States. Unit- 4: Templates & Exception Handling: Function Templates, Overloading Template Functions, Class Template, Class Templates and Non-Type Parameters, Templates and Inheritance, Templates and Friends, Templates and Static Members. Introduction, Basics of C++ Exception Handling: Try Throw, Catch, Throwing an Exception, Catching an Exception, Re-throwing an Exception, Exception specifications, Processing Unexpected Exceptions, Stack Unwinding, Constructors, Destructors and Exception Handling, Exceptions and Inheritance. Text Books: • C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall • Object Oriented Programming in Turbo C++ by Robert Lafore ,1994, The WAITE Group Press. • Programming with C++ By D Ravichandran, 2003, T.M.H Reference books: • Object oriented Programming with C++ by E Balagurusamy, 2001, Tata McGraw-Hill • Computing Concepts with C++ Essentials by Horstmann, 2003, John Wiley, • The Complete Reference in C++ By Herbert Schildt, 2002, TMH. • C++ Programming Fundamentals by Chuck Easttom, Firewall Media.

Note: Eight questions will be set in all by the examiners taking at least two questions from each unit

.Students will be required to attempt five questions in all at least one from each unit.

B.TECH IVTH SEMESTER DIGITAL ELECTRONICS (ECE-204E)

L

T

P

Theory

:

100

3

1

-

Sessional

:

50

Total : 150 Duration of Exam: 3 Hrs.

Mark s Mark s Mark s

UNIT 1 FUNDAMENTALS OF DIGITAL TECHNIQUES: Digital signal, logic gates: AND. OR, NOT. NAND. NOR- EX-OR, EX-NOR, Boolean algebra. Review of Number systems. Binary codes: BCD, Excess-3. Gray codes. COMBINATIONAL DESIGN USING GATES: Design using gates. Karnaugh map and Quine Mcluskey methods of simplification. UNIT 2 COMBINATIONAL DESIGN USING MST DEVICES Multiplexers and Demultiplexers and their use as logic elements. Decoders. Adders / Subtracters. BCD arithmetic Circuits. Encoders. Decoders / Drivers for display devices. SEQUENTIAL CIRCUITS: Flip Flops: S-R- J-K. T. D, master-slave, edge triggered- shift registers, sequence generators. Counters. Asynchronous and Synchronous Ring counters and Johnson Counter, Design of Synchronous and Asynchronous sequential circuits. UNIT 3 DIGITAL LOGIC FAMILIES: Switching mode operation of p-n junction, bipolar and MOS-devices. Bipolar logic families: RTL, DTL, DCTL. HTL, TTL, ECL, MOS, and CMOS logic families. Tristate logic. Interfacing of CMOS and TTL families. UNIT 4 A/D AND D/A CONVERTERS: Sample and hold circuit, weighted resistor and R -2 R ladder D/A Converters, specifications for D/A converters. A/D converters: Quantization, parallel -comparator, successive approximation, counting type. Dual-slope ADC, specifications of ADCs. PROGRAMMABLE LOGIC DEVICES: ROM, PLA. PAL, Introduction to FPGA and CPLDs. TEXT BOOK: • Modem Digital Electronics (Edition III): R. P. Jain; TMH REFERENCE BOOKS: • Digital Integrated Electronics: Taub & Schilling: MGH • Digital Principles and Applications: Malvino & Leach: McGraw Hill. • Digital Design: Morris Mano: PHI, NOTE: Eight questions are to be set in all by the examiner taking at least one question from each unit. Students will be required to attempt five questions in all.

• •

Computer Architecture & Organisation by M. Mano, 1990, Prentice-Hall. Computer Architecture- Nicholas Carter, 2002, T.M.H.

Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.

ECE-216 E

Microprocessors And Interfacing

L

T

P

3

1

-

Mark Sessional: 50 s Mark Exam: 100 s Mark Total: 150 s Duration of Exam: 3 Hrs.

Unit-1:THE 8085 PROCESSOR : Introduction to microprocessor, 8085 microprocessor : Architecture, instruction set, interrupt structure, and assembly language programming. MEMORY INTERFACING: Semiconductor memory and its types - Static and dynamic RAM, ROM, EPROM, EEROM and NOVRAM- Interfacing memory- Interfacing SRAM, DRAM, EPROM etc. Timing of RAM and ROM signals. Unit-2 : THE 8086 MICROPROCESSOR ARCHITECTURE : Architecture, block diagram of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical address computations, program relocation, addressing modes, instruction formats, pin diagram and description of various signals. INSTRUCTION SET OF 8086 : Instruction execution timing, assembler instruction format, data transfer instructions, arithmetic instructions, branch instructions, looping instructions, NOP and HLT instructions, flag manipulation instructions, logical instructions, shift and rotate instructions, directives and operators, programming examples. Unit-3 : INTERFACING DEVICE : The 8255 PPI chip: Architecture, control words, modes and examples.Interfacing D/A and A/D converters Unit-4: DMA : Introduction to DMA process, 8237 DMA controller, INTERRUPT AND TIMER : 8259 Programmable interrupt controller, Programmable interval timer chips. Text Books : • Microprocessor Architecture, Programming & Applications with 8085 : Ramesh S Gaonkar; Wiley Eastern Ltd. • The Intel Microprocessors 8086- Pentium processor : Brey; PHI Reference Books : 6. Microprocessors and interfacing : Hall; TMH 7. The 8088 & 8086 Microprocessors-Programming, interfacing,Hardware & Applications :Triebel & Singh; PHI 8. Microcomputer systems: the 8086/8088 Family: architecture, Programming & Design : Yu-Chang Liu & Glenn A Gibson; PHI. 9. Advanced Microprocessors and Interfacing : Badri Ram; TMH Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.

IT-256 E

C ++ Programming Lab.

L

T

P

-

-

3

Mark s Mark Exam: 25 s Mark Total: 75 s Duration of Exam: 3 Hrs. Sessional:

50

Q1. Raising a number n to a power p is the same as multiplying n by itself p times. Write a function called power ( ) that takes a double value for n and an int value for p, and returns the result as double value. Use a default argument of 2 for p, so that if this argument is omitted, the number will be squared. Write a main ( ) function that gets values from the user to test this function. Q2. A point on the two dimensional plane can be represented by two numbers: an X coordinate and a Y coordinate. For example, (4,5) represents a point 4 units to the right of the origin along the X axis and 5 units up the Y axis. The sum of two points can be defined as a new point whose X coordinate is the sum of the X coordinates of the points and whose Y coordinate is the sum of their Y coordinates. Write a program that uses a structure called point to model a point. Define three points, and have the user input values to two of them. Than set the third point equal to the sum of the other two, and display the value of the new point. Interaction with the program might look like this: Enter coordinates for P1: 3 4 Enter coordinates for P2: 5 7 Coordinates of P1 + P2 are : 8, 11 Q 3. Create the equivalent of a four function calculator. The program should request the user to enter a number, an operator, and another number. It should then carry out the specified arithmetical operation: adding, subtracting, multiplying, or dividing the two numbers. (It should use a switch statement to select the operation). Finally it should display the result. When it finishes the calculation, the program should ask if the user wants to do another calculation. The response can be ‘Y’ or ‘N’. Some sample interaction with the program might look like this. Enter first number, operator, second number: 10/ 3 Answer = 3.333333 Do another (Y/ N)? Y Enter first number, operator, second number 12 + 100 Answer = 112 Do another (Y/ N) ? N Q4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212), the exchange (767) and the number (8900). Write a program that uses a structure to store these three parts of a phone number separately. Call the structure phone. Create two structure variables of type phone. Initialize one, and have the user input a number for the other one. Then display both numbers. The interchange might look like this: Enter your area code, exchange, and number: 415 555 1212 My number is (212) 767-8900 Your number is (415) 555-1212 Q 5. Create two classes DM and DB which store the value of distances. DM stores distances in metres and centimeters and DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another object of DB. Use a friend function to carry out the addition operation. The object that stores the results maybe a DM object or DB object, depending on the units in which the results are required. The display should be in the format of

feet and inches or metres and cenitmetres depending on the object on display.

Q 6. Create a class rational which represents a numerical value by two double valuesNUMERATOR & DENOMINATOR. Include the following public member Functions: 5. constructor with no arguments (default). 6. constructor with two arguments. 7. void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator and denominator. 8. Overload + operator to add two rational number. 9. Overload >> operator to enable input through cin. 10. Overload