Advanced Web Programming (Question Paper) [October – 2018 | Choice Based Syllabus]

Nov 12, 20181 like2,918 views

This document is a question paper for an Advanced Web Programming exam covering topics like data types in C#, control structures, object-oriented programming concepts, ASP.NET page lifecycle, validation controls, database concepts, XML, authentication, authorization and Ajax. It contains 5 questions with 3 subquestions each, asking students to attempt any 3 subquestions from each question. The questions assess knowledge of concepts through explanation, examples and code snippets. It provides guidelines like writing question numbers clearly, not mixing subquestions, adding comments and assumptions. No electronic devices are allowed during the exam.

B.SC.IT: SEMESTER – V
[Choice Based Syllabus]
PAPER – III
ADVANCED
WEB
PROGRAMMING

MUMBAI UNIVERSITY
QUESTION PAPER
ADVANCED WEB PROGRAMMING
(OCTOBER – 2018 | CHOICE BASED SYLLABUS)
B.SC.IT
(SEMESTER – V)
KjT FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB 1
Time: 2 ½ Hours Total Marks: 75
Note:
(1) All Questions (Q1 To Q5) are Compulsory.
(2) Figures on the right indicate total marks. All sub questions carry equal marks.
(3) Write the question numbers clearly, as mentioned in the question paper.
(4) Mixing of sub-questions is not allowed.
(5) Draw diagrams and give examples whenever necessary.
(6) Write the comments in the program/algorithm and write the assumptions, if any.
(7) Use of calculator or any electronic gadget is not allowed.
Q.1 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Explain different types of Data Types in C#. (5)
(B) Give syntax of foreach loop. Explain with example. (5)
(C) Difference between Structures and Classes. (5)
(D) Explain Polymorphism with suitable example. (5)
(E) What are the rules in defining a Constructor? Explain Static Constructor with example. (5)
(F) Difference between Public Assembly and Private Assembly. (5)
Q.2 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Explain ASP.NET Life Cycle Page. (5)
(B) Explain the use of web.config files in ASP.NET Application. (5)
(C) Explain Calendar Control with example in ASP.NET. (5)
(D) Explain the use of RangeValidator with example? (5)
(E) Describe the working of Chart Control? (5)
(F) Explain the Anatomy of an ASP.NET Application. (5)
Q.3 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Why Exception Handling is required? Write syntax for User Defined Exception? (5)
(B) Write a program to create a new cookie with the name "Username" and add it to the HttpResponse
Object on the click of a button. Set the expiry date of the cookie to One Year from Now.
(5)
(C) What is Skin file? How to use it? (5)
(D) Write the difference between Request Cookies and Response Cookies? (5)
(E) Explain Keys and Mode HttpSessionState Members? (5)
(F) What is Application State? Explain with examples? (5)
Q.4 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) List and explain ADO.NET Objects. (5)
(B) Differentiate between DataSet and DataReader. (5)
(C) What is Data Binding? Explain its types. (5)
(D) What is a GridView Control? Explain how to enable paging and sorting features of GridView? (5)
(E) What is the Application Services provided in ASP.NET? Explain? (5)
(F) Explain any 2 FormView Templates with examples? (5)
Q.5 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) What is XmlTextWriter? Explain with example. (5)
(B) Explain the steps to use Windows Authentication with sample code? (5)
(C) What is XML Validation? (5)
(D) What is Ajax? Explain its Disadvantages? (5)
(E) How to authorize specific users in web.config file? Explain with example. (5)
(F) Explain Accordion in ASP.NET Ajax Control Toolkit. (5)

This document is a question paper for the Internet of Things course from Mumbai University. It contains 5 questions with 3 subquestions each, for a total of 15 marks per question. Question 1 asks students to explain concepts like what IoT is, IP vs UDP protocols, and maintaining privacy of IoT devices. Question 2 covers topics such as prototyping IoT devices, open source technologies, and IDE features. Question 3 focuses on non-digital prototyping methods, APIs, 3D printing and CNC milling. Question 4 is about optimization techniques, types of memory, business models and funding IoT startups. Finally, Question 5 addresses PCB design, third-party manufacturing, crowdsourcing, certification and open

Tsp branch and-boundSaravanan Natarajan

The document discusses the Travelling Salesman Problem (TSP). TSP aims to find the shortest possible route for a salesman to visit each city in a list only once and return to the origin city. It describes the problem as finding the optimal or least cost Hamiltonian circuit in a graph where cities are nodes and distances between cities are edge costs. The document provides an example problem with 5 cities, calculates possible routes and costs, and illustrates the branch and bound algorithm to solve TSP by systematically eliminating suboptimal routes until the optimal route is found.

Type Checking(Compiler Design) #ShareThisIfYouLikeUnited International University

The purpose of types: To define what the program should do. e.g. read an array of integers and return a double To guarantee that the program is meaningful. that it does not add a string to an integer that variables are declared before they are used To document the programmer's intentions. better than comments, which are not checked by the compiler To optimize the use of hardware. reserve the minimal amount of memory, but not more use the most appropriate machine instructions.

Uncertainty in AIAmruth Veerabhadraiah

The document discusses sources and approaches to handling uncertainty in artificial intelligence. It provides examples of uncertain inputs, knowledge, and outputs in AI systems. Common methods for representing and reasoning with uncertain data include probability, Bayesian belief networks, hidden Markov models, and temporal models. Effectively handling uncertainty through probability and inference allows AI to make rational decisions with imperfect knowledge.

Relationship Among Token, Lexeme & PatternBharat Rathore

Relationship among Token, Lexeme and Pattern Outline Token Lexeme Pattern Relationship Tokens : A token is sequence of characters that can be treated as a unit/single logical entity. Examples Keywords Examples : for, while, if etc. Identifier Examples : Variable name, function name, etc. Operators Examples : '+', '++', '-' etc. Separators Examples : ',' ';' etc. Pattern Pattern is a rule describing all those lexemes that can represent a particular token in a source language. Lexeme It is a sequence of characters in the source program that is matched by the pattern for a token. Example : “float”, “=“, “223”, “;”

Time Table Management SystemMuhammad Zeeshan

Online Bus Ticket Reservation SystemTuvshinbayar Davaa

The document describes an online bus ticket reservation system that allows customers to book tickets, check availability, and track reservations online instead of having to visit booking counters in person. It includes requirements for functionality like maintaining customer profiles and booking details in a database, calculating fares automatically based on distance and age, and providing search, booking and cancellation features for employees to manage reservations. Tables to store information about buses, routes, bookings and more are also outlined.

Smart India Hackathon Idea SubmissionGaurav Ganna

Attendance management system project report.Manoj Kumar

Topic 1.4: Randomized AlgorithmsKM Bappi

The document discusses randomized algorithms. Randomized algorithms employ randomness as part of their logic, using random bits to guide their behavior. This allows them to achieve good average performance over many trials. The output or running time of a randomized algorithm is a random variable. Advantages include simplicity, efficiency through testing many possibilities, and better complexity bounds than deterministic algorithms. Disadvantages include potential for hardware failures from long runtimes, high memory usage for repeated processes, and longer runtimes as operations split into many parts.

Graph coloring using backtrackingshashidharPapishetty

This document summarizes graph coloring using backtracking. It defines graph coloring as minimizing the number of colors used to color a graph. The chromatic number is the fewest colors needed. Graph coloring is NP-complete. The document outlines a backtracking algorithm that tries assigning colors to vertices, checks if the assignment is valid (no adjacent vertices have the same color), and backtracks if not. It provides pseudocode for the algorithm and lists applications like scheduling, Sudoku, and map coloring.

Student feedback systemAkshay Surve

This document outlines the project plan for developing a Student Feedback System. It includes sections on project analysis, hardware and software requirements, planning and scheduling, project design using UML diagrams, database design using ER diagrams, testing strategies, and conclusions. The project aims to develop a web-based system allowing students to provide feedback to staff online and the principal to view feedback reports. It will save time compared to a manual process and help enhance staff performance.

Prim's algorithmPankaj Thakur

Online Bus Reservation SystemA-Tech and Software Development

8 queens problem using back trackingTech_MX

The document discusses solving the 8 queens problem using backtracking. It begins by explaining backtracking as an algorithm that builds partial candidates for solutions incrementally and abandons any partial candidate that cannot be completed to a valid solution. It then provides more details on the 8 queens problem itself - the goal is to place 8 queens on a chessboard so that no two queens attack each other. Backtracking is well-suited for solving this problem by attempting to place queens one by one and backtracking when an invalid placement is found.

The n Queen ProblemSukrit Gupta

This document summarizes the n-queen problem, which involves placing N queens on an N x N chessboard so that no queen can attack any other. It describes the problem's inputs and tasks, provides examples of solutions for different board sizes, and outlines the backtracking algorithm commonly used to solve this problem. The backtracking approach guarantees a solution but can be slow, with complexity rising exponentially with problem size. It is a good benchmark for testing parallel computing systems due to its iterative nature.

Asymptotic notationsNikhil Sharma

The document discusses asymptotic notations that are used to describe the time complexity of algorithms. It introduces big O notation, which describes asymptotic upper bounds, big Omega notation for lower bounds, and big Theta notation for tight bounds. Common time complexities are described such as O(1) for constant time, O(log N) for logarithmic time, and O(N^2) for quadratic time. The notations allow analyzing how efficiently algorithms use resources like time and space as the input size increases.

online quiz application project presentationGyanuRana

This thesis describes the development of an Android-based multiple choice quiz application called Quizzy. Quizzy allows users to practice for exams by creating MCQ questions across various categories like computer science, verbal, and analytical. It includes features like hints, skipping questions, and pausing that act as lifelines. The app shows progress and results. It was built using a TinyDB database on the Android platform to store and retrieve questions. The goal was to help users prepare for admissions and recruitment tests through an engaging and interactive quiz-based learning experience.

Project report on online examination systemMo Irshad Ansari

Dijkstra's algorithm presentationSubid Biswas

Presentation on a website of Department of computer science and engineeringS.M. Murad Hasan Tanvir

This document describes a student project to create a website for a Computer Science and Engineering department. It includes sections on project members, acknowledgements, objectives, an overview of site content which will include information on people, academic programs, courses, facilities, and an admin panel. It provides details on implementation of specific pages and sections, including teacher and student listings, class routines, results, books, and a registration system. It concludes with notes on the database and limitations of the initial site created as a student project.

Chess board problem(divide and conquer)RASHIARORA8

The document describes the divide and conquer algorithm for solving the defective chessboard problem. The problem is to cover a chessboard of size n x n, where n is a power of 2, with L-shaped tiles (trominoes), except for one defective square. The algorithm divides the board recursively into equal half-sized subboards until reaching boards of size 2x2, which can be covered with at most one tile. It then combines the solutions to the subproblems to construct a solution for the original board. The time complexity of this divide and conquer algorithm is O(n^2).

Strassen's matrix multiplicationMegha V

The document discusses Strassen's algorithm for matrix multiplication. It begins by explaining traditional matrix multiplication that has a time complexity of O(n3). It then explains how the divide and conquer strategy can be applied by dividing the matrices into smaller square sub-matrices. Strassen improved upon this by reducing the number of multiplications from 8 to 7 terms, obtaining a time complexity of O(n2.81). His key insight was applying different equations on the sub-matrix multiplication formulas to minimize operations.

Sorting AlgorithmsPranay Neema

This document discusses various sorting algorithms and their complexities. It begins by defining an algorithm and complexity measures like time and space complexity. It then defines sorting and common sorting algorithms like bubble sort, selection sort, insertion sort, quicksort, and mergesort. For each algorithm, it provides a high-level overview of the approach and time complexity. It also covers sorting algorithm concepts like stable and unstable sorting. The document concludes by discussing future directions for sorting algorithms and their applications.

Waste Management SystemAbhishek Chawda

Project for Student Result SystemKuMaR AnAnD

This document describes a student result system project created using C programming language. It allows users to perform operations like adding student records, viewing all records, searching records by roll number, calculating average marks, and sorting records by marks or roll number. The key algorithms used are merge sort for sorting and linear search for searching and insertion. The source code implements functions for the main menu, record insertion, display, sorting, searching, and average calculation. UML diagrams show the design of the student record class and interaction between functions.

Minor project Report for "Quiz Application"Harsh Verma

This document summarizes a project report for a quiz application submitted to Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal. The report describes a web-based quiz application developed by students Bhumika Kanojia, Durgesh Mishra, and Harsh Verma to fulfill their Bachelor of Engineering degree requirements. The application allows users to play various quizzes on technical, general knowledge, and other topics. Users can view answers, ask questions, and submit their own questions and answers after admin approval. The report covers requirements analysis, design, implementation, and testing of the quiz application.

Fuzzy c means manual workDr.E.N.Sathishkumar

Fuzzy C-means is an extension of k-means clustering that allows data points to belong to multiple clusters simultaneously. It assigns a membership value between 0 and 1 to each data point for each cluster, indicating the likelihood of membership. The example demonstrates fuzzy C-means clustering on a dataset with 6 data points and 2 clusters, calculating the membership values and distances over multiple iterations until the cluster centroids stabilize.

ASP.NET With C# (May – 2018) [IDOL: Revised Course | Question Paper]Mumbai B.Sc.IT Study

This document is a question paper for the ASP.NET with C# course for semester 5 of the B.Sc. IT program. It contains 7 sections with a total of 27 multiple choice and descriptive questions worth 100 marks. The questions cover topics like C# concepts, Windows forms, ASP.NET controls and features, ADO.NET, jQuery, web services and more. Students are instructed to answer 15 out of the 27 questions in detail within the allotted time of 3 hours.

Web Programming (Question Paper) [April – 2017 | 75:25 Pattern]Mumbai B.Sc.IT Study

More Related Content

What's hot (20)

Attendance management system project report.Manoj Kumar

Topic 1.4: Randomized AlgorithmsKM Bappi

Graph coloring using backtrackingshashidharPapishetty

Student feedback systemAkshay Surve

Prim's algorithmPankaj Thakur

Online Bus Reservation SystemA-Tech and Software Development

8 queens problem using back trackingTech_MX

The n Queen ProblemSukrit Gupta

Asymptotic notationsNikhil Sharma

online quiz application project presentationGyanuRana

Project report on online examination systemMo Irshad Ansari

Dijkstra's algorithm presentationSubid Biswas

Presentation on a website of Department of computer science and engineeringS.M. Murad Hasan Tanvir

Chess board problem(divide and conquer)RASHIARORA8

Strassen's matrix multiplicationMegha V

Sorting AlgorithmsPranay Neema

Waste Management SystemAbhishek Chawda

Project for Student Result SystemKuMaR AnAnD

Minor project Report for "Quiz Application"Harsh Verma

Fuzzy c means manual workDr.E.N.Sathishkumar

Attendance management system project report.Manoj Kumar

Topic 1.4: Randomized AlgorithmsKM Bappi

Graph coloring using backtrackingshashidharPapishetty

Student feedback systemAkshay Surve

Prim's algorithmPankaj Thakur

Online Bus Reservation SystemA-Tech and Software Development

8 queens problem using back trackingTech_MX

The n Queen ProblemSukrit Gupta

Asymptotic notationsNikhil Sharma

online quiz application project presentationGyanuRana

Project report on online examination systemMo Irshad Ansari

Dijkstra's algorithm presentationSubid Biswas

Presentation on a website of Department of computer science and engineeringS.M. Murad Hasan Tanvir

Chess board problem(divide and conquer)RASHIARORA8

Strassen's matrix multiplicationMegha V

Sorting AlgorithmsPranay Neema

Waste Management SystemAbhishek Chawda

Project for Student Result SystemKuMaR AnAnD

Minor project Report for "Quiz Application"Harsh Verma

Fuzzy c means manual workDr.E.N.Sathishkumar

Similar to Advanced Web Programming (Question Paper) [October – 2018 | Choice Based Syllabus] (20)

ASP.NET With C# (May – 2018) [IDOL: Revised Course | Question Paper]Mumbai B.Sc.IT Study

Web Programming (Question Paper) [April – 2017 | 75:25 Pattern]Mumbai B.Sc.IT Study

BScIT: Semester – V (May - 2018) [IDOL: Old Course | Question Paper]Mumbai B.Sc.IT Study

BScIT: Semester – V (May - 2018) [IDOL: Old Course | Question Paper] ,2018 question papers ,may - 2018 questions paper ,bscit ,mumbai university ,mumbai university question paper ,revised course ,tybscit question papers ,bscit question paper ,semester 5 ,bscit semester 5 ,semester 5 question paper ,idol question paper ,idol revised course ,network security ,asp.net with c# ,software testing ,advanced java ,linux administration ,mumbai bscit study ,bscit study ,c# ,linux

B.Sc.IT: Semester – V (December – 2017) [Revised Course | Question Paper]Mumbai B.Sc.IT Study

This document contains a question paper for the Network Security subject for B.Sc. IT students at Mumbai University. It has 7 sections with a total of 100 marks. Each section contains 3-4 questions with varying marks. The questions cover topics related to network security such as Kerberos, IPsec, firewalls, viruses, worms, cryptography, digital signatures, public key infrastructure etc. Students are required to attempt 3 questions out of 4-6 questions in each section within the allotted time of 3 hours.

Enterprise Java (Question Paper) [October – 2018 | Choice Based Syllabus]Mumbai B.Sc.IT Study

This document is a past question paper for the Enterprise Java course from Mumbai University. It contains 5 sections with a total of 15 questions covering topics related to Java EE, servlets, JSP, EJB, and ORM/JPA frameworks like Hibernate. The paper tests the student's knowledge of key concepts, syntax, and programming skills for developing enterprise applications using these Java technologies. It allocates 2.5 hours to attempt 15 compulsory questions worth a total of 75 marks.

Advanced Web Programming (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study

This document outlines the questions and structure for an exam on Advanced Web Programming. It includes 15 questions across 5 sections. The questions cover topics like namespaces, arrays, .NET framework architecture, inheritance, constructors, delegates, validation controls, exceptions, debugging, cookies, viewstate, CSS, ADO.NET objects, data readers, gridviews, authentication, impersonation, and AJAX controls. Students must attempt 3 questions from each section, for a total of 15 questions and a maximum of 75 points on the exam. Diagrams and examples are encouraged for full marks.

Object Oriented Programming (Question Paper) [April – 2017 | 75:25 Pattern]Mumbai B.Sc.IT Study

Next Generation Technologies (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study

This document outlines the structure and questions for a B.Sc. IT semester 5 exam focusing on next generation technologies. It contains 5 sections with 3 questions each, covering topics like Big Data, NoSQL databases, MongoDB, jQuery, JSON, and more. Students must attempt 3 questions from each section. The exam is 2.5 hours long and carries a total of 75 marks. Diagrams and examples should be provided as needed. Use of calculators or other electronic devices is not permitted during the exam.

B.Sc.IT: Semester – V (April – 2015) [Revised Course | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester – V (May – 2016) [Revised Course | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester – V (October – 2016) [Revised Course | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester - V (November – 2014) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester – V (April - 2015) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester – V (April – 2014) [Revised Course | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester - V (November - 2017) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study

This document is a question paper for the November 2017 semester 5 B.Sc. IT Network Security exam from Mumbai University. It contains 7 questions with multiple parts each. The questions cover topics like network security principles, encryption algorithms, digital certificates, protocols, and attacks. Students have 2.5 hours to answer as many questions as possible. Marks are awarded based on the number and depth of questions answered. Diagrams can be included where needed.

B.Sc.IT: Semester – V (November - 2017) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study

ASP.NET With C# (November - 2017) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester - V (October - 2013) [60:40 Pattern | Question Paper]Mumbai B.Sc.IT Study

B.Sc.IT: Semester – V (April - 2017) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study

Project Management (April – 2016) [Question Paper | CBSGS: 75:25 Pattern]Mumbai B.Sc.IT Study

Project Management (April – 2016) [Question Paper | CBSGS: 75:25 Pattern] april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system