Syllabus For S.Y.B.Sc. Programme: B.Sc.

Transcription

Academic Council 11/05/2017Item No:UNIVERSITY OF MUMBAISyllabus for S.Y.B.Sc.Programme: B.Sc.Course: Information Technologywith effect from the academic year2017 – 20181

Semester – 3Course 3P2USIT3P3USIT3P4Course TypeSkill Enhancement CourseCore SubjectCore SubjectCore SubjectCore SubjectSkill Enhancement CoursePracticalCore Subject PracticalCore Subject PracticalCore Subject PracticalUSIT3P5Core Subject PracticalCourse TitlePython ProgrammingData StructuresComputer NetworksDatabase Management SystemsApplied MathematicsPython Programming PracticalData Structures PracticalComputer Networks PracticalDatabase Management SystemsPracticalMobile Programming PracticalTotal CreditsCredits222222222220Semester – 4Course CodeUSIT401USIT402Course TypeSkill Enhancement CourseCore SubjectUSIT403Core SubjectUSIT404USIT405Core SubjectCore SubjectUSIT4P1USIT4P2Skill Enhancement CoursePracticalCore Subject PracticalUSIT4P3Core Subject PracticalUSIT4P4USIT4P5Core Subject PracticalCore Subject PracticalCourse TitleCore JavaIntroduction to EmbeddedSystemsComputer Oriented StatisticalTechniquesSoftware EngineeringComputer Graphics andAnimationCore Java PracticalIntroduction to EmbeddedSystems PracticalComputer Oriented StatisticalTechniques PracticalSoftware Engineering PracticalComputer Graphics andAnimation PracticalTotal CreditsCredits2222222222202

SEMESTER III3

B. Sc. (Information Technology)Semester – IIICourse Name: Python ProgrammingPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemUnitIIIIIICourse Code: USIT30152HoursMarksTheory tion: The Python Programming Language,History, features,Installing Python, Running Python program, Debugging : SyntaxErrors, Runtime Errors, Semantic Errors,Experimental Debugging,Formal and Natural Languages, The Difference Between Brackets,Braces, and Parentheses,Variables and ExpressionsValues and Types, Variables, Variable12Names and Keywords, Type conversion,Operators and Operands,Expressions, Interactive Mode and Script Mode, Order of Operations.Conditional Statements: if, if-else, nested if –elseLooping: for, while, nested loopsControl statements: Terminating loops, skipping specific conditionsFunctions: Function Calls, Type Conversion Functions, MathFunctions, Composition, Adding New Functions, Definitions andUses, Flow of Execution, Parameters and Arguments, Variables andParameters Are Local, Stack Diagrams, Fruitful Functions and VoidFunctions, Why Functions?Importing with from, Return Values,Incremental Development, Composition, Boolean Functions, More12Recursion, Leap of Faith, Checking TypesStrings: A String Is a Sequence, Traversal with a for Loop, StringSlices, Strings Are Immutable, Searching, Looping and Counting,String Methods, The in Operator, String Comparison, StringOperations.Lists: Values and Accessing Elements, Lists are mutable, traversing aList, Deleting elements from List, Built-in List Operators,Concatenation, Repetition, In Operator, Built-in List functions andmethodsTuples and Dictionaries: Tuples, Accessing values in Tuples, TupleAssignment, Tuples as return values, Variable-length argument tuples,Basic tuples operations, Concatenation, Repetition, in Operator,12Iteration, Built-in Tuple FunctionsCreating a Dictionary, Accessing Values in a dictionary, UpdatingDictionary, Deleting Elements from Dictionary, Properties ofDictionary keys, Operations in Dictionary, Built-In DictionaryFunctions, Built-in Dictionary MethodsFiles: Text Files, The File Object Attributes, DirectoriesExceptions: Built-in Exceptions, Handling Exceptions, Exception4

IVVwith Arguments, User-defined ExceptionsRegular Expressions – Concept of regular expression, various typesof regular expressions, using match function.Classes and Objects: Overview of OOP (Object OrientedProgramming), Class Definition, Creating Objects, Instances asArguments, Instances as return values, Built-in Class Attributes,Inheritance, Method Overriding, Data Encapsulation, Data HidingMultithreaded Programming: Thread Module, creating a thread,synchronizing threads, multithreaded priority queueModules: Importing module, Creating and exploring modules, Mathmodule, Random module, Time moduleCreating the GUI Form and Adding Widgets:Widgets: Button, Canvas,Checkbutton, Entry, Frame, Label, Listbox,Menubutton, Menu, Message, Radiobutton, Scale, Scrollbar, text,Toplevel, Spinbox, PanedWindow, LabelFrame, tkMessagebox.Handling Standard attributes and Properties of Widgets.Layout Management: Designing GUI applications with properLayout Management features.Look and Feel Customization:Enhancing Look and Feel of GUIusing different appearances of widgets.Storing Data in Our MySQL Database via Our GUI :Connectingto a MySQL database from Python, Configuring the MySQLconnection, Designing the Python GUI database, Using the INSERTcommand, Using the UPDATE command, Using the DELETEcommand, Storing and retrieving data from MySQL database.Books and References:Sr. No.Title1.Think Python2.An Introduction toComputer Science usingPython 33.Python GUIProgramming Cookbook4.Introduction to ProblemSolving with Python5.Murach’s Pythonprogramming6.Object-orientedProgramming in Python7.Exploring Python1212Author/sPublisher Edition YearAllen DowneyO’Reilly1st2012JasonMontojo, Jennifer SPD1st2014Campbell, Paul GriesBurkhard A. MeierPacktE. BalagurusamyTMH1st2016Joel Murach, MichaelUrbanMichael H.Goldwasser, st20081st2016B. Sc. (Information Technology)2015Semester – III5

Course Name: Data StructuresPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemUnitIIIIIIIVCourse Code: USIT30252HoursMarksTheory tion: Data and Information, Data Structure, Classification ofData Structures, Primitive Data Types, Abstract Data Types, Datastructure vs. File Organization, Operations on Data Structure,Algorithm, Importance of Algorithm Analysis, Complexity of anAlgorithm, Asymptotic Analysis and Notations, Big O Notation, BigOmega Notation, Big Theta Notation, Rate of Growth and Big ONotation.12Array:Introduction, One Dimensional Array, Memory Representationof One Dimensional Array, Traversing, Insertion, Deletion, Searching,Sorting, Merging of Arrays, Multidimensional Arrays, MemoryRepresentation of Two Dimensional Arrays, General MultiDimensionalArrays,SparseArrays, SparseMatrix, MemoryRepresentation of Special kind of Matrices, Advantages andLimitations of Arrays.Linked List: Linked List, One-way Linked List, Traversal of LinkedList, Searching, Memory Allocation and De-allocation, Insertion inLinked List, Deletion from Linked List, Copying a List into OtherList, Merging Two Linked Lists, Splitting a List into Two Lists,Reversing One way linked List, Circular Linked List, Applications of12Circular Linked List, Two way Linked List, Traversing a Two wayLinked List, Searching in a Two way linked List, Insertion of anelement in Two way Linked List, Deleting a node from Two wayLinked List, Header Linked List, Applications of the Linked list,Representation of Polynomials, Storage of Sparse Arrays,Implementing other Data Structures.Stack: Introduction, Operations on the Stack Memory Representationof Stack, Array Representation of Stack, Applications of Stack,Evaluation of Arithmetic Expression, Matching Parenthesis, infix andpostfix operations, Recursion.Queue: Introduction, Queue, Operations on the Queue, Memory12Representation of Queue, Array representation of queue, Linked ListRepresentation of Queue, Circular Queue,Some special kinds ofqueues, Deque,Priority Queue, Application of Priority Queue,Applications of Queues.Sorting and Searching TechniquesBubble, Selection, Insertion, Merge Sort. Searching: Sequential,126

VBinary, Indexed Sequential Searches, Binary Search.Tree:Tree,Binary Tree, Properties of Binary Tree, MemoryRepresentation of Binary Tree, Operations Performed on BinaryTree,Reconstruction of Binary Tree from its Traversals, HuffmanAlgorithm, Binary Search Tree, Operations on Binary Search Tree,Heap, Memory Representation of Heap, Operation on Heap, HeapSort.Advanced Tree Structures:Red Black Tree, Operations Performedon Red Black Tree, AVL Tree, Operations performed on AVL Tree,2-3 Tree, B-Tree.Hashing TechniquesHash function, Address calculation techniques, Common hashingfunctions Collision resolution, Linear probing, Quadratic,Doublehashing, Buckethashing, Deletion and rehashingGraph:Introduction, Graph, Graph Terminology, MemoryRepresentation of Graph, Adjacency Matrix Representation of Graph,Adjacency List or Linked Representation of Graph, OperationsPerformed on Graph, GraphTraversal, Applications of the Graph,Reachability, Shortest Path Problems, Spanning Trees.Books and References:Sr. No.Title1.A Simplified Approach toData Structures2.An Introduction to DataStructure with Applications3.Data Structure andAlgorithmSchaum’s Outlines Datastructure4.5.6.Data structure – APseudocode Approach withCData structureandAlgorithm Analysis in C12Author/sLalitGoyal, VishalGoyal, PawanKumarJean – PaulTremblay andPaul SorensonMaria RukadikarPublisherSPDEdition LipschutzTataMcGrawHillPrenticeHall India2nd20052nd2006AddisonWesley1st2006AM Tanenbaum,Y LangsamandMJ AugusteinWeiss, MarkAllen7

B. Sc. (Information Technology)Semester – IIICourse Name: Computer NetworksPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemUnitIIIIIIIVVCourse Code: USIT30352HoursMarksTheory tion: Data communications, networks, network types,Internet history,standards and administration.Network Models:Protocol layering, TCP/IP protocol suite, The OSImodel.Introduction to Physical layer:Data and signals, periodic analog12signals, digital signals, transmission impairment, data rate limits,performance.Digital and Analog transmission: Digital-to-digital conversion,analog-to-digital conversion, transmission modes, digital-to-analogconversion, analog-to-analog conversion.Bandwidth Utilization: Multiplexing and SpectrumSpreading:Multiplexing, Spread SpectrumTransmission media:Guided Media, Unguided MediaSwitching: Introduction, circuit switched networks, packet switching,structure of a switch.12Introduction to the Data Link Layer:Link layer addressing, DataLink Layer Design Issues, Error detection and correction, blockcoding, cyclic codes, checksum, forward error correction, errorcorrecting codes, error detecting codes.Data Link Control: DLC services, data link layer protocols, HDLC,Point-to-point protocol.Media Access Control: Random access, controlled access,channelization, Wired LANs – Ethernet Protocol, standard ethernet,12fast ethernet, gigabit ethernet, 10 gigabit ethernet,Wireless LANs: Introduction, IEEE 802.11 project, Bluetooth,WiMAX, Cellular telephony, Satellite networks.Connecting devices and Virtual LANs.Introduction to the Network Layer: Network layer services, packetswitching, network layer performance, IPv4 addressing, forwarding ofIP packets, Internet Protocol, ICMPv4, Mobile IPUnicast Routing:Introduction, routing algorithms, unicast routing12protocols.Next generation IP: IPv6 addressing, IPv6 protocol, ICMPv6protocol, transition from IPv4 to IPv6.Introduction to the Transport Layer: Introduction, Transport layerprotocols (Simple protocol, Stop-and-wait protocol, Go-Back-n12protocol, Selective repeat protocol, Bidirectional protocols), Transport8

layer services, User datagram protocol, Transmission control protocol,Standard Client0Server Protocols:World wide-web and HTTP,FTP, Electronic mail, Telnet, Secured Shell, Domain name system.Books and References:Sr. No.TitleAuthor/s1.Data Communication Behrouz A.and NetworkingForouzanTCP/IPBehrouz A.2.3.Protocol SuiteComputer NetworksForouzanAndrewTanenbaumB. Sc. (Information Technology)PublisherTata McGrawHillEditionFifthEditionTata 3Semester – III9

Course Name: Database Management SystemsPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemUnitIIIIIIIVVCourse Code: USIT30452HoursMarksTheory tion to Databases and TransactionsWhat is database system, purpose of database system, view of data,relationaldatabases, database architecture, transaction managementData ModelsThe importance of data models, Basic building blocks, Business rules,12The evolutionof data models, Degrees of data abstraction.Database Design,ER Diagram and Unified Modeling LanguageDatabase design and ER Model:overview, ERModel, Constraints,ERDiagrams, ERDIssues, weak entity sets, Codd’s rules, RelationalSchemas, Introduction to UMLRelational database model:Logical view of data, keys, integrity rules, Relational Databasedesign: features of good relational database design, atomic domainand Normalization (1NF, 2NF, 3NF, BCNF).Relational Algebra and Calculus12Relational algebra: introduction, Selection and projection, setoperations, renaming,Joins, Division, syntax, semantics. Operators,grouping and ungrouping,relationalcomparison.Calculus: Tuple relational calculus, Domain relational Calculus,calculus vsalgebra,computational capabilitiesConstraints, Views and SQLConstraints, types of constrains, Integrity constraints, Views:Introduction to views, data independence, security, updates on12views,comparison between tables and views SQL: data definition,aggregate function, Null Values, nested sub queries, Joined relations.Triggers.Transaction management and ConcurrencyControl Transaction management: ACID properties, serializability andconcurrency control, Lock based concurrency control (2PL,12Deadlocks),Time stamping methods, optimistic methods, databaserecovery management.PL-SQL: Beginning with PL / SQL,Identifiers and Keywords,Operators, Expressions, Sequences,Control Structures, Cursors andTransaction,Collections and composite data types, Procedures and12Functions, Exceptions Handling,Packages,With Clause andHierarchical Retrieval,Triggers.10

Books and References:Sr. No.Title1.Database System andConcepts2.Database Systems3.Programming with PL/SQLfor BeginnersIntroduction to DatabaseSystem4.Author/sA Silberschatz,H Korth, hEditionYearCengageLearningTwelfthEditionH.Dand, R.Patiland T. SambareC.J.DateX –TeamFirst2011PearsonFirst200311

B. Sc. (Information Technology)Semester – IIICourse Name: Applied MathematicsPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemUnitIIIIIICourse Code: USIT30552HoursMarksTheory : Inverse of a matrix, Properties of matrices, ElementaryTransformation, Rank of Matrix, Echelon or Normal Matrix, Inverseof matrix, Linear equations, Linear dependence and linearindependence of vectors, Linear transformation, Characteristics rootsand characteristics vectors, Properties of characteristic vectors, CaleyHamilton Theorem, Similarity of matrices, Reduction of matrix to adiagonal matrix which has elements as characteristics values.Complex Numbers: Complex number, Equality of complex numbers,Graphical representation of complex number(Argand’s Diagram),12Polar form of complex numbers, Polar form of x iy for different signsof x,y, Exponential form of complex numbers, Mathematicaloperation with complex numbers and their representation on Argand’sDiagram, Circular functions of complex angles, Definition ofhyperbolic function, Relations between circular and hyperbolicfunctions, Inverse hyperbolic functions, Differentiation andIntegration, Graphs of the hyperbolic functions, Logarithms ofcomplex quality, j( i)as an operator(Electrical circuits)Equation of the first order and of the first degree: Separation ofvariables, Equations homogeneous in x and y, Non-homogeneouslinear equations, Exact differential Equation, Integrating Factor,Linear Equation and equation reducible to this form, Method ofsubstitution.Differential equation of the first order of a degree higher than thefirst: Introduction, Solvable for p (or the method of factors), Solve fory, Solve for x, Clairaut’s form of the equation, Methods ofSubstitution, Method of tantCoefficients:Introduction, The Differential Operator, LinearDifferential Equation f(D) y 0, Different cases depending on thenature of the root of the equation f(D) 0, Linear differential equationf(D) y X, The complimentary Function, The inverse operator 1/f(D)and the symbolic expiration for the particular integral 1/f(D) X; thegeneral methods, Particular integral : Short methods, Particularintegral : Other methods, Differential equations reducible to the lineardifferential equations with constant coefficients.The Laplace Transform: Introduction, Definition of the Laplace12Transform, Table of Elementary Laplace Transforms, Theorems on12

IVVImportant Properties of Laplace Transformation, First ShiftingTheorem, Second Shifting Theorem, The Convolution Theorem,Laplace Transform of an Integral, Laplace Transform of Derivatives,Inverse Laplace Transform: Shifting Theorem, Partial fractionMethods, Use of Convolution Theorem, Solution of Ordinary LinearDifferential Equations with Constant Coefficients, Solution eTransformation of Special Function, Periodic Functions, HeavisideUnit Step Function, Dirac-delta Function(Unit Impulse Function),Multiple Integrals: Double Integral, Change of the order of theintegration, Double integral in polar co-ordinates, Triple integrals.Applications of integration: Areas, Volumes of solids.Beta and Gamma Functions – Definitions,Properties and Problems.Duplication formula.Differentiation Under the Integral SignError FunctionsBooks and References:Sr. No.Title1.A text book of AppliedMathematics Vol I2.Applied Mathematics II3.Higher EngineeringMathematicsAuthor/sP. N. Wartikarand J. N.WartikarP. N. Wartikarand J. N.WartikarDr. B. uneVidyathiGrahaKhannaPublications13

B. Sc. (Information Technology)Semester – IIICourse Name: Python Programming PracticalPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemCourse Code: USIT3P132HoursMarksPractical Examination2½50Internal---List of Practical1. Write the program for the following:a.Create a program that asks the user to enter their name and their age. Print out amessage addressed to them that tells them the year that they will turn 100 yearsold.b. Enter the number from the user and depending on whether the number is even orodd, print out an appropriate message to the user.c.Write a program to generate the Fibonacci series.d. Write a function that reverses the user defined value.e.Write a function to check the input value is Armstrong and also write thefunction for Palindrome.f.Write a recursive function to print the factorial for a given number.2.a.b.c.Write the program for the following:Write a function that takes a character (i.e. a string of length 1) and returns Trueif it is a vowel, False otherwise.Define a function that computes the length of a given list or string.Define a procedurehistogram() that takes a list of integers and prints ahistogram to the screen. For example, histogram([4, 9, 7]) should print thefollowing:********************3.a.b.Write the program for the following:A pangram is a sentence that contains all the letters of the English alphabet atleast once, for example: The quick brown fox jumps over the lazy dog. Your taskhere is to write a function to check a sentence to see if it is a pangram or not.Take a list, say for example this one:a [1,1,2,3,5,8,13,21,34,55,89]and write a program that prints out all the elements of the list that are less than 5.14

4.a.b.c.5.a.b.Write the program for the following:Write a program that takes two lists and returns True if they have at least onecommon member.Write a Python program to print a specified list after removing the 0th, 2nd, 4thand 5th elements.Write a Python program to clone or copy a listc.Write the program for the following:Write a Python script to sort (ascending and descending) a dictionary by value.Write a Python script to concatenate following dictionaries to create a new one.Sample Dictionary :dic1 {1:10, 2:20}dic2 {3:30, 4:40}dic3 {5:50,6:60}Expected Result : {1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60}Write a Python program to sum all the items in a dictionary.6.a.b.c.Write the program for the following:Write a Python program to read an entire text file.Write a Python program to append text to a file and display the text.Write a Python program to read last n lines of a file.7.a.b.c.Write the program for the following:Design a class that store the information of student and display the sameImplement the concept of inheritance using pythonCreate a class called Numbers, which has a single class attribute calledMULTIPLIER, and a constructor which takes the parameters x and y (these shouldall be numbers).i. Write a method called add which returns the sum of the attributes x and y.ii. Write a class method called multiply, which takes a single numberparameter a and returns the product of a and MULTIPLIER.iii. Write a static method called subtract, which takes two number parameters, band c, and returns b - c.iv. Write a method called value which returns a tuple containing the values of xand y. Make this method into a property, and write a setter and a deleter formanipulating the values of x and y.8.a.Write the program for the following:Open a new file in IDLE (“New Window” in the “File” menu) and save it asgeometry.py in the directory where you keep the files you create for this course.Then copy the functions you wrote for calculating volumes and areas in the“Control Flow and Functions” exercise into this file and save it.Now open a new file and save it in the same directory. You should now be able15

to importyour own module like this:importgeometryTry and add print dir(geometry) to the file and run it.b.9.a.b.Now write a function pointyShapeVolume(x, y, squareBase) that calculates thevolume of a square pyramid if squareBase is True and of a right circular cone ifsquareBase is False. x is the length of an edge on a square if squareBase is Trueand the radius of a circle when squareBase is False. y is the height of the object.First use squareBase to distinguish the cases. Use the circleArea and squareAreafrom the geometry module to calculate the base areas.Write a program to implement exception handling.Write the program for the following:Try to configure the widget with various options like: bg ”red”, family ”times”,size 18Try to change the widget type and configuration options to experiment withother widget types like Message, Button, Entry, Checkbutton, Radiobutton, Scaleetc.10. Design the database applications for the following:a.Design a simple database application that stores the records and retrieve thesame.b. Design a database application to search the specified record from the database.c.Design a database application to that allows the user to add, delete and modifythe records.Books and References:Sr.TitleNo.1.Think Python2.An Introduction toComputer Scienceusing Python 3Author/sPublisherAllen DowneyO’ReillyJasonMontojo, Jennifer SPDCampbell, Paul GriesEdition Year1st1st2012201416

B. Sc. (Information Technology)Semester – IIICourse Name: Data Structures PracticalPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemCourse Code: USIT3P232HoursMarksPractical Examination2½50Internal---List of Practical1. Implement the following:a.Write a program to store the elements in 1-D array and perform the operationslike searching, sorting and reversing the elements. [Menu Driven]b. Read the two arrays from the user and merge them and display the elements insorted order.[Menu Driven]c.Write a program to perform the Matrix addition, Multiplication and TransposeOperation. [Menu Driven]2.a.b.c.3.a.b.c.4.a.Implement the following for Linked List:Write a program to create a single linked list and display the node elements inreverse order.Write a program to search the elements in the linked list and display the sameWrite a program to create double linked list and sort the elements in the linkedlist.Implement the following for Stack:Write a program to implement the concept of Stack with Push, Pop, Display andExit operations.Write a program to convert an infix expression to postfix and prefix conversion.Write a program to implement Tower of Hanoi problem.b.c.Implement the following for Queue:Write a program to implement the concept of Queue with Insert, Delete, Displayand Exit operations.Write a program to implement the concept of Circular QueueWrite a program to implement the concept of Deque.5.a.b.c.Implement the following sorting techniques:Write a program to implement bubble sort.Write a program to implement selection sort.Write a program to implement insertion sort.6.a.b.Implement the following data structure techniques:Write a program to implement merge sort.Write a program to search the element using sequential search.17

c.Write a program to search the element using binary search.7.a.b.c.Implement the following data structure techniques:Write a program to create the tree and display the elements.Write a program to construct the binary tree.Write a program for inorder, postorder and preorder traversal of tree8.a.b.Implement the following data structure techniques:Write a program to insert the element into maximum heap.Write a program to insert the element into minimum heap.9.a.b.Implement the following data structure techniques:Write a program to implement the collision technique.Write a program to implement the concept of linear probing.10. Implement the following data structure techniques:a.Write a program to generate the adjacency matrix.b. Write a program for shortest path diagram.Books and References:Sr. No.Title1.Data Structures andAlgorithms UsingPython2.Data Structures Using Cand C in, PearsonTanenbaumEdition YearFirst2016First201518

B. Sc. (Information Technology)Semester – IIICourse Name:Computer NetworksPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemCourse Code: USIT3P332HoursMarksPractical Examination2½50Internal---List of Practical1. IPv4 Addressing and Subnettinga) Given an IP address and network mask, determine other information about theIP addresssuch as: Network address Network broadcast address Total number of host bits Number of hostsb) Given an IP address and network mask, determine other information about theIP addresssuch as: The subnet address of this subnet The broadcast address of this subnet The range of host addresses for this subnet The maximum number of subnets for this subnet mask The number of hosts for each subnet The number of subnet bits The number of this subnet2. Use of ping and tracert / traceroute, ipconfig / ifconfig, route and arp utilities.3.Configure IP static routing.4.Configure IP routing using RIP.5.6.7.8.9.10.Configuring Simple OSPF.Configuring DHCP server and client.Create virtual PC based network using virtualization software and virtual NIC.Configuring DNS Server and client.Configuring OSPF with multiple areas.Use of Wireshark to scan and check the packet information of following protocols HTTP ICMP TCP SMTP POP319

B. Sc. (Information Technology)Semester – IIICourse Name: Database Management SystemPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemCourse Code: USIT3P432HoursMarksPractical Examination2½50Internal---List of Practical1. SQL Statements – 1a. Writing Basic SQL SELECT Statementsb. Restricting and Sorting Datac. Single-Row Functions2.a.b.c.SQL Statements – 2Displaying Data from Multiple TablesAggregating Data Using Group FunctionsSubqueries3.a.b.c.Manipulating DataUsing INSERT statementUsing DELETE statementUsing UPDATE statement4.a.b.Creating and Managing TablesCreating and Managing TablesIncluding Constraints5.a.b.c.Creating and Managing other database objectsCreating ViewsOther Database ObjectsControlling User Access6.a.b.c.d.Using SET operators, Date/Time Functions, GROUP BY clause (advancedfeatures) and advanced subqueriesUsing SET OperatorsDatetime FunctionsEnhancements to the GROUP BY ClauseAdvanced Subqueries7.a.b.c.PL/SQL BasicsDeclaring VariablesWriting Executable StatementsInteracting with the Oracle Server20

d.Writing Control Structures8.a.b.c.Composite data types, cursors and exceptions.Working with Composite Data TypesWriting Explicit CursorsHandling Exceptions9.a.b.c.d.Procedures and FunctionsCreating ProceduresCreating FunctionsManaging SubprogramsCreating Packages10. Creating Database TriggersBooks and References:Sr. No.Title1.Database System andConcepts2.3.Programming with PL/SQLfor BeginnersPL/SQL ProgrammingAuthor/sA Silberschatz,H Korth, SSudarshanH.Dand , R.Patiland T. SambareIvan BayrossPublisherMcGrawHillEditionFifthEditionYearX –TeamFirst2011BPBFirst201021

B. Sc. (Information Technology)Semester – IIICourse Name: Mobile ProgrammingPeriods per week (1 Period is 50 minutes)CreditsEvaluation SystemCourse Code: USIT3P532HoursMarksPractical Examination2½50Internal---The practical’s will be based on HTML5, CSS, CORDOVA and PhoneGAP API. (Android will beintroduced later after they learn Java)List of PracticalSetting up CORDOVA, PhoneGAP Project and environment.1. Creating and building simple “Hello World” App using Cordova Adding and Using Buttons Adding and Using Event Listeners2. Creating and Using FunctionsUsing EventsHandlingand Using Back Button3. Installingand Using PluginsInstallingand Using Battery PluginInstallingand Using Camera Plugin4. Installingand Using Contacts PluginInstallingand Using Device PluginInstallingand Using Accelerometer Plugin5. Install and Using Device Orientation pluginInstall and Using Device Orientatio

10. Design the database applications for the following: a. Design a simple database application that stores the records and retrieve the same. b. Design a database application to search the specified record from the database. c. Design a database application to that allows the user to add, delete and modify the records.