Course Code: TMC 206 L T P C

Course Name: Professional Communication - II 2 0 2 3

Graphic Era Hill University, Dehradun

UNIT I: 10 Hours

Communication Skills: Technical Communication, Factors to be considered in technical

communication, Verbal and Non Verbal Communication (Kinesics): Components of

Non Verbal Communication (kinesics), Barriers to effective communication

UNIT II: 10Hours

English Usage & Effective Reading Skills: Overview to Sentence Completion, Analogies,

Para jumbles and Reading Comprehension. Effective Reading skills : Purpose of

Reading, skimming and scanning. Tips for improving comprehension skills. (For

effective reading skills, practice papers on Reading Comprehension will be provided to

students)

UNIT III: 8 Hours

Effective Presentation Strategies: Defining purpose, Analysis of audience and locate,

Organizing contents. Preparing an outline of the Presentation. Visual Aids, Nuances of

delivery, Body language and Effective presentation.

UNIT IV: 6 Hours

Personality Development: Self Esteem – Symptoms – Advantages – Do’s Don’ts to develop positive self esteem - Low Self Esteem – Symptoms – Personality having low

Self Esteem – Positive and Negative Self Esteem , Swot Analysis

UNIT V: 8 Hours

Job Application & Preparing for G.D.: Essential Parts – Cover letter and the ‘Resume’. Functional Resume. Group Discussions(GD): Introduction, Why GD, Qualities tested

in GD’s, Types of GD. The importance of lateral thinking in GD, Non Verbal

Communication in GD. (Mock GD’s for practice)

Text Books:

Technical Communication by Oxford Press 2011.

Business Communication by Galgotia Publishers 2011.

R.S. Aggarwal’s Objective General English, 2011

Reference Books:

Business Communication by Galgotia Publishers 2011.

Technical Communication by Rizvi 2011.

Wren and Martin’s English Grammar, 2011

Course Code: TMC 201 L T P C

Course Name: Internet Technology 3 0 0 3

Graphic Era Hill University, Dehradun

UNIT 1: 9 Hours

Internet-Introduction to Internet, Beginning and Current State, client server Architecture

WWW,WebBrowsers. WebServers,types of web server, protocols – HTTP, SMTP, POP3, MIME, IMAP. FTP, Telnet Web Applications,,HTTP,Browser,Security on Web, Plug-ins, searching tools and Search engine, , and E-Mail. ISP, URL,IP addressing, DNS, Tier technology, 2-tier and n-tier.

UNIT 2: 9 Hours

Concepts, Static and dynamic HTML, Structure of HTML documents, HTML Elements, Linking in HTML, Anchor Attributes, Image Maps, Meta Information, Image Preliminaries, Layouts, Backgrounds, Colors and Text, Fonts, Tables, Audio and Video Support with HTML. Basic Interactivity and HTML: Interactive Layout with Frames, FORMS, Form Control, New and emerging Form Elements.

UNIT 3: 9 Hours

Introduction, Benefits of CSS, how css works, types of CSS, class Selector forms text formatting properties, CSS Border, margin properties, Positioning Use of classes in CSS, color properties, concept of Ids pseudo classes use of <div> & <span> ,box model concept, simple floating ,float layout, float tricks, type basics, column layout, column fonts ,menu list ,meta tag view port, toggle, audio to web application, manifest, storage, geolocation.

UNIT 4: 9 Hours

Overview of JavaScript, Object orientation and JavaScript, JavaScript identifiers, operators, control & Looping structure, Intro of Array, Array with methods, Math, String, Date Objects with methods User defined & Predefined functions, DOM objects, Window Navigator, History, Location, Event handling, Validations on Forms, The DOM 2 event model, The navigator objects, DOM tree traversal and modification

UNIT 5: 9 Hours

Introduction to PHP/MySQL: A First PHP Web Page, Variables, Operators and Expressions,

Control Statements, Functions, Arrays, String Handling in PHP, Using Ms-Access/MySQL

Databases in PHP Pages

Text Books:

Computer Networks and Internets with Internet Applications (Third Edition) Author:

Douglas E.Comer Publisher: Prentice Hall, ISBN: 0-13-091449-5 Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication

Reference Books :

Thomas A Powell, HTML-The Complete Reference, Tata McGraw Hill. Deitel M., Deitel P. J., Goldberg, A. B.: Internet & World Wide Web How to Program, 3rd

Edition, Pearson education.

Course Code: TMC 202 L T P C

Course Name: Programming in C++ 3 0 0 3

Graphic Era Hill University, Dehradun

Unit I: Introduction Introduction to Object Oriented Programming paradigm: basic concepts, benefits and applications. Overview of C++, Sample C++ program, data types, operators, expressions, and statements, arrays and strings, pointers & user-defined typesFunctions: prototype, argument passing, default arguments, inline functions. Unit II: Classes & Objects

Classes & Objects :Class Specification, Class Objects, Scope resolution operator, Access specifiers, Data members, member functions, Constructors, Destructors, Static data members , static member functions, friend functions. Pointers and Dynamic Memory Management: Declaring and initializing pointers, accessing data through pointers, memory allocation (static and dynamic), dynamic memory management using new and delete operators, pointer to an object, this pointer.

Unit III: Operator Overloading ,Inheritance

Operator Overloading:Overloading operators, rules for overloading operators, overloading of operators using friend functions Inheritance: Introduction, defining derived classes, forms of inheritance, ambiguity in multiple and multipath inheritance, virtual base class, order of execution of constructors and destructors.

Unit IV: Virtual functions, Polymorphism

Concept of binding - early binding and late binding, virtual functions, pure virtual functions, abstract clasess, virtual destructors. Exception Handling: Review of traditional error handling, basics of exception handling, exception handling mechanism, throwing mechanism, catching mechanism.

Unit V: Generic Programming, Files Templates and Generic Programming: Template concepts, Function templates, class templates. Files: File streams, hierarchy of file stream classes, error handling during file operations, reading/writing of files, accessing records randomly, updating files.

Text Books:

E. Balagurusamy, Object Oriented Programming with C++, Tata McGraw Hill.

Reference Books:

Lafore R., Object Oriented Programming in C++, Waite Group.

R. S. Salaria, Mastering Object-Oriented Programming with C++, Salaria Publishing House.

Course Code: TMC-203 L T P C

Course Name : CBNST 3 1 0 4

Graphic Era Hill University, Dehradun

UNIT I: 8 Hours

Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization,

Pitfalls of floating point representation, Errors in numerical computation

Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using

Bisection Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant

method, Rate of convergence of iterative methods.

UNIT II: 8 Hours

Interpolation and approximation: Finite Differences, Difference tables Polynomial Interpolation:

Newton’s forward and backward formula Central Difference Formulae: Gauss forward and backward formula, Stirling’s, Bessel’s, Everett’s formula. Interpolation with unequal intervals:

Langrange’s Interpolation, Newton Divided difference formula, Approximation of function by

Taylor’s series.

UNIT III: 9 Hours

Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical

Integration, Trapezoidal rule, Simpson’s rules, Boole’s Rule, Weddle’s Rule.

Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method, Runge-

Kutta methods,

Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination , Gauss Jordan method , Gauss Seidal iterative method, Rate of Convergence.

UNIT IV: 9 Hours

Curve fitting, Cubic Spline and Approximation: Method of least squares, fitting of straight

lines, polynomials, exponential curves etc Cubic Spline Approximation.

Correlation and Regression analysis:Introdunction ,Scatter Diagram ,Types of Correlation ,Karl

Pearson’s Method ,Rank Correlation, Linear and Non-linear regression, Multiple regression

UNIT V: 8 Hours

Time series and forecasting: Method of Semi Averages ,Method of Moving Averages,Method of

Least Square, smoothening of curves, forecasting models and methods. Statistical Quality

Controls :Advantages of Q.C, Controls charts ,Types of control charts-Mean chart, R- Range chart

,Standard Deviation Chart

Note: All formulas without proof

Text Books: Rajaraman V., “Computer Oriented Numerical Methods”, PHI-2004 Gerald & Wheatley, “Applied Numerical Analyses”, AW-2003

Reference Books: Gerald & Wheatley, “Applied Numerical Analyses”, AW, 2003 Jain, Iyengar and Jain, “Numerical Methods for Scientific and Engineering Computations”, New Age Int, 2003. Grewal B. S., “Numerical methods in Engineering and Science”, Khanna Publishers, Delhi

Course Code: TMC-204 L T P C Course Name: LINUX & SHELL PROGRAMMING 3 0 0 3

Graphic Era Hill University, Dehradun

UNIT I 7Hours

Overview of Operating System Introduction, Functions of Operating System, Types of Operating System, Open source software, Closed Source Software, Brief history of UNIX AND Linux Operating System, Linux Architecture, Internal Command vs External Command, System calls, Virtual Machine.

UNIT II 8Hours

Understanding UNIX Utilities Command Structure, Man Browsing the manual pages on-line. General Purpose Utilities: pwd, clear, lock, tput, uname, cal, date, echo, printf, bc, script, passwd, who,tty. Directory and File Related Commands: cd, mkdir, rmdir, touch, cat, cp, rm, mv, more, file, lp, wc, od, cmp, comm,dos2unix, unix2dos, compressing and archiving files, gzip and gunzip, tar, zip and unzip, ls –il, umask, chmod, chown, chgrp, find, ln, hard link vs soft link. The vi editor: The three modes. Basic navigation. Moving to a specific line number. Repeat factor. The command mode commands. Saving and quitting. Text deletion. Using operators in deleting and copying text. Undoing and repeating commands. Pattern search and substitution. Moving text, Customization. The file .exrc

File System: File and Directory, Linux File System, Types of files in Linux, Components of File System, Structure of inode, parent-child relationship, the HOME variable, Absolute and Relative pathnames. UNIT III 12Hours

Shell Programming Shell, The Shell’s interpretive cycle, Pattern Matching, Three Standard Files and Redirection, Two special files, pipe, tee, command substitution, Shell Variable, Linux-defined variables and user-defined variables, aliases, command history. Shell scripts, Making Scripts Interactive, Using Command line arguments, exit and Exit status of a command, The logical operators && and ||,the if conditional, using test and [ ] to evaluate expressions, the case conditional, expr, $0, while, for, set and shift, the here document, trap, debugging shell scripts with set –x, Shells and sub-shells, () and {}:Sub-shell or current Shell? export: Exporting Shell Variables, Running a Script in the current Shell:The . Command. UNIT IV 8Hours

The Process Introduction, ps, system process, zombie process, orphan process, process creation, running jobs in background, nohup, nice, killing processes with signals, job control, at and batch, cron, time Filters pr, head, tail, cut, paste, sort, tr, grep, egrep and fgrep. “sed”:The Stream Editor, Line Addressing, Using Multiple Instructions ( -e and –f), Context addressing, writing selected lines to a file, Text editing, Substitution.

“awk”: Introduction, Selection criteria and action, Splitting a line into fields and using printf, using regular expression, Computation using decimal number, using variables, Storing awk program in a file, The Begin and End Sections. UNIT V 7Hours

Essential System Administration: root, role and power of the system administrator, becoming super user, user administration. Understanding /etc/passwd, /etc/shadow and /etc/fstab files. Booting and shutdown. Set-user-id and sticky bit. Mounting file systems. Creating Partitions and File System, File system checking. Checking free space and disk usage. Backing up files Text Book

Richard Peterson, “Linux-The Complete Reference”, TMH,sixth edition,2008. Reference Books Kenneth Roson, “UNIX – The Complete Reference”, TMH, 2011. Sumitabha Das, “UNIX Concepts and Applications”, TMH, fourth edition, 2011.

Course Code : TMC 205 L T P C

Course Name : Financial Accounting & Management 3 1 0 4

Graphic Era Hill University, Dehradun

UNIT 1: 6 Hours

Basic of Accounting : Concept, meaning, assumptions, principles and conventions, Double entry system, Journal ,Ledger- posting, Trial Balance, Working capital (Gross and Net),Balancing of accounts. Preparation of Trading and Profit & Loss account and Balance Sheet with normal closing entries and adjustments.

UNIT 2: 8 Hours

Ratio Analysis: Meaning of Ratio and Ratio analysis, utilities and limitations of ratios, Interpretation of ratios, Classification of ratios and their implications. Liquidity ratios, solvency ratios, assumptions and limitations of ratio analysis.

UNIT 3: 10 Hours

Budget and budgetary control: Concepts-Definition of budget and budgeting, Budgeting control-objectives and advantages, Classification of budget-Cash budget, flexible budget , Sales budget and production budget, Concept of performance budget and Zero base budgeting, Software cost analysis.

UNIT 4: 10 Hours

Break -Even-Analysis: Meaning and definition, Break even point analysis, Break even point chart, uses of break even analysis. Profit volume ratio, effect of changing sales mix ratio. Capital Budgeting: Meaning and importance, concept of project appraisal, capital budgeting techniques, Traditional techniques –Pay back period and ARR techniques, Discounted cash flow techniques-NPV, BCR and IRR techniques.

UNIT 5: 8 Hours

Inventory control System: Concept and meaning of inventory, Purposes of inventory retention, perpetual and periodic inventory control, various methods of inventory valuation. Introduction to Computerized Accounting System: Introduction, concept, data summarization in accounting information system, Types of files used information system, Documents useful for data collection.

Text Books:

Management accounting DR DC sharma & DR. KG gupta ,Financial

Accounting by TS-Grewal (Sultan chand)

Reference Books:

Basics of Financial and management Accounting by Wilson (EEE)

Course Code: XCS - 401 L: 2 T P C

Course Name: Career Skills

Graphic Era Hill University, Dehradun

UNIT 1: 5 Hours

Understanding Numbers, Divisibility rules, properties of remainders, LCM-HCF and

their applications, concept of the last digit, alphanumerals.

UNIT 2: 8 Hours

Profit, loss and discount, simple and compound interest, ratio-proportion and it’s application.

UNIT 3: 4 Hours

Averages, ages, mixtures and solutions.

UNIT 4: 4 Hours

Concepts of time,speed,distance, concepts of time and work and it’s applications.

UNIT 5: 3 Hours

Permutation, combination, probability.

UNIT 6: 6 Hours

Set theory, clocks, calendar, logarithms, mensuration, basic algebra and it’s

applications.

Reference Books:

R.S.Aggarwal, Quantitative Ability for MBA

Course Code : TMC 401 L:3 T:1 P:0 C:4

Graphic Era Hill University, Dehradun

UNIT 1: 8 Hours

Introduction to Object Oriented Methodology: Introduction to object oriented concepts and applications, Classes, Objects, Data Abstraction, Encapsulation, Inheritance, Polymorphism, Message Passing.Introduction and Evolution of Java: Byte Code, JDK, JVM, JRE, Data type, Variable, Arrays& Vector, Operator, Control Statements, Classes & Objects, Constructor, Methods, this, super keyword , Inheritance, static blocks.Packages, Defining Packages, Using Packages, import and static import, jar utility, classes modifiers: abstract, final; member modifiers: public, protected, default, private, static, final, abstract, synchronized, native, transient, volatile, strictfp, instanceof operator

UNIT 2: 6 Hours

Interface: Defining Interfaces, abstract methods declarations, implementing

interfaces, extended interfaces,interface references and constants in interfaces

Oject Lifetime: Garbage Collection, Reachable Objects, Object Finalization.

Fundamental Classes: Object class, Wrapper classes, String class, immutability,

StringBuffer and StringBuilder.Nested and Inner Classes

UNIT 3: 8 Hours

Exception handling: Exception Types, Exception class, RuntimeException Class,

Error Class, Checked and unchecked Exceptions, Defining new exceptions;

Handling: try, catch and finally; throw statement, throws clause.

Thread: Overview of threads, thread Creation; implementing the runnable

interfaces, extending the thread class, Thread States, methods: Running,

Yielding, sleeping, joining, waiting and notifing. Synchronized and static

synchronized threads.

UNIT 4: 13 Hours

I/O: The File class, FilenameFilter, Byte Streams: Input and Output streams,

Character streams:readers and writers; object serialization

Applet: Applet basics, Applet Architecture, Applet Life cycle;

Event Handling: Event handling mechanisms, the Delegation Event Model, Event

classes, sources of events, Event Listener Interfaces, Adapter classes

AWT: AWT Controls, Layout Managers, Frame, Images, Graphics, Fonts, Cursors,

Colors,FileDialogbox.Swing- Introduction, Advantages over AWT, Swing

applications.

UNIT 5: 7 Hours

Networking: Networking Basics, Java and the Net, TCP/IP Client sockets, URL,

URLConnection,TCP/IPServersockets,DatagramIntroduction to RMI (Remote

Method Invocation): RMI, remote Interfaces, Stubs and skeletons, RMI registry,

Bind and Rebind, a simple client server application using RMI.

Introduction to Generic Classes and Collection (List, Set, Map)

Sl.NO NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF

PUBLICATION

1. Naughton, Schildt, “The Complete Reference JAVA2”, TMH 7th

edition, 2007

2. Khalid A. Mughal: A Programmer’s Guide To JAVA, Addison Wesley

3rd

edition, 2008

Course Code: TMC 402 L :3 T :1 P:2 C:3

Course Name: Design and Analysis of Algorithms

Graphic Era Hill University, Dehradun

UNIT-I Analysis techniques 8 Hours Growth of Functions: Asymptotic notations; Standard Notations and Common Functions; Mathematical Analysis of Non-Recursive and Recursive Algorithms. Recurrences and Solution of Recurrence Equations- The Substitution method, The Recurrence–Tree Method, The Master Method. UNIT-II Design Techniques-I 10 Hours Brute Force Approaches: Selection Sort, Bubble Sort, Brute Force String Matching; Decrease & Conquer: Insertion Sort; Divide & Conquer: Merge Sort, Quick Sort; Transform & Conquer: Heap Sort; Greedy Technique: Fractional Knapsack Problem, Activity Selection Problem. UNIT-III Design Techniques-II 8 Hours Dynamic Programming: 0/1 Knapsack Problem, Matrix-Chain Multiplication. Backtracking: Hamiltonian Circuit Problem, Subset – Sum Problem; Branch-and-Bound: Assignment Problem, Traveling Salesperson Problem; UNIT-IV Graph Algorithms 12 Hours Graph: Introduction, Representation of Graph, BFS, DFS, Minimum Spanning Tree: Prims Algorithm, Kruskal Algorithm, Single Source Shortest Paths: Bellman-Ford Algorithm, Dijkstra Algorithm, All Pair Shortest Paths: Floyd-Warshall Algorithm, flow Network:Maximum flow -min cut theorem. UNIT-V NP- Completeness & Approximation Algorithms 6 Hours NP-Completeness: P, NP, NP-Hard & NP-Complete Class, Reducibility & NP-Complete Problems. Approximation Algorithms: The Vertex Cover Problem, The Set Covering

Problem

Text Books: 1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to Algorithms, 3rd Edition, Prentice-Hall of India, 2. Ellis Horowitz, Sartaj Sahni, S.Rajasekharan: Fundamentals of Computer Algorithms, 2nd Edition, Universities press, Reference books 1. Anany Levitin: Introduction to The Design & Analysis of Algorithms, 2nd Edition, Pearson Education. 2. Kenneth A. Berman, Jerome L. Paul: Algorithms, Cengage Learning. 3.S. Baase: Computer Algorithms: Introduction to Design and Analysis, 2nd ed., Addison-Wesley, California, 2002

Course Code: TMC 403 L:3 T P C:3

Course Name: Network Security & Cryptography.

Graphic Era Hill University, Dehradun

UNIT 1: Introduction and Mathematical Foundation 10 Introduction To Security: Attacks, Services & Mechanisms. Mathematical Foundation: Modular Arithmetic, Extended Euclidean algorithm, Matrices and Residue Matrices: operations Classical Encryption Techniques: Substitution & Transposition techniques, Cryptanalysis, Steganography.

UNIT 2: Symmetric-Key Ciphers 8

DES, Triples DES , Cryptanalysis, Modern Block Cipher Principles, Block Cipher Modes Of Operation, International Data Encryption Algorithm, Key Distribution, Random Number Generation, Stream Ciphers.

UNIT 3:Public-Key Ciphers 6

Principles Of Public-Key Cryptosystems, Fermat’s & Euler’s Theorem, RSA Algorithm, Digital Signature Standard, Key Management.

UNIT 4: Authentication and Access Control 10

Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Functions, Message Digest Algorithm, Secure Hash Algorithm, Digital Signatures

Access Control: Authentication Methods, Passwords, Biometrics; Authorization- Access Control Matrix, Multilevel Security Models, Multilateral Security, Inference Control, CAPTCHA, Signature-Based IDS, Anomaly-Based IDS

UNIT 5: Network & System Security 8

Authentication Applications: Kerberos, X.509 Directory Authentication Service, Electronic Mail Security, Pretty Good Privacy (PGP), S / Mime, IPSEC.

Web Security: Secure Socket Layer & Transport Layer Security, Secure Electronic Transaction,System Security: Intruders, Viruses, Firewalls, Trusted Systems

Text Books:

William Stallings, “Cryptography and Network Security: Principles and Practice”, 4thEd., Prentice Hall, New Jersey, 2009

Reference Books:

Johannes A. Buchmann, “Introduction to Cryptography”, Springer- Verlag, 2008

Bruce Schneier, “Practical Cryptography”, Wiley DreamTech India, 2009

Eric Cole, “Network Security Bible,” Wiley DreamTech India Pvt. Ltd, 2003

Cryptography and Network Security; McGraw Hill; Behrouz A.Forouzan

Course Code: TMC 404(1) L T P C

Course Name: Compiler Construction 3 1 0 4

Graphic Era Hill University, Dehradun

UNIT 1:

Compiler Structure: Compilers and Translators, Various Phases of Compiler,

Pass Structure of Compiler, Bootstrapping of Compiler, Programming Languages:

High level languages, The lexical and syntactic structure of a language, Data elements,

Data Structure, Operations, Assignments, Program unit, Data Environments,

Parameter Transmission. Lexical Analysis: The role of Lexical Analyzer, A simple

approach to the design of Lexical Analyzer, Regular Expressions , Transition

Diagrams, Finite state Machines, Implementation of Lexical Analyzer, Lexical Analyzer

Generator: LEX, Capabilities of Lexical Analyzer

UNIT 2: The Syntactic Specification of Programming Languages: CFG, Derivation and

Parse tree, Ambiguity, Capabilities of CFG. Basic Parsing Techniques: Top-Down

parsers with backtracking, Recursive Descent Parsers, Predictive Parsers, Bottom–up

Parsers, Shift-Reduce Parsing, Operator Precedence Parsers, LR parsers (SLR,

Canonical LR, LALR) ,Syntax Analyzer Generator: YACC

UNIT 3: Intermediate Code Generation: Different Intermediate forms: three address

code, Quadruples & Triples. Syntax Directed translation mechanism and attributed

definition. Translation of Declaration, Assignment, Control flow, Boolean expression,

case statements, postfixes translation.

UNIT 4:

Run Time Memory Management: Static and Dynamic storage allocation, stack based

memory allocation schemes, Symbol Table management, Error Detection and

Recovery: Lexical phase errors, Syntactic phase errors, Semantic errors.

UNIT 5:

Code Optimization and Code Generation: Local optimization, Loop optimization,

Peephole optimization, Basic blocks and flow graphs, DAG, Data flow analyzer,

Machine Model, Order of evaluation, Register allocation and code selection

Text Books:

Al. V Aho, J. D. Ullman, “Principles of Compiler Design”, Narosa 2007

Reference Books:

C. Santanu “Compiler Design” PHI India, New Delhi 2011. I.A. Holub “Compiler Design in C”, Prentice Hall Inc. India. New Delhi 2006. O.G. Kakde,” Compiler Design” University Press 2011. Grune, Dick” Modern Compiler Design” Wiley Dreamtech. India 2011.

Course Code: TMC 405 L:3 T :1 P C:4

Course Name: Business Intelligence

UNIT 1: Business View of Information Technology Applications: Business Enterprise, Functions and Core Business Processes, Baldrige Business Excellence Framework, Purpose of Using IT in Business, Application development Approaches, Information Users and Their Requirements, Types of Digital Data : Structured Data ,Unstructured Data , Semi-Structured Data , Characteristics, Issues and Challenges, Data Sources : Primary, Secondary.

UNIT 2: Business Intelligence Overview: BI Skill requirements, BI benefits, functions and Applications, Using Analytical Information for Decision Support, Role of DSS, EIS, MIS, Business Analytics, BI Component Framework, BI Users, Applications, Popular BI Tools. Introduction to OLTP and OLAP: Characteristics, Issues and Challenges, Comparison, Dimensional Data, Different OLAP Architectures, ROLAP, MOLAP, HOLAP, Data Models for OLTP and OLAP, OLAP operations: Slice, Dice, Roll Up, Cube etc.

Unit 3 : Data Integration & Data warehousing: Strategic Information, Information Crisis, Need for Data Warehouse, Definition, Goals, Benefits, Use, Components, Data Marts, Ralph Kimball's AND W.H. Inmon's Approach, Extraction, Transformation & Loading, Data Integration. Multidimensional Data Modeling :Introduction, Basics, Data models, Facts & Fact Table, Dimensions, Dimension Table, Subjects, Measures, Dimensional Models : Star Schema, Snowflake Schema etc, Keys, Aggregate Tables.

Unit 4 : Metrics & KPIs:

Understanding Measures and Performance, Role of Metrics, KPIs Enterprise Reporting: Report Standardization, Presentation, Balanced Scorecard, Dashboards.

Unit 5 : Data Mining Basics: Definition, features, Applications, Mining Process, Techniques, OLAP vs Data Mining.

Text Books:

1. Fundamentals of Business Analytics , R N Prasad, Seema Acharya , Wiley India,

2011

2. Data Warehousi g Fu da e tals , Paulraj Po iah, Wiley I dia, 2007

Course Code: PMC 203 L T P C Course Name: Linux Lab 0 0 4 2

Graphic Era Hill University, Dehradun

1. Execution of various file/directory handling commands. 2. Simple shell script for basic arithmetic and logical calculations. 3. Shell scripts to check various attributes of files and directories. 4. Shell scripts to perform various operations on given strings. 5. Shell scripts to explore system variables such as PATH, HOME etc. 6. Shell scripts to check and list attributes of processes. 7. Execution of various system administrative commands. 8. Write awk script that uses all of its features. 9. Use sed instruction to process /etc/passwd file. 10. Write a shell script to display list of users currently logged in. 11. Write a shell script to delete all the temporary files.

12. Write a shell script to search an element from an array using binary searching.

Course Code: PMC 201 L T P C Course Name: C++ & CBNST Lab 0 0 4 2

Graphic Era Hill University, Dehradun

1. WAP to design the Triangle class. The class should have member functions like calc_area, calc_perimeter. Make assumptions, if necessary. 2. Given that an EMPLOYEE class contains the following members:

a.Data Members: Employee_Number, Employee_Name, Basic, DA, TA,HRA, Net_Sal b.Member Functions: to read data, to calculate Net_Sal and to print data members

Write a C++ program to read data on N employees and compute the Net_Sal of each employee 3. Define a STUDENT class with Rno, Name, and Marks in 3 tests of a subject. Declare an array of 10 STUDENT objects. Using appropriate functions, find the average of the two better marks for each student. Print the Rno, Name and the average marks of all the students. 4. Create a class called user_time that has separate integer members for hours, minutes and seconds. One member function should initialize this data to 0, and another should initialize it to fixed values. A member function should display it in HH:MM:SS format. The final two member functions should add and subtract two objects of time passed as arguments. A main () program should create two initialized user_time objects. Then it should add the two initialized together, leaving the result in the third user_time object. Finally it should display the value of third variable. 5. Create a class called DISTANCE that has separate member data inches and feet. One constructor should initialize this data to 0, and another should initialize it to fixed values. A member function should display it. The member function should add two objects of type distance passed as arguments. A main ( ) program should create two initialized distance objects, and one that isn’t initialized. Then it should add the two initialized values together, leaving the result in the third distance variable. Finally display the third variable. 6.Write a program to demonstrate the usage of default arguments using suitable example. 7.Write a program to demonstrate the usage of inline function using suitable example. 8. Explain the concept of this pointer with the help of examples. 9. Write a program to show the utility of Scope Resolution Operator using suitable example 10. Demonstrate the concept of Static Data Member & Static Member functions using a suitable example. FUNCTION OVERLOADING: 11. Write a program that use function overloading to do the following task-

Find the max. of two numbers Find the max of three numbers

12. Write a program that use function overloading to do the following task-

i. Compute xy , where x and y both are of int type. ii. Compute xy, where x is float type and y is int type.

13. Write a C++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a complex number:

Course Code: PMC 201 L T P C Course Name: C++ & CBNST Lab 0 0 4 2

Graphic Era Hill University, Dehradun

a. ADD(a, s2) – where ‘a’ is an integer (real part) and s2 is a complex number b. ADD(s1, s2) – where s1 and s2 are complex numbers FRIEND

14. WAP which uses a FRIEND function, that is friend to many classes. (Topper out of girls and boys)

15. Write a program to swap the value of private data of two objects of different classes.

CBNST LAB 1. 16. Write a Program in C to find the absolute errors, relative errors and error

in percentage. 2. Write a Program in C to round-off the number 3.1418235416 after truncating

to 3 places. Practical to find the Root of transcdental Equation:

3. Write a Program in C to find the root of equation Ax2 + Bx + c=0 (Sridharacharya).

4. Write a Program in C to find the root of an equation using Bisection method. 5. Write a Program in C to find the root of an equation using Regular falsi

method. 6. Write a Program in C to find the root of an equation using Newton Raphson

method. 7. Write a Program in C to find the root of an equation using fixed point iteration

method. 8. Write a Program in C to find the root of an equation using Secant method. Practical to find the value of a polynomial at a given point.

9. Write a Program to find value of function using Newton forward Interpolation formula.

Course Code: PMC 202 L T P C Course Name: Internet Technology Lab 0 0 4 2

Graphic Era Hill University , Dehradun

1. Programs to implement Text Formatting and Text Alignment in HTML. 2. Program to implement List, and Table Tags . 3. Program to implement all types of hyperlink and Image Mapping. 4. Program to enhance the layout of web page using frames. 5. Program to implement different ways of cascading styles sheets. 6. Write an program to create a basic slide show with the help of javascript.

7. Demonstrate with example Pseudo class effects.

8. Demonstrate with example menu bar for a website.

9. Demonstrate regular expressions Demo.

10. Demonstrate a using JavaScript validations.

11. Demonstrate with example XML and DTD

12. Program for showing basic features of PHp

13. Program showing PHP MYQL interaction.

Suggested Books:

Computer Networks and Internets with Internet Applications (Third Edition)

Author: Douglas E.Comer

Publisher: Prentice Hall, ISBN: 0-13-091449-5, 2001.

Deitel M., Deitel P. J., Goldberg, A. B.: Internet & World Wide Web How to

Program, 3rd Edition, Pearson education, 2004.