Sessional 1-1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

Course Name: JavaProgramming Test - 1 M.M.

: 40
CourseNo.:CST3403 Time: 1.15 Hrs
:
Note Attempt all questions. Dt:25.04.2024
Q1(a) Explain the following object oriented concepts : (7)
(a) Polymorphism (b) Encapsulation (c) Inheritance.
b How arrays are defined and initialized in java? Explain with an example.
(5)
a
Q2, Differentiate between method oyerloading and overriding. Create class called Vehicle and (8)
a class calledCar which extends Vehicle. Illustrate overloading and overriding using the

relationship between the classes.


Q3{a)Write a simple program in java to depict class Cextends class B, class B extends class A and (6)
explain how constructors are called if an object for class C is created.
bExplain the following keywords (i) this (ii) super (i) final (iv) static
:
(8)
Q4. Define exception. Write a simple program in java to generate arithmetic exceptionand print 6)

the descriptíon of exception'through tie program.


Data Structures(CST3401) Max. Marks: 50
Sessional 1 Time linit: lh 30 min
Batch 2022 Date :3.04.2024

Explain different Notations used or Asymplotic Analysis of Algoriths. Also discuss rclationship betw.en them. (10) CO1

Q2 Write an algorithe io convert Inlix to prefix expression. Using the algorithn show conversion
of foliovig infixto prefix: (10) CO3
((AB}*C -(D-E))S(FHG)
What are Circular (Qucues? What advantage Circular Qucues has over lincar Qucucs? IDiscuss impler:en ation of Circular (19) CO2
Q3
Qucucs.

Q4 Explain dynanic inplementation of a Stack and what advantage it has over slack's stalic implementatigjt. (10) CO2

Q5 Write an algorithm for following opcrations: (10) CO3


nscrt an clmcut at its correct position in an ordercd (ascending) single linked lis.
Delete even positioncd nodes (2"d,4h,6..) rom doubly linked list
cOVERNMENTCOLLEGE OF ENGINEERING AND TECHNOLOGY,
CHAK BHALWAL, JAMMU
Sessional: - 1 Subject:-RDBMS
IMax. Marks: - 50 Branch:-Computer
Engineering
Semester: - 4" Note :-Allquestions are „ompulsory

o1 a)what is the difference between Databasu system and File system? (5)
b) What are the advantages and Disadvantages of DBMS? (5)
Q2 Explain Data Model Classifications. (10)
Ç3 what is Extended ER Model? Explain with suitable example. (10)
Q4 a) Define the following: (5)
a. Schema b. Instance C. Attributes d. Domain e. Database
b)Discuss the various DML, DCL and DDL commands. (5)
.1-hua uith guitahloo1
GOVT COLLEGE OF ENGINEERING AND TECHNOLOGY, JAMMU, J&K (UT
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SESSIONAL-1

COURSE TITLE: FUNDAMENTALS OF MACHINE LEARNING MAX. MARKS: 40 COURSE CODE: CST3404

Q1. -a) Explin indexing and slicing in Python with respect to strings. Provide an example for each. (Co1) (5 Marks)
b) Given the string message = "Hello, World!", write code to extract the substring World' from message. (co1) (5 Marks]
02. a) Discuss the significance of negative indexing in Python,Write a code to reverse a string using slicing. (Co1) (5 Marks)
b) Write Python code to read a CSV file into a Pandas DataFrame named df. (Co2) (5 Marks)
Q3. Explain the role of Numpy for scientific computing, Pandas for data manipulation and Matplotlib (Co2) (10 Mark
for data visualization in Python.
Q4. Explain simple linear regression. Calculate the slope and intercept for a simple ljnear regression model (co3) (10 Mark
given the dataset: Study Hours(x): 2,3,4,5,6 Exam Sccres (y): 65,67,70,72,74
GOVT. COLLEGE OFENGINEERING AND TECHNOLOGY, JAMMU
DEPARTMENT OF MATHEMATICS
1 Sessional Test

COURSE: Discrete Mathematics (BST-8401) B.E 4" SEM, CSE,


BATCH 2022 DATE: 22-04-2024
MAXIMUM MARKS:10 TIMEALLOWED:1.5 hrs
NOTE:ATTEMPT ALL QUESTIONS. EACH QUESTION CARRIES 2.5 MARKS.
CO3 Q1: Prove that sum of degrees of all the vertices in a graph G is twice the number of edges in G
CO3 Q2: Prove that a simple graph withn vertices and k components cannot have more than (n-k\(n
k+1)/2 edges. OR
Define a planar graph. State and prove Euler's formula for connected planar graphs.
CO4 03: Define tree. Prove that there is one and only one path between any two vertices in a
tree.
C04 Q4: Prove that a graph with n vertices, n-1 edges and no cycles is connected.
OR
Define spanning tree. Prove that every connmected graph has atleast one spanning tree.

You might also like